*** 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 * 10 variable(s) and 5 locs(s) and 11 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 : 10 vars, 5 locations, 11 transitions * The initial state has label start0 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 20 vars, 12(12==12) 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 * 10 variable(s) and 5 locs(s) and 11 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 : 10 vars, 5 locations, 11 transitions * The initial state has label start0 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 20 vars, 12(12==12) transitions and 6 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * classical LRA (CH79) with delay = 4 main *** Results : * Invariants = start -----> {H=I, H=I__o, E=F, E=F__o, C=G, C=C__o, B=D, B=B__o, A=J, A=A__o} stop -----> {E<=1, B<=D, E+1>=0, D>C__o, F=F__o, G=C__o, H=I__o, C=C__o, B=B__o, A=A__o, I=I__o, J=A__o} lbl71 -----> {A>0, B+1<=D, C+1>=D, E=1, C=G, H=I, A=J, A=A__o, B=B__o, C=C__o, F=F__o, H=I__o} lbl81 -----> {A<=0, C+1>=D, B+1<=D, E+1=0, C=G, H=I, A=J, A=A__o, B=B__o, C=C__o, F=F__o, H=I__o} start0 -----> {H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o, I=I__o, J=J__o} ____start0 -----> {true} * Remember that we have no bad region * No accel has been applied * Stats = { time=0.010000; iterations=6; descendings=0; } print result in fast++ Finished !