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

evalrealshellsortentryin -----> {E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 

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

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

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

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

evalrealshellsortbb7in -----> {A+1>C, A+1>=2B, B>0, C>=0, A<=C, A=A__o} 

evalrealshellsortbb3in -----> {B>0, A+1>=2B, A>C, E>=0, C>=E, A=A__o} 

evalrealshellsortbb5in -----> {A+1>=2B, E>=0, B>0, A>C, C>=E, A=A__o} 

evalrealshellsortbb4in -----> {A>C, A+1>=2B, B>0, C>=E, B<=E, A=A__o} 

evalrealshellsortbb2in -----> {A+1>=2B, B<=E, C>=E, A>C, B>0, A=A__o} 

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

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

  print result in fast++
 Finished !