*** 
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 
   * 39 variable(s) and 14 locs(s) and 44 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 : 39 vars, 14 locations, 44 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
 78 vars, 45(45==45) transitions and 15 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 
   * 39 variable(s) and 14 locs(s) and 44 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 : 39 vars, 14 locations, 44 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
 78 vars, 45(45==45) transitions and 15 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * classical LRA (CH79) with delay = 4 
main

*** Results : 
   *  Invariants =  
f81 -----> {C>=0, 4B1+I1__o>20, B1+C1>I1__o, B1>4, C1>0, I1__o>0, B1<=20, C<=1, G=10, H+1=0, K=0, N+1=0, P=0, Q=0, W=0, X=0, C1=D1, A1=H1__o, V=F1, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, T=U, R=S, M=M__o, L=O, I=J, E=F, B=D, B=M1__o, A=A__o} 

f83 -----> {C>=0, K>=0, 4B1+I1__o>20, B1>4, I1__o>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, V+E1+G1<I1__o+J1__o+K1__o+L1__o, K<=1, C<=1, A=A__o, G=10, H+1=0, N+1=0, P=0, Q=0, W=0, X=0, A1=H1__o, V=F1, V+D1+E1+G1=I1__o+J1__o+K1__o+L1__o, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, T=U, R=S, M=M__o, L=O, I=J, E=F, B=D, B=M1__o} 

f34 -----> {4B1+I1__o>20, B1+C1>I1__o, B1>4, C1>0, I1__o>0, B1<=20, C+V+C1+G1=I1__o+J1__o+K1__o+L1__o, C1=D1, A1=H1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=F1, 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=E1, B=M1__o, A=A__o} 

f39 -----> {4B1+I1__o>20, B1>4, I1__o>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, V+E1+G1<I1__o+J1__o+K1__o+L1__o, B=M1__o, B=D, C=1, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, V+D1+E1+G1=I1__o+J1__o+K1__o+L1__o, A1=H1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=F1, 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, A=A__o} 

f44 -----> {C>=0, 4B1+I1__o>20, B1>4, I1__o>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, V+E1+G1<I1__o+J1__o+K1__o+L1__o, C<=1, G=10, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, V+D1+E1+G1=I1__o+J1__o+K1__o+L1__o, A1=H1__o, V=F1, M=M__o, E=F, B=D, B=M1__o, A=A__o} 

f64 -----> {C>=0, V+4B1+C1+E1+G1>J1__o+K1__o+L1__o+20, V+C1+E1+G1>J1__o+K1__o+L1__o, B1>4, C1>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, C<=1, G=10, H+1=0, N+1=0, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, W=0, X=0, C1=D1, A1=H1__o, V=F1, T=U, M=M__o, E=F, B=D, B=M1__o, A=A__o} 

f69 -----> {C>=0, 4B1+I1__o>20, B1>4, I1__o>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, V+E1+G1<I1__o+J1__o+K1__o+L1__o, C<=1, G=10, H+1=0, I=J, K=0, N+1=0, W=0, X=0, A1=H1__o, V=F1, V+D1+E1+G1=I1__o+J1__o+K1__o+L1__o, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, T=U, M=M__o, E=F, B=D, B=M1__o, A=A__o} 

f87 -----> {C>=0, K>=0, V+4B1+C1+E1+G1>J1__o+K1__o+L1__o+20, V+C1+E1+G1>J1__o+K1__o+L1__o, B1>4, C1>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, K<=1, C<=1, G=10, H+1=0, N+1=0, P=Q, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, W=0, X=0, C1=D1, A1=H1__o, V=F1, T=U, M=M__o, L=O, I=J, E=F, B=D, B=M1__o, A=A__o} 

f80 -----> {C>=0, V+4B1+C1+E1+G1>J1__o+K1__o+L1__o+20, V+C1+E1+G1>J1__o+K1__o+L1__o, B1>4, C1>0, B1<=20, V+E1+G1<B1+J1__o+K1__o+L1__o, C<=1, G=10, H+1=0, K=0, N+1=0, P=0, Q=0, R=S, W=0, X=0, C1=D1, A1=H1__o, V=F1, V+C1+E1+G1=I1__o+J1__o+K1__o+L1__o, T=U, M=M__o, L=O, I=J, E=F, B=D, B=M1__o, A=A__o} 

f56 -----> {C>=0, 4B1+I1__o>20, B1>4, B1+J1__o+K1__o+L1__o>E1+F1+G1, I1__o>0, E1+F1+G1<I1__o+J1__o+K1__o+L1__o, B1<=20, C<=1, G=10, W=0, X=0, C1+E1+F1+G1=I1__o+J1__o+K1__o+L1__o, D1+E1+F1+G1=I1__o+J1__o+K1__o+L1__o, A1=H1__o, V=F1, M=M__o, H=N, E=F, B=D, B=M1__o, A=A__o} 

f96 -----> {D1+20>I1__o, M=M__o, C=1, A1=H1__o, V=F1, A=A__o, C1=D1} 

f98 -----> {false} 

f100 -----> {false} 

f0 -----> {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} 

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

  print result in fast++
 Finished !