Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_Raft-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110500166
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Raft-PT-05-CTLFireability-0
FORMULA_NAME Raft-PT-05-CTLFireability-1
FORMULA_NAME Raft-PT-05-CTLFireability-10
FORMULA_NAME Raft-PT-05-CTLFireability-11
FORMULA_NAME Raft-PT-05-CTLFireability-12
FORMULA_NAME Raft-PT-05-CTLFireability-13
FORMULA_NAME Raft-PT-05-CTLFireability-14
FORMULA_NAME Raft-PT-05-CTLFireability-15
FORMULA_NAME Raft-PT-05-CTLFireability-2
FORMULA_NAME Raft-PT-05-CTLFireability-3
FORMULA_NAME Raft-PT-05-CTLFireability-4
FORMULA_NAME Raft-PT-05-CTLFireability-5
FORMULA_NAME Raft-PT-05-CTLFireability-6
FORMULA_NAME Raft-PT-05-CTLFireability-7
FORMULA_NAME Raft-PT-05-CTLFireability-8
FORMULA_NAME Raft-PT-05-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464474505795


its-ctl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.93795e+18,4.03523,97772,2,4870,5,354644,6,0,744,415730,0


Converting to forward existential form...Done !
original formula: ((EF(AF((p111>=1 * p132>=1))) + (!(AX((p130>=1 * p129>=1))) * p112>=1)) + (p115>=1 * p45>=1))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG(!((p111>=1 * p132>=1)))))] != FALSE + [(EY((Init * p112>=1)) * !((p130>=1 * p129>=1)))] != FALSE) + [(Init * (p115>=1 * p45>=1))] != FALSE)
Checking (exact) 0 :(([(FwdU(Init,TRUE) * !(EG(!((p111>=1 * p132>=1)))))] != FALSE + [(EY((Init * p112>=1)) * !((p130>=1 * p129>=1)))] != FALSE) + [(Init * (p115>=1 * p45>=1))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(EG(!((p111>=1 * p132>=1)))))] != FALSE + [(EY((Init * p112>=1)) * !((p130>=1 * p129>=1)))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EG(!((p111>=1 * p132>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EG(!((p111>=1 * p132>=1)))))
Checking (exact) 1 :!(EG(!((p111>=1 * p132>=1))))
Checking (exact) 1 :EG(!((p111>=1 * p132>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,1,7.93595,119476,1,0,386,625459,453,163,5085,415730,443
FORMULA Raft-PT-05-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: !(EF(EF(p114>=1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * p114>=1)] = FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),TRUE) * p114>=1)] = FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),TRUE) * p114>=1)
Checking (exact) 1 :p114>=1
Checking (exact) 1 :FwdU(FwdU(Init,TRUE),TRUE)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 1,0,8.12605,121276,1,0,388,625535,455,164,5232,422355,446
FORMULA Raft-PT-05-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AG(EF((p120>=1 * p11>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p120>=1 * p11>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (p120>=1 * p11>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (p120>=1 * p11>=1))))
Checking (exact) 1 :!(E(TRUE U (p120>=1 * p11>=1)))
Checking (exact) 1 :E(TRUE U (p120>=1 * p11>=1))
(forward)formula 2,1,10.122,171284,1,0,396,902303,463,170,5382,603214,465
FORMULA Raft-PT-05-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AG(EF((p110>=1 * p40>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p110>=1 * p40>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (p110>=1 * p40>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (p110>=1 * p40>=1))))
Checking (exact) 1 :!(E(TRUE U (p110>=1 * p40>=1)))
Checking (exact) 1 :E(TRUE U (p110>=1 * p40>=1))
(forward)formula 3,1,10.784,190324,1,0,401,1.01048e+06,466,174,5384,673050,476
FORMULA Raft-PT-05-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: EF(EX(AX((p125>=1 * p79>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!((p125>=1 * p79>=1)))))] != FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * !(EX(!((p125>=1 * p79>=1)))))] != FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * !(EX(!((p125>=1 * p79>=1)))))
Checking (exact) 1 :!(EX(!((p125>=1 * p79>=1))))
Checking (exact) 1 :EX(!((p125>=1 * p79>=1)))
(forward)formula 4,0,10.8479,191112,1,0,404,1.01933e+06,470,176,5389,686912,481
FORMULA Raft-PT-05-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: ((!((p115>=1 * p73>=1)) * (!(EF((p110>=1 * p30>=1))) * !(((p120>=1 * p32>=1) + (p104>=1 + p103>=1))))) + EF(!(EF((p120>=1 * p80>=1)))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * (p115>=1 * p73>=1))] = FALSE * ([(FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE) * (p110>=1 * p30>=1))] = FALSE * [((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * ((p120>=1 * p32>=1) + (p104>=1 + p103>=1)))] = FALSE))
Checking (exact) 0 :([((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * (p115>=1 * p73>=1))] = FALSE * ([(FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE) * (p110>=1 * p30>=1))] = FALSE * [((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * ((p120>=1 * p32>=1) + (p104>=1 + p103>=1)))] = FALSE))
Checking (exact) 1 :([(FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE) * (p110>=1 * p30>=1))] = FALSE * [((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * ((p120>=1 * p32>=1) + (p104>=1 + p103>=1)))] = FALSE)
Checking (exact) 1 :[((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * ((p120>=1 * p32>=1) + (p104>=1 + p103>=1)))] = FALSE
Checking (exact) 0 :((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))) * ((p120>=1 * p32>=1) + (p104>=1 + p103>=1)))
Checking (exact) 1 :((p120>=1 * p32>=1) + (p104>=1 + p103>=1))
Checking (exact) 1 :(Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1))))))
Checking (exact) 1 :!(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))
Checking (exact) 1 :E(TRUE U !(E(TRUE U (p120>=1 * p80>=1))))
Checking (exact) 1 :!(E(TRUE U (p120>=1 * p80>=1)))
Checking (exact) 1 :E(TRUE U (p120>=1 * p80>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE) * (p110>=1 * p30>=1))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE) * (p110>=1 * p30>=1))
Checking (exact) 1 :(p110>=1 * p30>=1)
Checking (exact) 1 :p30>=1
Checking (exact) 1 :FwdU((Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))),TRUE)
Checking (exact) 1 :(Init * !(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1))))))
Checking (exact) 1 :!(E(TRUE U !(E(TRUE U (p120>=1 * p80>=1)))))
Checking (exact) 1 :E(TRUE U !(E(TRUE U (p120>=1 * p80>=1))))
Checking (exact) 1 :!(E(TRUE U (p120>=1 * p80>=1)))
Checking (exact) 1 :E(TRUE U (p120>=1 * p80>=1))
Checking (exact) 1 :Init
(forward)formula 5,0,14.7308,265944,1,0,414,1.31667e+06,483,185,5397,1.05286e+06,497
FORMULA Raft-PT-05-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: (EF(p101>=1) + (p120>=1 * p80>=1))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * p101>=1)] != FALSE + [(Init * (p120>=1 * p80>=1))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * p101>=1)] != FALSE + [(Init * (p120>=1 * p80>=1))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * p101>=1)] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * p101>=1)
Checking (exact) 1 :p101>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 6,1,14.7318,266468,1,0,415,1.31672e+06,484,186,5397,1.05287e+06,498
FORMULA Raft-PT-05-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: EG(!((EF((p125>=1 * p128>=1)) * p110>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p125>=1 * p128>=1)) * p110>=1)))] != FALSE
Checking (exact) 0 :[FwdG(Init,!((E(TRUE U (p125>=1 * p128>=1)) * p110>=1)))] != FALSE
Checking (exact) 0 :FwdG(Init,!((E(TRUE U (p125>=1 * p128>=1)) * p110>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :!((E(TRUE U (p125>=1 * p128>=1)) * p110>=1))
Checking (exact) 1 :(E(TRUE U (p125>=1 * p128>=1)) * p110>=1)
Checking (exact) 1 :p110>=1
Checking (exact) 1 :E(TRUE U (p125>=1 * p128>=1))
(forward)formula 7,0,18.7984,349744,1,0,428,1.79996e+06,491,197,5400,1.45507e+06,523
FORMULA Raft-PT-05-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: ((!(EF(((p125>=1 * p95>=1) * p108>=1))) * (((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))) + AF(!((p125>=1 * p85>=1))))) + (EF((p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))
=> equivalent forward existential formula: ([(FwdU((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))),TRUE) * ((p125>=1 * p95>=1) * p108>=1))] = FALSE * [FwdG(((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))) * !(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))))),!(!((p125>=1 * p85>=1))))] = FALSE)
Checking (exact) 0 :([(FwdU((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))),TRUE) * ((p125>=1 * p95>=1) * p108>=1))] = FALSE * [FwdG(((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))) * !(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))))),!(!((p125>=1 * p85>=1))))] = FALSE)
Checking (exact) 1 :[FwdG(((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))) * !(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))))),!(!((p125>=1 * p85>=1))))] = FALSE
Checking (exact) 0 :FwdG(((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))) * !(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))))),!(!((p125>=1 * p85>=1))))
Checking (exact) 1 :((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))) * !(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1)))))
Checking (exact) 1 :!(((p110>=1 * p40>=1) * (!((p103>=1 * p132>=1)) + ((p120>=1 * p98>=1) + p122>=1))))
Checking (exact) 1 :(Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1))))
Checking (exact) 1 :!((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))
Checking (exact) 1 :(E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1))
Checking (exact) 1 :(p110>=1 * p40>=1)
Checking (exact) 1 :p40>=1
Checking (exact) 1 :E(TRUE U (p115>=1 * p71>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))),TRUE) * ((p125>=1 * p95>=1) * p108>=1))] = FALSE
Checking (exact) 0 :(FwdU((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))),TRUE) * ((p125>=1 * p95>=1) * p108>=1))
Checking (exact) 1 :((p125>=1 * p95>=1) * p108>=1)
Checking (exact) 1 :p108>=1
Checking (exact) 1 :FwdU((Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))),TRUE)
Checking (exact) 1 :(Init * !((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1))))
Checking (exact) 1 :!((E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1)))
Checking (exact) 1 :(E(TRUE U (p115>=1 * p71>=1)) * (p110>=1 * p40>=1))
Checking (exact) 1 :(p110>=1 * p40>=1)
Checking (exact) 1 :p40>=1
Checking (exact) 1 :E(TRUE U (p115>=1 * p71>=1))
Checking (exact) 1 :Init
(forward)formula 8,0,19.5972,370256,1,0,443,1.92428e+06,520,212,5430,1.5387e+06,544
FORMULA Raft-PT-05-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: (AG(AX(((p120>=1 * p70>=1) + p125>=1))) + (p125>=1 * p95>=1))
=> equivalent forward existential formula: [(EY(FwdU((Init * !((p125>=1 * p95>=1))),TRUE)) * !(((p120>=1 * p70>=1) + p125>=1)))] = FALSE
Checking (exact) 0 :[(EY(FwdU((Init * !((p125>=1 * p95>=1))),TRUE)) * !(((p120>=1 * p70>=1) + p125>=1)))] = FALSE
Checking (exact) 0 :(EY(FwdU((Init * !((p125>=1 * p95>=1))),TRUE)) * !(((p120>=1 * p70>=1) + p125>=1)))
Checking (exact) 1 :!(((p120>=1 * p70>=1) + p125>=1))
Checking (exact) 1 :EY(FwdU((Init * !((p125>=1 * p95>=1))),TRUE))
Checking (exact) 1 :FwdU((Init * !((p125>=1 * p95>=1))),TRUE)
Checking (exact) 1 :(Init * !((p125>=1 * p95>=1)))
(forward)formula 9,0,19.6159,370316,1,0,446,1.92599e+06,526,214,5438,1.54315e+06,547
FORMULA Raft-PT-05-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: (EX((p110>=1 * p86>=1)) + EF(((p115>=1 * p9>=1) * AX(p110>=1))))
=> equivalent forward existential formula: ([(EY(Init) * (p110>=1 * p86>=1))] != FALSE + [((FwdU(Init,TRUE) * (p115>=1 * p9>=1)) * !(EX(!(p110>=1))))] != FALSE)
Checking (exact) 0 :([(EY(Init) * (p110>=1 * p86>=1))] != FALSE + [((FwdU(Init,TRUE) * (p115>=1 * p9>=1)) * !(EX(!(p110>=1))))] != FALSE)
Checking (exact) 0 :[(EY(Init) * (p110>=1 * p86>=1))] != FALSE
Checking (exact) 0 :(EY(Init) * (p110>=1 * p86>=1))
Checking (exact) 1 :(p110>=1 * p86>=1)
Checking (exact) 1 :p86>=1
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 0 :[((FwdU(Init,TRUE) * (p115>=1 * p9>=1)) * !(EX(!(p110>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * (p115>=1 * p9>=1)) * !(EX(!(p110>=1))))
Checking (exact) 1 :!(EX(!(p110>=1)))
Checking (exact) 1 :EX(!(p110>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * (p115>=1 * p9>=1))
Checking (exact) 1 :(p115>=1 * p9>=1)
Checking (exact) 1 :p9>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 10,1,20.2674,382852,1,0,456,2.00182e+06,533,222,5442,1.63915e+06,554
FORMULA Raft-PT-05-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: (A(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1))) U !(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))) * AG((EF((p125>=1 * p37>=1)) + AG(p120>=1))))
=> equivalent forward existential formula: (([(FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))) * (!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))))] = FALSE * [FwdG(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))] = FALSE) * [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1)))),TRUE) * !(p120>=1))] = FALSE)
Checking (exact) 0 :(([(FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))) * (!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))))] = FALSE * [FwdG(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))] = FALSE) * [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1)))),TRUE) * !(p120>=1))] = FALSE)
Checking (exact) 1 :[(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1)))),TRUE) * !(p120>=1))] = FALSE
Checking (exact) 0 :(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1)))),TRUE) * !(p120>=1))
Checking (exact) 1 :!(p120>=1)
Checking (exact) 1 :FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1)))),TRUE)
Checking (exact) 1 :(FwdU(Init,TRUE) * !(E(TRUE U (p125>=1 * p37>=1))))
Checking (exact) 1 :!(E(TRUE U (p125>=1 * p37>=1)))
Checking (exact) 1 :E(TRUE U (p125>=1 * p37>=1))
Checking (exact) 1 :([(FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))) * (!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))))] = FALSE * [FwdG(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))] = FALSE)
Checking (exact) 1 :[FwdG(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))) * (!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))) * (!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))))
Checking (exact) 1 :(!(((p115>=1 * p55>=1) + ((p115>=1 * p93>=1) * (p105>=1 * p20>=1)))) * !(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))
Checking (exact) 1 :!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1))))
Checking (exact) 1 :((p105>=1 * p20>=1) + (p115>=1 * p50>=1))
Checking (exact) 1 :FwdU(Init,!(!(((p105>=1 * p20>=1) + (p115>=1 * p50>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 129/0/87
(forward)formula 11,1,22.1762,415336,1,0,469,2.16533e+06,567,233,5481,1.74528e+06,576
FORMULA Raft-PT-05-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: E(!((p115>=1 * p6>=1)) U AX(((p125>=1 * p128>=1) + (p105>=1 * p61>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!((p115>=1 * p6>=1))) * !(EX(!(((p125>=1 * p128>=1) + (p105>=1 * p61>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!((p115>=1 * p6>=1))) * !(EX(!(((p125>=1 * p128>=1) + (p105>=1 * p61>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((p115>=1 * p6>=1))) * !(EX(!(((p125>=1 * p128>=1) + (p105>=1 * p61>=1))))))
Checking (exact) 1 :!(EX(!(((p125>=1 * p128>=1) + (p105>=1 * p61>=1)))))
Checking (exact) 1 :EX(!(((p125>=1 * p128>=1) + (p105>=1 * p61>=1))))
Checking (exact) 1 :FwdU(Init,!((p115>=1 * p6>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 175/0/41
(forward)formula 12,1,47.4165,872404,1,0,477,3.73727e+06,582,237,5662,4.1523e+06,584
FORMULA Raft-PT-05-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: (AG(!((p118>=1 * (p105>=1 * p15>=1)))) + (p120>=1 * p70>=1))
=> equivalent forward existential formula: [(FwdU((Init * !((p120>=1 * p70>=1))),TRUE) * (p118>=1 * (p105>=1 * p15>=1)))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !((p120>=1 * p70>=1))),TRUE) * (p118>=1 * (p105>=1 * p15>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !((p120>=1 * p70>=1))),TRUE) * (p118>=1 * (p105>=1 * p15>=1)))
Checking (exact) 1 :(p118>=1 * (p105>=1 * p15>=1))
Checking (exact) 1 :(p105>=1 * p15>=1)
Checking (exact) 1 :p15>=1
Checking (exact) 1 :FwdU((Init * !((p120>=1 * p70>=1))),TRUE)
Checking (exact) 1 :(Init * !((p120>=1 * p70>=1)))
(forward)formula 13,0,47.426,872520,1,0,481,3.73787e+06,589,240,5666,4.15542e+06,587
FORMULA Raft-PT-05-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: EG(EF(EG((p120>=1 * p97>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EG((p120>=1 * p97>=1))))] != FALSE
Checking (exact) 0 :[FwdG(Init,E(TRUE U EG((p120>=1 * p97>=1))))] != FALSE
Checking (exact) 0 :FwdG(Init,E(TRUE U EG((p120>=1 * p97>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U EG((p120>=1 * p97>=1)))
Checking (exact) 1 :EG((p120>=1 * p97>=1))
(forward)formula 14,1,47.4641,872560,1,0,493,3.74244e+06,596,248,5668,4.16026e+06,611
FORMULA Raft-PT-05-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: (E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U AF((p115>=1 * p55>=1))) * E(AF((p105>=1 * p5>=1)) U AF(p121>=1)))
=> equivalent forward existential formula: [(FwdU((Init * E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1)))))),!(EG(!((p105>=1 * p5>=1))))) * !(EG(!(p121>=1))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1)))))),!(EG(!((p105>=1 * p5>=1))))) * !(EG(!(p121>=1))))] != FALSE
Checking (exact) 0 :(FwdU((Init * E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1)))))),!(EG(!((p105>=1 * p5>=1))))) * !(EG(!(p121>=1))))
Checking (exact) 1 :!(EG(!(p121>=1)))
Checking (exact) 1 :EG(!(p121>=1))
Checking (exact) 1 :FwdU((Init * E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1)))))),!(EG(!((p105>=1 * p5>=1)))))
Checking (exact) 1 :(Init * E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1))))))
Checking (exact) 1 :E(!(((p125>=1 * p59>=1) + (p110>=1 * p68>=1))) U !(EG(!((p115>=1 * p55>=1)))))
Checking (exact) 1 :!(EG(!((p115>=1 * p55>=1))))
Checking (exact) 1 :EG(!((p115>=1 * p55>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!((p105>=1 * p5>=1))))
Checking (exact) 1 :EG(!((p105>=1 * p5>=1)))
(forward)formula 15,1,60.2775,1115856,1,0,656,4.88318e+06,630,361,5683,5.61536e+06,801
FORMULA Raft-PT-05-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************


BK_STOP 1464474570926

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 28, 2016 10:28:29 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 10:28:29 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 69 ms
May 28, 2016 10:28:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 133 places.
May 28, 2016 10:28:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 238 transitions.
May 28, 2016 10:28:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 110 ms
May 28, 2016 10:28:30 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 254 ms
May 28, 2016 10:28:30 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Raft-PT-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_Raft-PT-05.tgz
mv S_Raft-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_Raft-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444110500166"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;