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

evalEx2entryin -----> {B=B__o, A=A__o, D=D__o, C=C__o} 

evalEx2bb3in -----> {A+A__o>=B+B__o} 

evalEx2bbin -----> {A>0, B>0, A+A__o>=B+B__o} 

evalEx2returnin -----> {A+A__o>=B+B__o} 

evalEx2bb2in -----> {A+A__o>=B+B__o, A>0, A<=C+1, B>0, A+B=C+D+2} 

evalEx2bb1in -----> {A>0, A+A__o>=B+B__o, A<=C+1, B>0, A+B=C+D+2} 

evalEx2stop -----> {A+A__o>=B+B__o} 

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

  print result in fast++
 Finished !