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_Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444112701174
=====================================================================

--------------------
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 Parking-PT-208-CTLFireability-0
FORMULA_NAME Parking-PT-208-CTLFireability-1
FORMULA_NAME Parking-PT-208-CTLFireability-10
FORMULA_NAME Parking-PT-208-CTLFireability-11
FORMULA_NAME Parking-PT-208-CTLFireability-12
FORMULA_NAME Parking-PT-208-CTLFireability-13
FORMULA_NAME Parking-PT-208-CTLFireability-14
FORMULA_NAME Parking-PT-208-CTLFireability-15
FORMULA_NAME Parking-PT-208-CTLFireability-2
FORMULA_NAME Parking-PT-208-CTLFireability-3
FORMULA_NAME Parking-PT-208-CTLFireability-4
FORMULA_NAME Parking-PT-208-CTLFireability-5
FORMULA_NAME Parking-PT-208-CTLFireability-6
FORMULA_NAME Parking-PT-208-CTLFireability-7
FORMULA_NAME Parking-PT-208-CTLFireability-8
FORMULA_NAME Parking-PT-208-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464744574842


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,4.5676e+09,0.092068,5676,2,655,5,4701,6,0,667,4156,0


Converting to forward existential form...Done !
original formula: !(EF(AG(((p20>=1 * p58>=1) + (p76>=1 * p96>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p20>=1 * p58>=1) + (p76>=1 * p96>=1))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(((p20>=1 * p58>=1) + (p76>=1 * p96>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(((p20>=1 * p58>=1) + (p76>=1 * p96>=1))))))
Checking (exact) 1 :!(E(TRUE U !(((p20>=1 * p58>=1) + (p76>=1 * p96>=1)))))
Checking (exact) 1 :E(TRUE U !(((p20>=1 * p58>=1) + (p76>=1 * p96>=1))))
(forward)formula 0,1,0.698963,20864,1,0,226,97739,264,108,4088,56385,244
FORMULA Parking-PT-208-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((p39>=1 * p70>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (p39>=1 * p70>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (p39>=1 * p70>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (p39>=1 * p70>=1))
Checking (exact) 1 :(p39>=1 * p70>=1)
Checking (exact) 1 :p70>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 1,1,0.7002,21124,1,0,227,97805,268,110,4089,56643,246
FORMULA Parking-PT-208-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(EG(p74>=1))
=> equivalent forward existential formula: [(EY(Init) * !(EG(p74>=1)))] = FALSE
Checking (exact) 0 :[(EY(Init) * !(EG(p74>=1)))] = FALSE
Checking (exact) 0 :(EY(Init) * !(EG(p74>=1)))
Checking (exact) 1 :!(EG(p74>=1))
Checking (exact) 1 :EG(p74>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 2,1,8.81956,259068,1,0,487,1.47232e+06,275,217,4199,1.4952e+06,566
FORMULA Parking-PT-208-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((A(p86>=1 U p114>=1) * p48>=1))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * p48>=1) * !(EG(!(p114>=1)))) * !(E(!(p114>=1) U (!(p86>=1) * !(p114>=1)))))] != FALSE
Checking (exact) 0 :[(((FwdU(Init,TRUE) * p48>=1) * !(EG(!(p114>=1)))) * !(E(!(p114>=1) U (!(p86>=1) * !(p114>=1)))))] != FALSE
Checking (exact) 0 :(((FwdU(Init,TRUE) * p48>=1) * !(EG(!(p114>=1)))) * !(E(!(p114>=1) U (!(p86>=1) * !(p114>=1)))))
Checking (exact) 1 :!(E(!(p114>=1) U (!(p86>=1) * !(p114>=1))))
Checking (exact) 1 :E(!(p114>=1) U (!(p86>=1) * !(p114>=1)))
Checking (exact) 1 :((FwdU(Init,TRUE) * p48>=1) * !(EG(!(p114>=1))))
Checking (exact) 1 :!(EG(!(p114>=1)))
Checking (exact) 1 :EG(!(p114>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * p48>=1)
Checking (exact) 1 :p48>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 3,1,15.9052,432408,1,0,988,2.6265e+06,286,450,4203,2.48644e+06,1129
FORMULA Parking-PT-208-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E((!((p10>=1 * p30>=1)) + AF(p68>=1)) U ((p103>=1 * p132>=1) * !(((p99>=1 * p136>=1) + p114>=1))))
=> equivalent forward existential formula: [(FwdU(Init,(!((p10>=1 * p30>=1)) + !(EG(!(p68>=1))))) * ((p103>=1 * p132>=1) * !(((p99>=1 * p136>=1) + p114>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,(!((p10>=1 * p30>=1)) + !(EG(!(p68>=1))))) * ((p103>=1 * p132>=1) * !(((p99>=1 * p136>=1) + p114>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,(!((p10>=1 * p30>=1)) + !(EG(!(p68>=1))))) * ((p103>=1 * p132>=1) * !(((p99>=1 * p136>=1) + p114>=1))))
Checking (exact) 1 :((p103>=1 * p132>=1) * !(((p99>=1 * p136>=1) + p114>=1)))
Checking (exact) 1 :!(((p99>=1 * p136>=1) + p114>=1))
Checking (exact) 1 :FwdU(Init,(!((p10>=1 * p30>=1)) + !(EG(!(p68>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :(!((p10>=1 * p30>=1)) + !(EG(!(p68>=1))))
Checking (exact) 1 :!(EG(!(p68>=1)))
Checking (exact) 1 :EG(!(p68>=1))
(forward)formula 4,1,26.1722,637908,1,0,1670,4.01225e+06,313,814,4218,3.67934e+06,1885
FORMULA Parking-PT-208-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG((((((p37>=1 * p66>=1) + (p92>=1 * p135>=1)) * ((p72>=1 * p88>=1) + p98>=1)) + (!((p37>=1 * p66>=1)) + !((p95>=1 * p132>=1)))) * !((p73>=1 * p93>=1))))
=> equivalent forward existential formula: [FwdG(Init,(((((p37>=1 * p66>=1) + (p92>=1 * p135>=1)) * ((p72>=1 * p88>=1) + p98>=1)) + (!((p37>=1 * p66>=1)) + !((p95>=1 * p132>=1)))) * !((p73>=1 * p93>=1))))] != FALSE
Checking (exact) 0 :[FwdG(Init,(((((p37>=1 * p66>=1) + (p92>=1 * p135>=1)) * ((p72>=1 * p88>=1) + p98>=1)) + (!((p37>=1 * p66>=1)) + !((p95>=1 * p132>=1)))) * !((p73>=1 * p93>=1))))] != FALSE
Checking (exact) 0 :FwdG(Init,(((((p37>=1 * p66>=1) + (p92>=1 * p135>=1)) * ((p72>=1 * p88>=1) + p98>=1)) + (!((p37>=1 * p66>=1)) + !((p95>=1 * p132>=1)))) * !((p73>=1 * p93>=1))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 81/1/36
(forward)formula 5,1,26.3456,642488,1,0,1674,4.03285e+06,351,817,4403,3.70337e+06,1889
FORMULA Parking-PT-208-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(EF(p115>=1))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U p115>=1))] != FALSE
Checking (exact) 0 :[FwdG(Init,E(TRUE U p115>=1))] != FALSE
Checking (exact) 0 :FwdG(Init,E(TRUE U p115>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U p115>=1)
(forward)formula 6,1,30.3394,723696,1,0,1892,4.37904e+06,355,967,4403,4.21108e+06,2059
FORMULA Parking-PT-208-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(AF((p33>=1 * p70>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!((p33>=1 * p70>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EG(!((p33>=1 * p70>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EG(!((p33>=1 * p70>=1)))))
Checking (exact) 1 :!(EG(!((p33>=1 * p70>=1))))
Checking (exact) 1 :EG(!((p33>=1 * p70>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 7,1,39.8304,981432,1,0,2387,5.9837e+06,363,1194,4407,5.85584e+06,2615
FORMULA Parking-PT-208-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((p105>=1 * p136>=1))
=> equivalent forward existential formula: [FwdG(Init,!((p105>=1 * p136>=1)))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((p105>=1 * p136>=1)))] = FALSE
Checking (exact) 0 :FwdG(Init,!((p105>=1 * p136>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 104/0/13
(forward)formula 8,0,39.8581,982368,1,0,2391,5.98465e+06,373,1197,4529,5.85773e+06,2619
FORMULA Parking-PT-208-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(AG(p114>=1))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(p114>=1)))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!(E(TRUE U !(p114>=1)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(E(TRUE U !(p114>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(E(TRUE U !(p114>=1))))
Checking (exact) 1 :E(TRUE U !(p114>=1))
(forward)formula 9,0,39.866,982636,1,0,2391,5.9848e+06,374,1200,4566,5.85817e+06,2624
FORMULA Parking-PT-208-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((p68>=1 + ((AF((p71>=1 * p126>=1)) + (!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1)))) * !(AF((p17>=1 * p63>=1))))) + !((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))
=> equivalent forward existential formula: ([FwdG((((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1))))),!((p71>=1 * p126>=1)))] = FALSE * [(((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !(EG(!((p17>=1 * p63>=1)))))] = FALSE)
Checking (exact) 0 :([FwdG((((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1))))),!((p71>=1 * p126>=1)))] = FALSE * [(((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !(EG(!((p17>=1 * p63>=1)))))] = FALSE)
Checking (exact) 1 :[(((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !(EG(!((p17>=1 * p63>=1)))))] = FALSE
Checking (exact) 0 :(((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !(EG(!((p17>=1 * p63>=1)))))
Checking (exact) 1 :!(EG(!((p17>=1 * p63>=1))))
Checking (exact) 1 :EG(!((p17>=1 * p63>=1)))
Checking (exact) 1 :((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1))
Checking (exact) 1 :!(p68>=1)
Checking (exact) 1 :(Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1))))))
Checking (exact) 1 :!(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))
Checking (exact) 1 :(!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))
Checking (exact) 1 :EX((p53>=1 * p66>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG((((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1))))),!((p71>=1 * p126>=1)))] = FALSE
Checking (exact) 0 :FwdG((((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1))))),!((p71>=1 * p126>=1)))
Checking (exact) 1 :(((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1)) * !((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1)))))
Checking (exact) 1 :!((!(p48>=1) * (p115>=1 * (p1>=1 * p125>=1))))
Checking (exact) 1 :((Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))) * !(p68>=1))
Checking (exact) 1 :!(p68>=1)
Checking (exact) 1 :(Init * !(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1))))))
Checking (exact) 1 :!(!((!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))))
Checking (exact) 1 :(!((((p28>=1 * p65>=1) * p106>=1) + p24>=1)) + EX((p53>=1 * p66>=1)))
Checking (exact) 1 :EX((p53>=1 * p66>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 114/0/3
(forward)formula 10,0,55.8838,1239140,1,0,2842,7.48694e+06,417,1422,4680,7.3642e+06,3164
FORMULA Parking-PT-208-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!((AX(p48>=1) * EF((p40>=1 + (p94>=1 * p131>=1))))) * EG(!(((p67>=1 * (p29>=1 * p66>=1)) * ((p37>=1 * p66>=1) + (p29>=1 * p66>=1))))))
=> equivalent forward existential formula: [FwdG((Init * !((!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1)))))),!(((p67>=1 * (p29>=1 * p66>=1)) * ((p37>=1 * p66>=1) + (p29>=1 * p66>=1)))))] != FALSE
Checking (exact) 0 :[FwdG((Init * !((!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1)))))),!(((p67>=1 * (p29>=1 * p66>=1)) * ((p37>=1 * p66>=1) + (p29>=1 * p66>=1)))))] != FALSE
Checking (exact) 0 :FwdG((Init * !((!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1)))))),!(((p67>=1 * (p29>=1 * p66>=1)) * ((p37>=1 * p66>=1) + (p29>=1 * p66>=1)))))
Checking (exact) 1 :(Init * !((!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1))))))
Checking (exact) 1 :!((!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1)))))
Checking (exact) 1 :(!(EX(!(p48>=1))) * E(TRUE U (p40>=1 + (p94>=1 * p131>=1))))
Checking (exact) 1 :E(TRUE U (p40>=1 + (p94>=1 * p131>=1)))
Checking (exact) 1 :!(EX(!(p48>=1)))
Checking (exact) 1 :EX(!(p48>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 102/0/15
(forward)formula 11,1,57.0489,1270976,1,0,2866,7.69325e+06,439,1437,4821,7.49616e+06,3195
FORMULA Parking-PT-208-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(AX(AG(p12>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !(p12>=1))))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!(EX(!(!(E(TRUE U !(p12>=1))))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(EX(!(!(E(TRUE U !(p12>=1))))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EX(!(!(E(TRUE U !(p12>=1)))))))
Checking (exact) 1 :EX(!(!(E(TRUE U !(p12>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(p12>=1))))
Checking (exact) 1 :E(TRUE U !(p12>=1))
(forward)formula 12,0,57.5762,1283996,1,0,3030,7.73215e+06,444,1570,4822,7.57329e+06,3332
FORMULA Parking-PT-208-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(((p26>=1 * p69>=1) + !((p90>=1 + (p79>=1 * p128>=1)))) U p90>=1)
=> equivalent forward existential formula: [(FwdU(Init,((p26>=1 * p69>=1) + !((p90>=1 + (p79>=1 * p128>=1))))) * p90>=1)] != FALSE
Checking (exact) 0 :[(FwdU(Init,((p26>=1 * p69>=1) + !((p90>=1 + (p79>=1 * p128>=1))))) * p90>=1)] != FALSE
Checking (exact) 0 :(FwdU(Init,((p26>=1 * p69>=1) + !((p90>=1 + (p79>=1 * p128>=1))))) * p90>=1)
Checking (exact) 1 :p90>=1
Checking (exact) 1 :FwdU(Init,((p26>=1 * p69>=1) + !((p90>=1 + (p79>=1 * p128>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 107/0/10
(forward)formula 13,1,57.7659,1288480,1,0,3033,7.75053e+06,462,1571,4963,7.59632e+06,3336
FORMULA Parking-PT-208-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(EF((!(p41>=1) * (p136>=1 * (p21>=1 * p66>=1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * (!(p41>=1) * (p136>=1 * (p21>=1 * p66>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),TRUE) * (!(p41>=1) * (p136>=1 * (p21>=1 * p66>=1))))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),TRUE) * (!(p41>=1) * (p136>=1 * (p21>=1 * p66>=1))))
Checking (exact) 1 :(!(p41>=1) * (p136>=1 * (p21>=1 * p66>=1)))
Checking (exact) 1 :(p136>=1 * (p21>=1 * p66>=1))
Checking (exact) 1 :(p21>=1 * p66>=1)
Checking (exact) 1 :p66>=1
Checking (exact) 1 :FwdU(FwdU(Init,TRUE),TRUE)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 14,1,57.771,1289012,1,0,3037,7.75095e+06,471,1575,4971,7.59693e+06,3342
FORMULA Parking-PT-208-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (p48>=1 + (EG(AG(p24>=1)) + AF(EG(p70>=1))))
=> equivalent forward existential formula: [FwdG(((Init * !(p48>=1)) * !(EG(!(E(TRUE U !(p24>=1)))))),!(EG(p70>=1)))] = FALSE
Checking (exact) 0 :[FwdG(((Init * !(p48>=1)) * !(EG(!(E(TRUE U !(p24>=1)))))),!(EG(p70>=1)))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(p48>=1)) * !(EG(!(E(TRUE U !(p24>=1)))))),!(EG(p70>=1)))
Checking (exact) 1 :((Init * !(p48>=1)) * !(EG(!(E(TRUE U !(p24>=1))))))
Checking (exact) 1 :!(EG(!(E(TRUE U !(p24>=1)))))
Checking (exact) 1 :EG(!(E(TRUE U !(p24>=1))))
Checking (exact) 1 :!(E(TRUE U !(p24>=1)))
Checking (exact) 1 :E(TRUE U !(p24>=1))
Fast SCC detection found none.
Checking (exact) 1 :(Init * !(p48>=1))
Checking (exact) 1 :!(EG(p70>=1))
Checking (exact) 1 :EG(p70>=1)
(forward)formula 15,1,67.1835,1480372,1,0,3292,9.05996e+06,484,1682,4971,8.72676e+06,3656
FORMULA Parking-PT-208-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464744647095

--------------------
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
Jun 01, 2016 1:29:38 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 1:29:38 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 87 ms
Jun 01, 2016 1:29:38 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 137 places.
Jun 01, 2016 1:29:38 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 201 transitions.
Jun 01, 2016 1:29:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 130 ms
Jun 01, 2016 1:29:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 204 ms
Jun 01, 2016 1:29:39 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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_Parking-PT-208"
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_Parking-PT-208.tgz
mv S_Parking-PT-208 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_Parking-PT-208, 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-146444112701174"
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 ;