*** 
Aspic by Laure Gonnord, version 3.4  
Binary compiled on vendredi  1 janvier 2016 
Input file = main.fst 
***
 Configuration of Aspic * (version 3.4) 
   * name of file : main.fst 
   * inputfile of type (real) Fast format 
   * PRINTING all stuff for compsys ranking method 
   * DEBUG : Only prints analysis steps in a separate .log file 
   * PRINTING STUFF : Infile+Invars 
   * ANALYSIS 
    * with acceleration 
   * delay of widening = 1 
   * steps of descending sequence = 0 
   * newpath heuristic = disabled 
   * Name of model = main, Name of file = main.fst 
   * 30 variable(s) and 18 locs(s) and 47 transitions(s) in the .fst
   * Searching objective in fast strategy 
       -> we suppose that we want to compute post*(init) with init a convex set
       or post*(init) and bad if the state bad exists and bad is convex
       -> Initial region "init" found
       -> Finding initial polyhedron. OK. 
       -> No bad region
INFO : 30 vars, 18 locations, 47 transitions 
   * The initial state has label f2 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 60 vars, 48(48==48) transitions and 19 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{A1=A1__o,Z=Z__o,A=0,B=0,O=O__o,C=2D,2C=E,2C+3=F,2C+4=G,C=2H,
                 I=B1__o,N=N__o,K=1,L=0,M=0,P=P__o,Q=Q__o,R=R__o,S=S__o,
                 C=2D__o,T=T__o,U=U__o,V=V__o,W=W__o,X=X__o,J=J__o+1,Y=Y__o,
                 $>=0,1>0,C+1>=J}
*Hum* A problem occured when accelerating the loops, now trying with -noaccel option
   * Name of model = main, Name of file = main.fst 
   * 30 variable(s) and 18 locs(s) and 47 transitions(s) in the .fst
   * Searching objective in fast strategy 
       -> we suppose that we want to compute post*(init) with init a convex set
       or post*(init) and bad if the state bad exists and bad is convex
       -> Initial region "init" found
       -> Finding initial polyhedron. OK. 
       -> No bad region
INFO : 30 vars, 18 locations, 47 transitions 
   * The initial state has label f2 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 60 vars, 48(48==48) transitions and 19 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f2 -----> {B1=B1__o, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, C1=C1__o, D1=D1__o} 

f13 -----> {J>=J__o, B=0, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, O=O__o, P=P__o, Q=Q__o, R=R__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=X__o, Y=Y__o, Z=Z__o, A1=A1__o, I=B1__o} 

f24 -----> {J>=J__o, C<J, B=0, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, I=B1__o, C=2D, C=2H, C=2D__o, 2C=E, 2C+3=F, 2C+4=G} 

f31 -----> {J>=J__o, C<2J, C<J, B=0, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, I=B1__o, C=2D, C=2H, C=2D__o, 2C=E, 2C+3=F, 2C+4=G} 

f37 -----> {C<J, Q>=Q__o, J>=J__o, C<2J, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f40 -----> {C<2J, C<J, Q>=Q__o, N>=O, J>=J__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f44 -----> {Q<=0, C<2J, C<J, Q>=Q__o, N>=O, J>=J__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f50 -----> {Q<=0, C<2J, C<J, Q>=Q__o, N>=O, J>=J__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f57 -----> {C<J, C<2J, N>=O, J>=J__o, Q>=Q__o, Q<=0, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C+Q=A1, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f64 -----> {N>=O, J>=J__o, Q<=0, C<2J, C<J, Q>=Q__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, P=0, C=2D__o, N=N__o, P__o=0, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f71 -----> {C<2J, C<J, Q>=Q__o, Q>0, N>=O, J>=J__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f86 -----> {J>=J__o, N>=O, Q>0, Q>=Q__o, C<2J, C<J, 2C+4=G, 2C+3=F, 2C=E, C=2D__o, C=2H, C=2D, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f91 -----> {C<2J, C<J, Q>=Q__o, Q>0, N>=O, J>=J__o, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

f99 -----> {false} 

f103 -----> {false} 

f107 -----> {false} 

f118 -----> {J>=J__o, Q>=Q__o, N<O, C<2J, C<J, 2C+4=G, 2C+3=F, 2C=E, C=2D__o, C=2H, C=2D, P=P__o, R=R__o, S=S__o, T=T__o, W=W__o, X=X__o, Y=Y__o, V=V__o, N=N__o, I=B1__o} 

f1 -----> {J>=J__o, Q>=Q__o, N<O, C<2J, C<J, C=2D, 2C=E, 2C+3=F, 2C+4=G, C=2H, C=2D__o, N=N__o, P=P__o, R=R__o, S=S__o, T=T__o, V=V__o, W=W__o, X=X__o, Y=Y__o, I=B1__o} 

____f2 -----> {true} 
   * Remember that we have no bad region 
   * No accel has been applied
   * Stats =  { time=0.811000; iterations=17; descendings=0; } 

  print result in fast++
 Finished !