*** 
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 3 locs(s) and 4 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, 3 locations, 4 transitions 
   * The initial state has label f3 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 14 vars, 5(5==5) transitions and 4 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
empty(14)just one = 
{F=F__o,E=E__o,A=5000,$>=0,C+5000<=G__o,
                                      C+5001>G__o,C>0}just one = 
{F=F__o,
                                                                   E=E__o,
                                                                   A=5000,
                                                                   $>=0,
                                                                   C+5001>G__o,
                                                                   C>0,
                                                                   C+5000<=G__o}just one = 
{
F=F__o,E=E__o,A=5000,C>0,$>=0,C+10002>G__o,1>0,C+5000<=G__o}just one = 
{
F=F__o,E=E__o,A=5000,1>0,C>0,$>=0,C+5000<=G__o}just one = 
{F=F__o,E=E__o,
                                                            A=5000,1>0,C>0,
                                                            $>=0,C+5000<=G__o}
*** Results : 
   *  Invariants =  
f1 -----> {false} 

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

____f3 -----> {true} 

f0  -----> {A<C+5000, A+G__o>=C+5000, A<=5000, E=E__o, F=F__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.007000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !