*** 
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 
   * 24 variable(s) and 21 locs(s) and 48 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 : 24 vars, 21 locations, 48 transitions 
   * The initial state has label f0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 48 vars, 49(49==49) transitions and 22 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f0 -----> {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, W=W__o, X=X__o} 

f17 -----> {B>=0, B<=10, A=100, 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} 

f20 -----> {B>0, B<=10, 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, X=X__o, W=W__o, V=V__o, B=C, T=T__o, A=100, S=S__o, U=U__o} 

f45 -----> {B>=0, B<=10, B=C, A=100, 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} 

f26 -----> {B>0, D>=0, D<=10, B<=10, A=100, 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, B=C} 

f57 -----> {B>=0, H>=0, H<=10, B<=10, A=100, G=200, 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, B=C} 

f60 -----> {H<=10, B>=0, H>0, B<=10, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, H=I, K=K__o, G=200, O=O__o, N=N__o, M=M__o, B=C, X=X__o, A=100, J=J__o, L=L__o} 

f85 -----> {H>=0, B<=10, B>=0, H<=10, B=C, G=200, H=I, A=100, 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} 

f66 -----> {B>=0, H>0, J>=0, J<=10, H<=10, B<=10, A=100, G=200, 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, H=I, B=C} 

f97 -----> {B>=0, H>=0, N>=0, N<=10, H<=10, B<=10, A=100, G=200, M=50, 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, H=I, B=C} 

f100 -----> {N<=10, B>=0, H>=0, H<=10, B<=10, N>0, M=50, R=R__o, Q=Q__o, P=P__o, H=I, N=O, G=200, X=X__o, W=W__o, V=V__o, B=C, T=T__o, A=100, S=S__o, U=U__o} 

f125 -----> {N<=10, B<=10, H>=0, N>=0, B>=0, H<=10, B=C, G=200, H=I, M=50, N=O, A=100, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=X__o} 

f106 -----> {B>=0, H>=0, N>0, P>=0, P<=10, N<=10, H<=10, B<=10, A=100, G=200, M=50, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, N=O, H=I, B=C} 

f137 -----> {B>=0, H>=0, O>=0, T>=0, T<=10, O<=10, H<=10, B<=10, A=100, G=200, M=50, N=O, S=20, X=X__o, W=W__o, V=V__o, U=U__o, H=I, B=C} 

f140 -----> {O>=0, T<=10, B>=0, H>=0, O<=10, H<=10, B<=10, T>0, H=I, N=O, G=200, X=X__o, W=W__o, V=V__o, B=C, S=20, A=100, M=50, T=U} 

f146 -----> {B>=0, H>=0, O>=0, T>0, V>=0, V<=10, T<=10, O<=10, H<=10, B<=10, A=100, G=200, M=50, N=O, S=20, X=X__o, W=W__o, T=U, H=I, B=C} 

f166 -----> {B<=10, T<=10, H>=0, N<=10, T>=0, N>=0, H<=10, B>=0, B=C, G=200, H=I, M=50, N=O, S=20, T=U, A=100} 

____f0 -----> {true} 

f29  -----> {B>0, D>0, F>=0, F<101, D<=10, B<=10, A=100, 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, D=E, B=C} 
 
f69  -----> {B>=0, H>0, J>0, L>=0, L<201, J<=10, H<=10, B<=10, A=100, G=200, 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, J=K, H=I, B=C} 
 
f109  -----> {B>=0, H>=0, N>0, P>0, R>=0, R<51, P<=10, N<=10, H<=10, B<=10, A=100, G=200, M=50, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, P=Q, N=O, H=I, B=C} 
 
f149  -----> {B>=0, H>=0, N>=0, T>0, V>0, X>=0, X<21, V<=10, T<=10, N<=10, H<=10, B<=10, A=100, G=200, M=50, S=20, V=W, T=U, N=O, H=I, B=C} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 4 location(s)
   * Stats =  { time=0.137000; iterations=1; descendings=0; } 

  print result in fast++
 Finished !