*** 
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 
   * 11 variable(s) and 9 locs(s) and 19 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 : 11 vars, 9 locations, 19 transitions 
   * The initial state has label start0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 22 vars, 20(20==20) transitions and 10 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
start -----> {H=I, H=I__o, F=G, F=G__o, D=E, D=E__o, B=C, B=C__o, A=J, A=A__o} 

stop -----> {B<=D+H, B+D<=H, B+H>=D, B+D+H>=0, A<=H, A=J, A=A__o, C=C__o, E=E__o, G=G__o, I=I__o} 

lbl81 -----> {B+D+1<=H, A+1>H, B+H>=D+1, B+D+H>=1, B+1<=D+H, A=J, A=A__o, C=C__o, E=E__o, G=G__o, I=I__o} 

lbl21 -----> {A>=H, B+D+H>=1, B+H>=D+1, B+1<=D+H, B+D+1<=H, I=I__o, G=G__o, E=E__o, C=C__o, A=J, A=A__o} 

lbl121 -----> {A>=H, B+D+H>=2, B+H>=D, B+2<=D+H, B+D<=H, F=0, I=I__o, G=G__o, E=E__o, C=C__o, A=J, A=A__o} 

lbl141 -----> {B+D+H>=0, B+H>=D+2, H<=J, B<=D+H, B+D+2<=H, A=J, F=1, J=A__o, I=I__o, G=G__o, E=E__o, C=C__o} 

lbl171 -----> {A>=H, B+D+H>=2, B+H>=D+2, B<=D+H, B+D<=H, F=2, I=I__o, G=G__o, E=E__o, C=C__o, A=J, A=A__o} 

lbl191 -----> {B+D+H>=0, B+H>=D, H<=J, B+2<=D+H, B+D+2<=H, A=J, F=3, J=A__o, I=I__o, G=G__o, E=E__o, C=C__o} 

start0 -----> {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, J=J__o, K=K__o} 

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

  print result in fast++
 Finished !