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

____f999 -----> {true} 

f1  -----> {N>=0, M>=0, J>=0, G>=0, F>=0, A>=1, A+C>0, A+C+E+G+J>0, A+C+E+G+J+K+N>0, E<=F, K<=M, A=B, D=0, H=0, I=0, J=L, O=0, P=0, Q=0, R=0, S=0, T=0, U=0, V=0, W=0, X=0, Y=0, Z=0, A1=0, B1=0, A__o=0, B__o=0, C__o=0, D__o=0, E__o=0, F__o=0, G__o=0, A+C+E+G+J+K+N=H__o, I__o=0, J__o=0, K__o=0, L__o=0, M__o=0, N__o=0, O__o=0, P__o=0, Q__o=0, R__o=0, S__o=0, T__o=0, U__o=0, V__o=0, W__o=0, X__o=0, Y__o=0, Z__o=0, A1__o=0, B1__o=0} 
 
f2  -----> {F>=0, D+E+G+J>0, D+E+G+J+K+N>0, E<=F, K<=M, N>=0, M>=0, J>=0, G>=1, A=0, B=0, C=0, H=0, I=0, J=L, O=0, P=0, Q=0, R=0, S=0, T=0, U=0, V=0, W=0, X=0, Y=0, Z=0, A1=0, B1=0, A__o=0, B__o=0, C__o=0, D__o=0, E__o=0, F__o=0, G__o=0, D+E+G+J+K+N=H__o, I__o=0, J__o=0, K__o=0, L__o=0, M__o=0, N__o=0, O__o=0, P__o=0, Q__o=0, R__o=0, S__o=0, T__o=0, U__o=0, V__o=0, W__o=0, X__o=0, Y__o=0, Z__o=0, A1__o=0, B1__o=0} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 2 location(s)
   * Stats =  { time=0.297000; iterations=5; descendings=0; } 

  print result in fast++
 Finished !