*** 
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 
   * 42 variable(s) and 3 locs(s) and 8 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 : 42 vars, 3 locations, 8 transitions 
   * The initial state has label f26 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 84 vars, 9(9==9) transitions and 4 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f26 -----> {P1=P1__o, O1=O1__o, N1=N1__o, M1=M1__o, L1=L1__o, K1=K1__o, J1=J1__o, I1=I1__o, H1=H1__o, G1=G1__o, F1=F1__o, E1=E1__o, D1=D1__o, C1=C1__o, B1=B1__o, 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} 

____f26 -----> {true} 

f11  -----> {G>=1, G<5, A=A__o, B=D, B=C, G+H=5, G+J=5, O=2, P=3, S=4, U=0, C1=P1__o, D1=4, B1=O1__o, A1=N1__o, W=X, W=Y, W=M1__o, V=K1__o, T=J1__o, R=H1__o, Q=G1__o, G=I, E=F, E=E__o} 
 
f6  -----> {G>=1, G<6, G+H=5, G+J=5, O=2, P=3, S=4, U=0, D1=4, E1=E1__o, C1=P1__o, B1=O1__o, A1=N1__o, W=X, W=Y, W=Z, W=M1__o, V=K1__o, T=J1__o, R=H1__o, Q=G1__o, N=F1__o, G=I, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.864000; iterations=6; descendings=0; } 

  print result in fast++
 Finished !