*** 
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 
   * 14 variable(s) and 13 locs(s) and 27 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 : 14 vars, 13 locations, 27 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
 28 vars, 28(28==28) transitions and 14 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*Hum* A problem occured when accelerating the loops, now trying with -noaccel option
   * Name of model = main, Name of file = main.fst 
   * 14 variable(s) and 13 locs(s) and 27 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 : 14 vars, 13 locations, 27 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
 28 vars, 28(28==28) transitions and 14 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f0 -----> {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, M=M__o, N=N__o} 

f15 -----> {C>=0, A=50, B=5, F=F__o, G=G__o, H=H__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o} 

f19 -----> {E>=0, C>=0, C<=5, E<=6, A=50, B=5, F=F__o, G=G__o, H=H__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o} 

f33 -----> {G>=0, C>5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f36 -----> {G+1<=H, C>5, G>=0, G<5, H<=6, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f41 -----> {J>=0, G+1>J, G+1<=H, G>0, H<=5, C>5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f50 -----> {G+1<=H, C>5, G>=0, G<5, H<=6, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f54 -----> {G+1<=H, J>=0, C>5, G+1>=J, G>=0, H<=5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f66 -----> {G>=1, C>5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f70 -----> {H>=0, G+1>H, G>=1, C>5, G<=5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f80 -----> {G<=4, C>5, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f84 -----> {C>5, G<=4, H>=1, G+1<=H, H<=6, A=50, B=5, F=5, M=50, K=K__o, L=L__o} 

f96 -----> {G<0, C>5, L=0, K=0, B=5, A=50, M=50, F=5} 

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

  print result in fast++
 Finished !