*** 
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 
   * 2 variable(s) and 2 locs(s) and 5 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 : 2 vars, 2 locations, 5 transitions 
   * The initial state has label start and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 4 vars, 6(6==6) transitions and 3 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
mainjust one = 
{B__o=1,B=0,A=A__o,$>=0,A>0,1>0}just one = 
{B=0,A=A__o,$>=0,
                                                             A__o>0,1>0,
                                                             B__o>=1}just one = 
{
B=0,A=A__o,$>=0,A__o>0,1>0,B__o>=1}just one = 
{B=0,A=A__o,$>=0,A__o>0,1>0,
                                                B__o>=1}just one = 
{
B=0,A=A__o,$>=0,A__o>0,1>0,B__o>=1}just one = 
{B=0,A=A__o,$>=0,A__o>0,1>0,
                                                B__o>=1}
*** Results : 
   *  Invariants =  
start -----> {A=A__o, B=B__o} 

____start -----> {true} 

eval  -----> {B<=B__o, A=A__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 1 location(s)
   * Stats =  { time=0.003000; iterations=4; descendings=0; } 

  print result in fast++
 Finished !