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

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

evalSimpleMultiplebb3in -----> {B>=0, A>=0, C=C__o, D=D__o} 

evalSimpleMultiplebbin -----> {A>=0, B>=0, B<C, D=D__o, C=C__o} 

evalSimpleMultiplereturnin -----> {B>=C, B>=0, A>=0, C=C__o, D=D__o} 

evalSimpleMultiplebb1in -----> {A>=0, B>=0, B<C, A<D, C=C__o, D=D__o} 

evalSimpleMultiplebb2in -----> {A>=0, B>=0, B<C, A>=D, C=C__o, D=D__o} 

evalSimpleMultiplestop -----> {B>=C, B>=0, A>=0, C=C__o, D=D__o} 

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

  print result in fast++
 Finished !