*** 
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 20 locs(s) and 59 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, 20 locations, 41 transitions 
   * The initial state has label evalrealheapsortstart and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 14 vars, 42(42==42) transitions and 21 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
evalrealheapsortstart -----> {E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, F=F__o, G=G__o} 

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

evalrealheapsortbb6in -----> {A>2, B>=1, A=A__o, D=D__o} 

evalrealheapsortreturnin -----> {A=A__o} 

evalrealheapsortbb3in -----> {B>=C, B>=1, A>C, A>2, C+1>=0, A=A__o, D=D__o} 

evalrealheapsortbb7in -----> {A>2, A<=B, A=A__o, D=D__o} 

evalrealheapsortbb5in -----> {C+1>=0, A>C, B>=C, B>=1, A>2, A=A__o, D=D__o} 

evalrealheapsortbb4in -----> {A>2, A>C, B>=1, B>=C, C>0, D=D__o, A=A__o} 

evalrealheapsortbb2in -----> {A>2, A>C, B>=1, B>=C, C>0, D=D__o, A=A__o} 

evalrealheapsortbb18in -----> {B>=0, A>2, A=A__o} 

evalrealheapsortbb8in -----> {A>B+1, B>=0, A>2, A=A__o} 

evalrealheapsortbb16in -----> {B>=0, A>B+1, A>2, 3A>=C+6, C>=0, A=A__o} 

evalrealheapsortbb9in -----> {A>B+2C+2, B>=0, C>=0, A=A__o} 

evalrealheapsortbb17in -----> {B>=0, A<=B+2C+2, C>=0, A>2, 3A>=C+6, A>B+1, A=A__o} 

evalrealheapsortbb11in -----> {B>=0, A>=B+2C+3, C>=0, A=A__o} 

evalrealheapsortbb10in -----> {B>=0, A>B+2C+3, C>=0, A=A__o} 

evalrealheapsortbb12in -----> {B>=0, A>B+2C+3, C>=0, A=A__o} 

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

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

evalrealheapsortstop -----> {A=A__o} 

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

  print result in fast++
 Finished !