*** 
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 
   * 12 variable(s) and 12 locs(s) and 34 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 : 12 vars, 12 locations, 34 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
 24 vars, 35(35==35) transitions and 13 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f30 -----> {A+B+10C>=1, B+21C>0, C>=0, E>=0, E<=1, C<9, B<9, B+C<18, A<=1, D=9, J=J__o, F=K__o, E=G} 

f31 -----> {A+2B+42C>0, A+B+10C>=1, B+21C>0, C>=0, E>=0, E<=1, C<9, B<9, B+C<18, A<=1, D=9, J=J__o, F=K__o, E=G} 

f36 -----> {A>=0, B+21C>0, B+10C>=0, C>=0, E>=0, E<=1, C<9, B<9, B+C<18, A<=1, A=H, D=9, J=J__o, F=K__o, E=G} 

f37 -----> {A>0, B+21C>0, B+10C>=0, C>=0, E>=0, E<=1, C<9, B<9, B+C<18, A<=1, D=9, J=J__o, F=K__o, E=G, A=H} 

f38 -----> {A>0, B+21C>0, B+10C>=0, C>=0, E>=0, E<=1, C<9, B<9, B+C<18, A<=1, D=9, J=J__o, F=K__o, E=G, A=H} 

f0 -----> {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, K=K__o, L=L__o} 

f16 -----> {A<=1, C<10, C+E>=1, A+10C>=1, E<=1, D=9, J=J__o, F=K__o} 

f19 -----> {A+10C>=1, C+E>=1, E<=1, C<9, A<=1, D=9, J=J__o, F=K__o} 

f49 -----> {A+10C>=1, C+E>=1, C>=9, E<=1, C<10, A<=1, D=9, J=J__o, F=K__o} 

f56 -----> {9A+9J<=E+18, C+E>=1, C>=9, 8A+8J<=C+E+7, 8A+89C+89E+703>=792J, 8A+169C+89E>=712J+97, A+10C+11E+98>=99J, A+198>=99E+99J, A+10C>=1, A+10C+88>=89E+89J, J<=1, J>=0, E<=1, A<=1, A+E+J<=2, C<10, F=K__o, D=9} 

____f0 -----> {true} 

f10  -----> {C>=0, C<10, A=1, D=9, E=1, J=J__o, I=I__o, H=H__o, G=G__o, F=K__o, B=B__o} 
 
f27  -----> {C>=0, E>=0, A+B+10C>=1, E<=1, B<10, A<=1, C<9, D=9, J=J__o, F=K__o, E=G} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.335000; iterations=8; descendings=0; } 

  print result in fast++
 Finished !