*** 
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 
   * 29 variable(s) and 12 locs(s) and 30 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 : 29 vars, 12 locations, 30 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
 58 vars, 31(31==31) transitions and 13 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f75 -----> {A>=C, C>=C__o, D>=D__o, E>=0, U>=U__o, A=A__o} 

f10 -----> {U>=U__o, D>=D__o, C>=C__o, A=A__o} 

f24 -----> {A>=C, C>=C__o, D>=D__o, E>=0, U>=U__o, A=A__o} 

f28 -----> {A>=C, C>=C__o, D>=D__o, J>=0, U>=U__o, A=A__o, E=J+1} 

f32 -----> {A>=C, C>=C__o, D>=D__o, J>=0, U>=U__o, E=J+1, A=A__o} 

f42 -----> {E>=1, D>=D__o, C>=C__o, A>=C, U>=U__o, E=J+1, A=A__o} 

f68 -----> {A>=C, C>=C__o, D>=D__o, E>=1, U>=U__o, E=J+1, A=A__o} 

f1 -----> {A<C, U>=U__o, D>=D__o, C>=C__o, A=A__o} 

start -----> {A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, B1=B1__o, C1=C1__o} 

____start -----> {true} 

f2  -----> {B>=B__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, A=A__o} 
 
f15  -----> {U>=U__o, E>=0, D>=D__o, C>=C__o, A>=C, A=A__o} 
 
f60  -----> {E>=1, D>=D__o, C>=C__o, B>=C, A>=C, U>=U__o, E=J+1, A=A__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 3 location(s)
   * Stats =  { time=1.419000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !