*** 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 * 5 variable(s) and 9 locs(s) and 12 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 : 5 vars, 9 locations, 12 transitions * The initial state has label evalSimpleSingle2start and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 10 vars, 13(13==13) transitions and 10 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * LRA with acceleration with delay = 1 main *** Results : * Invariants = evalSimpleSingle2start -----> {C=C__o, B=B__o, A=A__o, D=D__o, E=E__o} evalSimpleSingle2entryin -----> {B=B__o, A=A__o, D=D__o, C=C__o} evalSimpleSingle2bb4in -----> {A>=0, A=B, C=C__o, D=D__o} evalSimpleSingle2bbin -----> {A>=0, D=D__o, C=C__o, A=B} evalSimpleSingle2returnin -----> {A>=0, A=B, C=C__o, D=D__o} evalSimpleSingle2bb1in -----> {A>=0, A {A>=0, A>=C, D=D__o, C=C__o, A=B} evalSimpleSingle2bb3in -----> {A>=0, A>=C, A {A>=0, A=B, C=C__o, D=D__o} ____evalSimpleSingle2start -----> {true} * Remember that we have no bad region * No accel has been applied * Stats = { time=0.007000; iterations=5; descendings=0; } print result in fast++ Finished !