*** 
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 
   * 7 variable(s) and 7 locs(s) and 22 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 : 7 vars, 7 locations, 22 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
 14 vars, 23(23==23) transitions and 8 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f5 -----> {A+B<=4, B<3, B>=0, F=F__o} 

f7 -----> {B>=0, B<3, A+B<=4, F=F__o} 

f9 -----> {B>=0, B<3, 2A+3B<9, 3A+4B<=12, F=F__o} 

f16 -----> {B>=0, D>F, B<3, A+B<=4, A+2B<6, 2A+3B<=9, E=2, F=F__o} 

f25 -----> {B>=0, D<F, B<3, A+B<=4, A+2B<6, 2A+3B<=9, E=1, F=F__o} 

f0 -----> {E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, F=F__o, G=G__o} 

f30 -----> {A+B<=4, A+2B<7, B>=0, B<3, F=F__o} 

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

  print result in fast++
 Finished !