*** 
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 
   * 34 variable(s) and 11 locs(s) and 28 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 : 34 vars, 11 locations, 28 transitions 
   * The initial state has label f0 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 68 vars, 29(29==29) transitions and 12 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f0 -----> {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} 

f36 -----> {A>=A__o, A<=A__o+1, B=40, C=0, D=40, E=0, F=1, G=0, 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} 

f17 -----> {H>=0, A=1, B=40, C=0, D=40, E=0, F=1, G=0, A__o=0, M=M__o, N=N__o, O=O__o, P=P__o, Q=Q__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, B1=B1__o, C1=C1__o, D1=D1__o, E1=E1__o} 

f56 -----> {A>=A__o, H>40, H<=41, A<=A__o+1, B=40, C=0, D=40, E=0, F=1, 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, N=N__o, G=O, G=E1} 

f85 -----> {A>=A__o, H>40, H<=41, A<=A__o+2, B=40, C=0, D=40, E=0, F=1, Q=42, R=0, S=1, C1=C1__o, B1=B1__o, A1=A1__o, Z=Z__o, G=N, G=O, G=P, G=T, G=E1} 

f66 -----> {U>=0, A__o<=0, H>40, H<=41, A__o+1>=0, A=1, B=40, C=0, D=40, E=0, F=1, G=N, G=O, G=P, Q=42, R=0, S=1, G=T, G=E1, Z=Z__o, A1=A1__o, B1=B1__o, C1=C1__o} 

f106 -----> {A<=A__o+2, A>=A__o, U>42, H>40, H<=41, U<=43, G=N, T=C1, T=B1, T=A1, Q=42, G=P, G=E1, F=1, E=0, D=40, C=0, B=40, S=1, G=O, R=0} 

____f0 -----> {true} 

f23  -----> {L>=0, H>=0, H<=255, L<=8, A=1, B=40, C=0, D=40, E=0, F=1, G=0, J=0, A__o=0, M=M__o, N=N__o, O=O__o, P=P__o, Q=Q__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, B1=B1__o, C1=C1__o, D1=D1__o, E1=E1__o} 
 
f42  -----> {A>=A__o, H>=1, H<=41, A<=A__o+1, B=40, C=0, D=40, E=0, F=1, 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} 
 
f72  -----> {H<=41, H>40, A__o+1>=0, Y>=0, U>=0, U<=255, Y<=8, A__o<=0, A=1, B=40, C=0, D=40, E=0, F=1, G=N, G=O, G=P, Q=42, R=0, S=1, G=T, W=0, G=E1, Z=Z__o, A1=A1__o, B1=B1__o, C1=C1__o} 
 
f91  -----> {A>=A__o, H>40, U>=1, U<=43, H<=41, A<=A__o+2, B=40, C=0, D=40, E=0, F=1, Q=42, R=0, S=1, C1=C1__o, B1=B1__o, A1=A1__o, G=N, G=O, G=P, G=E1} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 4 location(s)
   * Stats =  { time=0.654000; iterations=17; descendings=0; } 

  print result in fast++
 Finished !