*** 
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 
   * 32 variable(s) and 34 locs(s) and 83 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 : 32 vars, 34 locations, 83 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 64 vars, 84(84==84) transitions and 35 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
empty(64)
*Hum* A problem occured when accelerating the loops, now trying with -noaccel option
   * Name of model = main, Name of file = main.fst 
   * 32 variable(s) and 34 locs(s) and 83 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 : 32 vars, 34 locations, 83 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 64 vars, 84(84==84) transitions and 35 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f0 -----> {B>=B__o, A=A__o, F=F__o, G=G__o, H=H__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__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, B1=B1__o, C1=C1__o} 

f44 -----> {B>=B__o, C>0, A<B, C1=C1__o, 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, A=A__o} 

f54 -----> {I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, A<B, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f57 -----> {J<=200, A<B, I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f59 -----> {false} 

f67 -----> {J<=200, A<B, I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f71 -----> {I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, A>L, J<=200, A<B, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f74 -----> {I+J>=J__o+1, C>=0, C+J>J__o, K>=K__o, J<=200, A>=K, A>L, A<B, I<=1, H=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f80 -----> {I+J>=J__o+1, C>=0, C+J>J__o, K>=K__o, J<=200, A>=K, A>L, A<B, I<=1, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f89 -----> {C+J>J__o, I<=1, J<=200, A<=L, A<B, K>=K__o, I+J>=J__o+1, C>=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f92 -----> {false} 

f99 -----> {K>=K__o, J>=J__o+1, C>=0, A<B, J<=200, I=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f104 -----> {C>=0, A<B, J<=200, K>=K__o, J>=J__o+1, I=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f106 -----> {false} 

f115 -----> {K>=K__o, J>=J__o+1, C>=0, A<B, J<=200, I=0, Z=1, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f117 -----> {false} 

f132 -----> {false} 

f134 -----> {false} 

f142 -----> {false} 

f151 -----> {false} 

f156 -----> {false} 

f161 -----> {A<B, I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, J<=200, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f163 -----> {false} 

f171 -----> {J<=200, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, I<=1, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f173 -----> {I<=1, J<=200, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, B>0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f181 -----> {J<=200, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, I<=1, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f188 -----> {I<=1, K>=K__o, I+J>=J__o+1, C>=0, C+J>J__o, J<=200, A<B, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f190 -----> {false} 

f201 -----> {A<B, I<=1, K>=K__o, I+J>=J__o+1, J<=200, C=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f211 -----> {A<B, I<=1, K>=K__o, I+J>=J__o+1, J<=200, C=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f218 -----> {K>=K__o, J>=J__o, A<B, J<=200, C=0, I=0, X=0, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

f228 -----> {false} 

f43 -----> {J>=J__o, K>=K__o, A<B, A=A__o, F=F__o, G=G__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, A1=A1__o, B1=B1__o, C1=C1__o} 

start -----> {D1=D1__o, C1=C1__o, 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, E1=E1__o, F1=F1__o} 

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

  print result in fast++
 Finished !