*** 
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 
   * 15 variable(s) and 6 locs(s) and 11 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 : 15 vars, 6 locations, 11 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
 30 vars, 12(12==12) transitions and 7 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
start -----> {L=M, L=M__o, J=K, J=K__o, H=I, H=I__o, F=G, F=G__o, D=E, D=E__o, B=C, B=C__o, A=N, A=A__o} 

stop -----> {L>=0, L<=1, L+1>=A__o, N=A__o, A=A__o, C=C__o, E=E__o, G=G__o, I=I__o, K=K__o, M=M__o} 

lbl91 -----> {H>=0, H<=1, A=2, D=1, J=2, L=0, N=2, A__o=2, M=M__o, K=K__o, I=I__o, G=G__o, E=E__o, B=C, B=C__o} 

lbl13 -----> {H>=0, H<=1, A=2, B=0, D=1, J=2, L=1, N=2, A__o=2, M=M__o, K=K__o, I=I__o, G=G__o, E=E__o, C=C__o} 

start0 -----> {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, N=N__o, O=O__o} 

____start0 -----> {true} 

lbl53  -----> {A>D, D>=1, D>=H, H>=0, L=0, M=M__o, K=K__o, I=I__o, F=G, F=G__o, E=E__o, D+1=J, B=C, B=C__o, A=N, A=A__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.040000; iterations=4; descendings=0; } 

  print result in fast++
 Finished !