*** 
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 
   * 35 variable(s) and 5 locs(s) and 18 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 : 35 vars, 5 locations, 18 transitions 
   * The initial state has label f6 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 70 vars, 19(19==19) transitions and 6 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*Hum* A problem occured when accelerating the loops, now trying with -noaccel option
   * Name of model = main, Name of file = main.fst 
   * 35 variable(s) and 5 locs(s) and 18 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 : 35 vars, 5 locations, 18 transitions 
   * The initial state has label f6 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 70 vars, 19(19==19) transitions and 6 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f9 -----> {B<18, B>=1, A=17, B=C+1, D=E, D=F, G=G__o, H=H__o, I=I__o, J=J__o, K=K__o, L=L__o, M=M__o, N=N__o, O=O__o, P=P__o, R=R__o, S=S__o, T=T__o, U=U__o, V=V__o, W=W__o, X=X__o, Y=Y__o, Z=Z__o, A1=A1__o, Q=E1__o} 

f5 -----> {B<18, G+1>=0, Z>=A1, B>=G+4, B>=17, A=17, B=C+1, D=E, D=F, B=G+I+3, J=0, H=Q, B=G+T+3, G=U, D=W, D=X, B=Y+3, M=M__o, O=O__o} 

f0 -----> {G>=0, B>=G+4, M<N, B>=17, B<18, Z>=A1, B=G+I+3, D=X, J=Q, D=F, D=E, D=W, B=C+1, B=G+T+3, A=17, B=Y+3, G=U} 

f12 -----> {U>=0, T>=1, Z>=A1, M>=N, T+U>=14, T+U<15, P=0, O=O__o, D=X, J=0, I=T, T=V, G=U, D=F, D=E, T+U=Y, C=T+U+2, B=T+U+3, A=17, Q=R, M=M__o} 

f6 -----> {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, H1=H1__o, I1=I1__o} 

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

  print result in fast++
 Finished !