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 Dekker-PT-015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025kn-smll-146348008600013
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463934134544


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,278528,0.070031,7228,2,244,5,5490,6,0,558,2502,0


Converting to forward existential form...Done !
original formula: AX(E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1)))))] = FALSE
Checking (exact) 0 :[(EY(Init) * !(E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1)))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1)))))
Checking (exact) 1 :!(E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1))))
Checking (exact) 1 :E(!(((flag_1_12>=1 * flag_1_13>=1) * p1_12>=1)) U (((flag_1_3>=1 * flag_1_14>=1) * p1_14>=1) * ((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1)))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 0,1,0.326003,13000,1,0,563,49207,550,275,4957,35921,550
FORMULA Dekker-PT-015-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(EX(!(((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1))) U (AX((flag_0_6>=1 * p0_6>=1)) * ((flag_1_1>=1 * flag_1_13>=1) * p1_1>=1)))
=> equivalent forward existential formula: [((FwdU(Init,EX(!(((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((flag_1_1>=1 * flag_1_13>=1) * p1_1>=1)) * !(EX(!((flag_0_6>=1 * p0_6>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,EX(!(((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((flag_1_1>=1 * flag_1_13>=1) * p1_1>=1)) * !(EX(!((flag_0_6>=1 * p0_6>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,EX(!(((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((flag_1_1>=1 * flag_1_13>=1) * p1_1>=1)) * !(EX(!((flag_0_6>=1 * p0_6>=1)))))
Checking (exact) 1 :!(EX(!((flag_0_6>=1 * p0_6>=1))))
Checking (exact) 1 :EX(!((flag_0_6>=1 * p0_6>=1)))
(forward)formula 1,0,0.338084,13396,1,0,566,50733,555,277,4962,37823,555
FORMULA Dekker-PT-015-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((flag_1_4>=1 * flag_1_5>=1) * p1_4>=1) + (((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + EF(EG(((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1)))))
=> equivalent forward existential formula: ([(Init * ((flag_1_4>=1 * flag_1_5>=1) * p1_4>=1))] != FALSE + ([(Init * ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))] != FALSE))
Checking (exact) 0 :([(Init * ((flag_1_4>=1 * flag_1_5>=1) * p1_4>=1))] != FALSE + ([(Init * ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))] != FALSE))
Checking (exact) 0 :[(Init * ((flag_1_4>=1 * flag_1_5>=1) * p1_4>=1))] != FALSE
Checking (exact) 0 :(Init * ((flag_1_4>=1 * flag_1_5>=1) * p1_4>=1))
Checking (exact) 0 :([(Init * ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))] != FALSE)
Checking (exact) 0 :[(Init * ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))] != FALSE
Checking (exact) 0 :(Init * ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))] != FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 196/101/59
(forward)formula 2,1,0.373012,14276,1,0,570,53259,584,279,5173,40475,567
FORMULA Dekker-PT-015-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!((!(AX(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))) + AG(!(((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))) + EF((EG(((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1)) + EG(((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))),TRUE) * ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))] != FALSE + ([FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))] != FALSE))
Checking (exact) 0 :([(FwdU((Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))),TRUE) * ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))] != FALSE + ([FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))] != FALSE))
Checking (exact) 0 :[(FwdU((Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))),TRUE) * ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))] != FALSE
Checking (exact) 0 :(FwdU((Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))),TRUE) * ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))
Checking (exact) 1 :((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1)
Checking (exact) 1 :p1_5>=1
Checking (exact) 1 :FwdU((Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))),TRUE)
Checking (exact) 1 :(Init * !(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1)))))))
Checking (exact) 1 :!(!(!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))))
Checking (exact) 1 :!(EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1))))
Checking (exact) 1 :EX(!(((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1)))
Checking (exact) 0 :([FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1))] != FALSE + [FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))] != FALSE)
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1))] != FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),((flag_1_4>=1 * flag_1_13>=1) * p1_4>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 196/101/59
(forward)formula 3,1,0.418807,15804,1,0,575,57597,606,282,5366,46362,578
FORMULA Dekker-PT-015-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EF(AG(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1)))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1)))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1)))))))
Checking (exact) 1 :!(E(TRUE U !(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1))))))
Checking (exact) 1 :E(TRUE U !(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1))))
Checking (exact) 1 :E(TRUE U !(((flag_1_11>=1 * flag_1_12>=1) * p1_12>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 4,0,0.441878,16560,1,0,576,60670,616,282,5434,48063,584
FORMULA Dekker-PT-015-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(AX(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))) + AG(!(((((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + ((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) * ((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))))),TRUE) * ((((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + ((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) * ((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1)))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))))),TRUE) * ((((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + ((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) * ((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))))),TRUE) * ((((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + ((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) * ((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1)))
Checking (exact) 1 :((((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1) + ((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) * ((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1))
Checking (exact) 1 :((flag_1_5>=1 * flag_1_10>=1) * p1_5>=1)
Checking (exact) 1 :p1_5>=1
Checking (exact) 1 :FwdU((Init * !(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))))),TRUE)
Checking (exact) 1 :(Init * !(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1)))))))))
Checking (exact) 1 :!(!(!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))))
Checking (exact) 1 :!(EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))
Checking (exact) 1 :EX(!(!((((flag_1_11>=1 * flag_1_13>=1) * p1_11>=1) * ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1)))))
Checking (exact) 1 :Init
(forward)formula 5,0,0.459867,17020,1,0,585,62392,641,289,5514,49787,593
FORMULA Dekker-PT-015-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(((!((((flag_1_6>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_10>=1))) + ((flag_1_6>=1 * flag_1_11>=1) * p1_11>=1)) + !(((((flag_1_2>=1 * flag_1_4>=1) * p1_2>=1) * ((flag_1_2>=1 * flag_1_12>=1) * p1_12>=1)) + !(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_14>=1) * p1_13>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((!((((flag_1_6>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_10>=1))) + ((flag_1_6>=1 * flag_1_11>=1) * p1_11>=1)) + !(((((flag_1_2>=1 * flag_1_4>=1) * p1_2>=1) * ((flag_1_2>=1 * flag_1_12>=1) * p1_12>=1)) + !(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_14>=1) * p1_13>=1)))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(((!((((flag_1_6>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_10>=1))) + ((flag_1_6>=1 * flag_1_11>=1) * p1_11>=1)) + !(((((flag_1_2>=1 * flag_1_4>=1) * p1_2>=1) * ((flag_1_2>=1 * flag_1_12>=1) * p1_12>=1)) + !(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_14>=1) * p1_13>=1)))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(((!((((flag_1_6>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_10>=1))) + ((flag_1_6>=1 * flag_1_11>=1) * p1_11>=1)) + !(((((flag_1_2>=1 * flag_1_4>=1) * p1_2>=1) * ((flag_1_2>=1 * flag_1_12>=1) * p1_12>=1)) + !(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_14>=1) * p1_13>=1)))))))
(forward)formula 6,1,0.464176,17280,1,0,585,62806,723,289,5617,49790,593
FORMULA Dekker-PT-015-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(((AG((flag_0_5>=1 * p0_5>=1)) * EG((flag_0_9>=1 * p0_9>=1))) * ((((((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_0>=1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * ((((((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_0>=1)) * !(E(TRUE U !((flag_0_5>=1 * p0_5>=1))))),(flag_0_9>=1 * p0_9>=1))] != FALSE
Checking (exact) 0 :[FwdG(((FwdU(Init,TRUE) * ((((((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_0>=1)) * !(E(TRUE U !((flag_0_5>=1 * p0_5>=1))))),(flag_0_9>=1 * p0_9>=1))] != FALSE
Checking (exact) 0 :FwdG(((FwdU(Init,TRUE) * ((((((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_0>=1)) * !(E(TRUE U !((flag_0_5>=1 * p0_5>=1))))),(flag_0_9>=1 * p0_9>=1))
Checking (exact) 1 :((FwdU(Init,TRUE) * ((((((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_0>=1)) * !(E(TRUE U !((flag_0_5>=1 * p0_5>=1)))))
Checking (exact) 1 :!(E(TRUE U !((flag_0_5>=1 * p0_5>=1))))
Checking (exact) 1 :E(TRUE U !((flag_0_5>=1 * p0_5>=1)))
(forward)formula 7,0,0.466822,17300,1,0,586,62806,735,289,5625,49791,597
FORMULA Dekker-PT-015-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(EX((((flag_1_10>=1 * p3_10>=1) * ((flag_1_3>=1 * flag_1_9>=1) * p1_9>=1)) * (((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((flag_1_10>=1 * p3_10>=1) * ((flag_1_3>=1 * flag_1_9>=1) * p1_9>=1)) * (((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * (((flag_1_10>=1 * p3_10>=1) * ((flag_1_3>=1 * flag_1_9>=1) * p1_9>=1)) * (((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * (((flag_1_10>=1 * p3_10>=1) * ((flag_1_3>=1 * flag_1_9>=1) * p1_9>=1)) * (((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))
Checking (exact) 1 :(((flag_1_10>=1 * p3_10>=1) * ((flag_1_3>=1 * flag_1_9>=1) * p1_9>=1)) * (((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1)))
Checking (exact) 1 :(((flag_1_5>=1 * flag_1_9>=1) * p1_9>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))
Checking (exact) 1 :((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1)
Checking (exact) 1 :p1_0>=1
Checking (exact) 1 :EY(FwdU(Init,TRUE))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 8,1,0.471458,17328,1,0,591,63163,757,293,5651,50302,602
FORMULA Dekker-PT-015-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E((flag_0_7>=1 * p0_7>=1) U ((!(((flag_1_7>=1 * flag_1_12>=1) * p1_7>=1)) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))) * !(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,(flag_0_7>=1 * p0_7>=1)) * ((!(((flag_1_7>=1 * flag_1_12>=1) * p1_7>=1)) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))) * !(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,(flag_0_7>=1 * p0_7>=1)) * ((!(((flag_1_7>=1 * flag_1_12>=1) * p1_7>=1)) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))) * !(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,(flag_0_7>=1 * p0_7>=1)) * ((!(((flag_1_7>=1 * flag_1_12>=1) * p1_7>=1)) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))) * !(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1))))
Checking (exact) 1 :((!(((flag_1_7>=1 * flag_1_12>=1) * p1_7>=1)) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))) * !(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1)))
Checking (exact) 1 :!(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1))
Checking (exact) 1 :FwdU(Init,(flag_0_7>=1 * p0_7>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 225/14/30
(forward)formula 9,1,0.493099,17632,1,0,595,65082,791,296,5796,51851,607
FORMULA Dekker-PT-015-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EF(((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U ((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1))))))
Checking (exact) 1 :!(E(TRUE U ((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1)))))
Checking (exact) 1 :E(TRUE U ((((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1) + ((flag_1_2>=1 * flag_1_8>=1) * p1_2>=1)) + (((flag_1_7>=1 * flag_1_11>=1) * p1_7>=1) + ((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1))))
(forward)formula 10,1,0.516718,18524,1,0,596,66329,809,296,5818,53007,610
FORMULA Dekker-PT-015-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1)))))
Checking (exact) 1 :!(EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1))))
Checking (exact) 1 :EX(!(((flag_1_0>=1 * flag_1_10>=1) * p1_10>=1)))
(forward)formula 11,1,0.543501,18784,1,0,599,69370,814,298,5826,56579,615
FORMULA Dekker-PT-015-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((E(((flag_1_2>=1 * flag_1_14>=1) * p1_14>=1) U ((flag_1_13>=1 * flag_1_14>=1) * p1_13>=1)) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))),((flag_1_2>=1 * flag_1_14>=1) * p1_14>=1)) * ((flag_1_13>=1 * flag_1_14>=1) * p1_13>=1))] != FALSE
Checking (exact) 0 :[(FwdU((FwdU(Init,TRUE) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))),((flag_1_2>=1 * flag_1_14>=1) * p1_14>=1)) * ((flag_1_13>=1 * flag_1_14>=1) * p1_13>=1))] != FALSE
Checking (exact) 0 :(FwdU((FwdU(Init,TRUE) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))),((flag_1_2>=1 * flag_1_14>=1) * p1_14>=1)) * ((flag_1_13>=1 * flag_1_14>=1) * p1_13>=1))
Checking (exact) 1 :((flag_1_13>=1 * flag_1_14>=1) * p1_13>=1)
Checking (exact) 1 :p1_13>=1
Checking (exact) 1 :FwdU((FwdU(Init,TRUE) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))),((flag_1_2>=1 * flag_1_14>=1) * p1_14>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * ((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1)))))
Checking (exact) 1 :((((flag_1_8>=1 * flag_1_12>=1) * p1_12>=1) + ((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1)) + ((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) + ((flag_1_0>=1 * flag_1_12>=1) * p1_0>=1)) + (((flag_1_1>=1 * flag_1_12>=1) * p1_12>=1) * ((flag_1_8>=1 * flag_1_11>=1) * p1_8>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 196/101/59
(forward)formula 12,1,0.607501,19488,1,0,606,73645,856,302,6058,63232,622
FORMULA Dekker-PT-015-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(AX((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))))
Checking (exact) 1 :!(EX(!((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1)))))
Checking (exact) 1 :EX(!((((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_10>=1))))
(forward)formula 13,0,0.620469,19880,1,0,610,76173,862,304,6070,65105,627
FORMULA Dekker-PT-015-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(!(EX((((flag_1_9>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_5>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((flag_1_9>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_5>=1)))] = FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * (((flag_1_9>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_5>=1)))] = FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * (((flag_1_9>=1 * flag_1_12>=1) * p1_12>=1) * ((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_5>=1)))
(forward)formula 14,1,0.623314,20340,1,0,610,76540,886,304,6106,65105,627
FORMULA Dekker-PT-015-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AG(!(EG(((flag_1_0>=1 * flag_1_11>=1) * p1_11>=1)))) * (!(A(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) U ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) * (!(AX(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1))) * (AG((flag_0_2>=1 * p0_2>=1)) + ((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((flag_1_0>=1 * flag_1_11>=1) * p1_11>=1))] = FALSE * ([((Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))) * !(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))))] = FALSE * ([(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))] = FALSE * [(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))] = FALSE)))
Checking (exact) 0 :([FwdG(FwdU(Init,TRUE),((flag_1_0>=1 * flag_1_11>=1) * p1_11>=1))] = FALSE * ([((Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))) * !(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))))] = FALSE * ([(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))] = FALSE * [(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))] = FALSE)))
Checking (exact) 1 :([((Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))) * !(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))))] = FALSE * ([(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))] = FALSE * [(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))] = FALSE))
Checking (exact) 1 :([(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))] = FALSE * [(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))] = FALSE)
Checking (exact) 1 :[(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE) * !((flag_0_2>=1 * p0_2>=1)))
Checking (exact) 1 :!((flag_0_2>=1 * p0_2>=1))
Checking (exact) 1 :FwdU((Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1))))),TRUE)
Checking (exact) 1 :(Init * !(((((flag_1_5>=1 * flag_1_11>=1) * p1_5>=1) + ((flag_1_7>=1 * flag_1_14>=1) * p1_14>=1)) + !(((flag_1_12>=1 * flag_1_13>=1) * p1_13>=1)))))
Checking (exact) 1 :[(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))] = FALSE
Checking (exact) 0 :(Init * !(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))))
Checking (exact) 1 :!(EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1))))
Checking (exact) 1 :EX(!(((((((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_8>=1) * flag_0_9>=1) * flag_0_10>=1) * flag_0_11>=1) * flag_0_12>=1) * flag_0_13>=1) * flag_0_14>=1) * p1_7>=1)))
Checking (exact) 1 :[((Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))) * !(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))))] = FALSE
Checking (exact) 0 :((Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))) * !(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))))
Checking (exact) 1 :!(E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)))))
Checking (exact) 1 :E(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)) U (!(((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1)) * !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))
Checking (exact) 1 :(Init * !(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)))))
Checking (exact) 1 :!(EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))))
Checking (exact) 1 :EG(!(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),((flag_1_0>=1 * flag_1_11>=1) * p1_11>=1))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),((flag_1_0>=1 * flag_1_11>=1) * p1_11>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 196/101/59
(forward)formula 15,0,0.696592,22284,1,0,622,86412,939,314,6377,75153,653
FORMULA Dekker-PT-015-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1463934140934

--------------------
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 22, 2016 4:22:19 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 22, 2016 4:22:19 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 105 ms
May 22, 2016 4:22:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 75 places.
May 22, 2016 4:22:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 255 transitions.
May 22, 2016 4:22:19 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 142 ms
May 22, 2016 4:22:19 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 23 ms
May 22, 2016 4:22:19 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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="Dekker-PT-015"
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/Dekker-PT-015.tgz
mv Dekker-PT-015 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 Dekker-PT-015, 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 r025kn-smll-146348008600013"
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 ;