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

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

=== Now, execution of the tool begins

BK_START 1463934210564


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,1.15343e+07,0.220151,9760,2,329,5,9730,6,0,843,3942,0


Converting to forward existential form...Done !
original formula: !(EF(((flag_1_0>=1 * p3_0>=1) * ((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((flag_1_0>=1 * p3_0>=1) * ((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((flag_1_0>=1 * p3_0>=1) * ((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((flag_1_0>=1 * p3_0>=1) * ((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1))))
Checking (exact) 1 :((flag_1_0>=1 * p3_0>=1) * ((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1)))
Checking (exact) 1 :((((flag_1_9>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_6>=1 * flag_1_10>=1) * p1_10>=1)) + (flag_1_6>=1 * p3_6>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,0,0.228914,10020,1,0,11,9730,32,3,870,3942,3
FORMULA Dekker-PT-020-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(!(((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_4>=1) * p1_4>=1)) * !(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1)))) U EG((((((((((((((((((((flag_0_0>=1 * flag_0_1>=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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_2>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_4>=1) * p1_4>=1)) * !(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1))))),(((((((((((((((((((flag_0_0>=1 * flag_0_1>=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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_2>=1))] != FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,!(((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_4>=1) * p1_4>=1)) * !(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1))))),(((((((((((((((((((flag_0_0>=1 * flag_0_1>=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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_2>=1))] != FALSE
Checking (exact) 0 :FwdG(FwdU(Init,!(((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_4>=1) * p1_4>=1)) * !(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1))))),(((((((((((((((((((flag_0_0>=1 * flag_0_1>=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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_2>=1))
Checking (exact) 1 :FwdU(Init,!(((((flag_1_1>=1 * flag_1_11>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_4>=1) * p1_4>=1)) * !(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 227/0/213
Hit Full ! (commute/partial/dont) 1/7999/439
(forward)formula 1,0,1.26016,28536,1,0,916,145105,1018,446,9131,95135,898
FORMULA Dekker-PT-020-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(EF((((((((((((((((((((((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_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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_6>=1) * (flag_0_9>=1 * p0_9>=1)) * (((flag_1_8>=1 * flag_1_13>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1))))) + EG(A(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1) U ((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!((E(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)) U (!(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1)) * !(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))) + EG(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))))))),TRUE) * (((((((((((((((((((((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_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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_6>=1) * (flag_0_9>=1 * p0_9>=1)) * (((flag_1_8>=1 * flag_1_13>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(EG(!((E(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)) U (!(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1)) * !(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))) + EG(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))))))),TRUE) * (((((((((((((((((((((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_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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_6>=1) * (flag_0_9>=1 * p0_9>=1)) * (((flag_1_8>=1 * flag_1_13>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(EG(!((E(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)) U (!(((flag_1_9>=1 * flag_1_12>=1) * p1_9>=1)) * !(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))) + EG(!(((flag_1_14>=1 * flag_1_15>=1) * p1_15>=1)))))))),TRUE) * (((((((((((((((((((((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_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) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_6>=1) * (flag_0_9>=1 * p0_9>=1)) * (((flag_1_8>=1 * flag_1_13>=1) * p1_8>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1))))
(forward)formula 2,1,1.26417,28796,1,0,916,145259,1077,446,9199,95138,898
FORMULA Dekker-PT-020-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))))
Checking (exact) 1 :!(EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1))))
Checking (exact) 1 :EX(EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))
Checking (exact) 1 :EX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 3,0,1.34435,31436,1,0,924,157764,1081,452,9204,103918,907
FORMULA Dekker-PT-020-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(!(EG((flag_1_0>=1 * p3_0>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(flag_1_0>=1 * p3_0>=1))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),(flag_1_0>=1 * p3_0>=1))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),(flag_1_0>=1 * p3_0>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 399/40/41
(forward)formula 4,0,1.40609,32280,1,0,924,161264,1087,452,9410,105932,910
FORMULA Dekker-PT-020-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(((((flag_1_4>=1 * flag_1_10>=1) * p1_10>=1) + EX(((flag_1_7>=1 * flag_1_10>=1) * p1_7>=1))) * AG(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((flag_1_4>=1 * flag_1_10>=1) * p1_10>=1) + EX(((flag_1_7>=1 * flag_1_10>=1) * p1_7>=1)))) * !(E(TRUE U !(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * (((flag_1_4>=1 * flag_1_10>=1) * p1_10>=1) + EX(((flag_1_7>=1 * flag_1_10>=1) * p1_7>=1)))) * !(E(TRUE U !(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * (((flag_1_4>=1 * flag_1_10>=1) * p1_10>=1) + EX(((flag_1_7>=1 * flag_1_10>=1) * p1_7>=1)))) * !(E(TRUE U !(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1))))))
Checking (exact) 1 :!(E(TRUE U !(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1)))))
Checking (exact) 1 :E(TRUE U !(!(((flag_1_8>=1 * flag_1_19>=1) * p1_19>=1))))
(forward)formula 5,0,1.45232,33504,1,0,925,166789,1098,453,9496,108522,919
FORMULA Dekker-PT-020-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((EF(((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1))) U ((((flag_1_4>=1 * flag_1_18>=1) * p1_18>=1) * (((flag_1_2>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))) * ((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((((flag_1_4>=1 * flag_1_18>=1) * p1_18>=1) * (((flag_1_2>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))) * ((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,(E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((((flag_1_4>=1 * flag_1_18>=1) * p1_18>=1) * (((flag_1_2>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))) * ((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,(E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))) * ((((flag_1_4>=1 * flag_1_18>=1) * p1_18>=1) * (((flag_1_2>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))) * ((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1))))
Checking (exact) 1 :((((flag_1_4>=1 * flag_1_18>=1) * p1_18>=1) * (((flag_1_2>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_4>=1 * flag_1_13>=1) * p1_13>=1))) * ((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1)))
Checking (exact) 1 :((((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1) + ((flag_1_6>=1 * flag_1_19>=1) * p1_6>=1)) + ((flag_1_4>=1 * flag_1_15>=1) * p1_4>=1))
Checking (exact) 1 :FwdU(Init,(E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :(E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1)) + (((flag_1_4>=1 * flag_1_16>=1) * p1_16>=1) + ((flag_1_9>=1 * flag_1_10>=1) * p1_9>=1)))
Checking (exact) 1 :E(TRUE U ((flag_1_2>=1 * flag_1_13>=1) * p1_2>=1))
(forward)formula 6,1,1.51213,34896,1,0,932,174352,1148,458,9657,117239,931
FORMULA Dekker-PT-020-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(AG(EF(((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1)))))
Checking (exact) 1 :!(E(TRUE U ((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1))))
Checking (exact) 1 :E(TRUE U ((((((((((((((((((((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_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_19>=1) * p1_18>=1) + ((flag_1_9>=1 * flag_1_17>=1) * p1_9>=1)))
(forward)formula 7,0,1.54387,35844,1,0,934,177414,1177,459,9687,118891,937
FORMULA Dekker-PT-020-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AG(!(AX(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1)))))
Checking (exact) 1 :!(EX(!(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1))))
Checking (exact) 1 :EX(!(((flag_1_10>=1 * flag_1_17>=1) * p1_17>=1)))
(forward)formula 8,0,1.63709,36368,1,0,937,180472,1183,461,9696,122069,942
FORMULA Dekker-PT-020-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1))) * EF(AX(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))
=> equivalent forward existential formula: ([(Init * !(E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1)))))] != FALSE + [(Init * !(E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))))] != FALSE)
Checking (exact) 0 :([(Init * !(E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1)))))] != FALSE + [(Init * !(E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))))] != FALSE)
Checking (exact) 0 :[(Init * !(E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1)))))] != FALSE
Checking (exact) 0 :(Init * !(E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1)))))
Checking (exact) 1 :!(E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1))))
Checking (exact) 1 :E((((flag_1_12>=1 * flag_1_14>=1) * p1_12>=1) + ((flag_1_13>=1 * flag_1_15>=1) * p1_15>=1)) U !(((flag_1_5>=1 * flag_1_11>=1) * p1_11>=1)))
Checking (exact) 1 :Init
Checking (exact) 0 :[(Init * !(E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))))] != FALSE
Checking (exact) 0 :(Init * !(E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))))
Checking (exact) 1 :!(E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1))))))
Checking (exact) 1 :E(TRUE U !(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))))
Checking (exact) 1 :!(EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1))))
Checking (exact) 1 :EX(!(((flag_1_8>=1 * flag_1_18>=1) * p1_18>=1)))
Checking (exact) 1 :Init
(forward)formula 9,1,1.74528,38736,1,0,948,194626,1211,472,9723,134586,960
FORMULA Dekker-PT-020-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))) + AG(!((((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1))))) * E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))),TRUE) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1)))] = FALSE * [(Init * !(E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1))))))] = FALSE)
Checking (exact) 0 :([(FwdU((Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))),TRUE) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1)))] = FALSE * [(Init * !(E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1))))))] = FALSE)
Checking (exact) 1 :[(Init * !(E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1))))))] = FALSE
Checking (exact) 0 :(Init * !(E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1))))))
Checking (exact) 1 :!(E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1)))))
Checking (exact) 1 :E((!((flag_0_14>=1 * p0_14>=1)) * (((flag_1_0>=1 * flag_1_7>=1) * p1_7>=1) * ((flag_1_7>=1 * flag_1_13>=1) * p1_7>=1))) U ((((flag_1_3>=1 * flag_1_11>=1) * p1_11>=1) + ((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1)) + !(((flag_1_10>=1 * flag_1_13>=1) * p1_13>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))),TRUE) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))),TRUE) * (((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1)))
Checking (exact) 1 :(((flag_1_0>=1 * flag_1_11>=1) * p1_0>=1) * (flag_1_5>=1 * p3_5>=1))
Checking (exact) 1 :(flag_1_5>=1 * p3_5>=1)
Checking (exact) 1 :p3_5>=1
Checking (exact) 1 :FwdU((Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))),TRUE)
Checking (exact) 1 :(Init * !(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1)))))
Checking (exact) 1 :!(E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1))))
Checking (exact) 1 :E((((flag_1_8>=1 * flag_1_14>=1) * p1_8>=1) + ((flag_1_15>=1 * flag_1_19>=1) * p1_19>=1)) U (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) * ((flag_1_0>=1 * flag_1_15>=1) * p1_0>=1)))
Checking (exact) 1 :Init
(forward)formula 10,0,2.23384,51252,1,0,985,256150,1278,500,9795,190746,1009
FORMULA Dekker-PT-020-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((A((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1)) U (((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))) * EF((((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))))
=> equivalent forward existential formula: (([(FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))) * (!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))))] != FALSE + [FwdG(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))] != FALSE) + [(Init * !(E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))))] != FALSE)
Checking (exact) 0 :(([(FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))) * (!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))))] != FALSE + [FwdG(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))] != FALSE) + [(Init * !(E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))) * (!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))))] != FALSE + [FwdG(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))) * (!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))) * (!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))))
Checking (exact) 1 :(!((((flag_1_1>=1 * flag_1_15>=1) * p1_1>=1) + ((flag_1_2>=1 * flag_1_6>=1) * p1_2>=1))) * !((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))
Checking (exact) 1 :!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1)))
Checking (exact) 1 :FwdU(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 324/37/116
Checking (exact) 0 :[FwdG(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))] != FALSE
Checking (exact) 0 :FwdG(Init,!((((flag_1_10>=1 * flag_1_16>=1) * p1_16>=1) + (flag_0_7>=1 * p0_7>=1))))
Checking (exact) 1 :Init
Checking (exact) 0 :[(Init * !(E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))))] != FALSE
Checking (exact) 0 :(Init * !(E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))))
Checking (exact) 1 :!(E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1)))))
Checking (exact) 1 :E(TRUE U (((flag_1_3>=1 * flag_1_19>=1) * p1_19>=1) * (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + ((flag_1_3>=1 * flag_1_5>=1) * p1_5>=1))))
(forward)formula 11,0,2.25734,51668,1,0,991,257899,1326,504,9867,193101,1017
FORMULA Dekker-PT-020-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(((AG(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1)) + AX(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) + EF(!(EF(((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1)))))
=> equivalent forward existential formula: ([(EY(((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1))))))) * !(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=1)))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1))))] != FALSE)
Checking (exact) 0 :([(EY(((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1))))))) * !(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=1)))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1))))] != FALSE)
Checking (exact) 0 :[(EY(((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1))))))) * !(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=1)))] != FALSE
Checking (exact) 0 :(EY(((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1))))))) * !(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=1)))
Checking (exact) 1 :!(((flag_1_15>=1 * flag_1_16>=1) * p1_16>=1))
Checking (exact) 1 :EY(((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1)))))))
Checking (exact) 1 :((Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1))))) * !(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1)))))
Checking (exact) 1 :E(TRUE U !(((flag_1_2>=1 * flag_1_11>=1) * p1_2>=1)))
Checking (exact) 1 :(Init * !(!((((((((((((((((((((((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_12>=1) * flag_0_13>=1) * flag_0_14>=1) * flag_0_15>=1) * flag_0_16>=1) * flag_0_17>=1) * flag_0_18>=1) * flag_0_19>=1) * p1_11>=1) + ((flag_1_3>=1 * flag_1_10>=1) * p1_3>=1)) + ((flag_1_3>=1 * flag_1_6>=1) * p1_3>=1)))))
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1))))
Checking (exact) 1 :!(E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1)))
Checking (exact) 1 :E(TRUE U ((flag_1_7>=1 * flag_1_19>=1) * p1_7>=1))
(forward)formula 12,0,2.28686,52372,1,0,995,261490,1369,506,9921,195088,1028
FORMULA Dekker-PT-020-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1) + (EF(EG((flag_1_0>=1 * p3_0>=1))) * !(EX((((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1))))))
=> equivalent forward existential formula: ([((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))) * !(E(TRUE U EG((flag_1_0>=1 * p3_0>=1)))))] = FALSE * [(EY((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))) * (((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))] = FALSE)
Checking (exact) 0 :([((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))) * !(E(TRUE U EG((flag_1_0>=1 * p3_0>=1)))))] = FALSE * [(EY((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))) * (((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))] = FALSE)
Checking (exact) 1 :[(EY((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))) * (((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))] = FALSE
Checking (exact) 0 :(EY((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))) * (((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))
Checking (exact) 1 :(((flag_1_5>=1 * flag_1_14>=1) * p1_5>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1))
Checking (exact) 1 :((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)
Checking (exact) 1 :p1_1>=1
Checking (exact) 1 :EY((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))))
Checking (exact) 1 :(Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))
Checking (exact) 1 :[((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))) * !(E(TRUE U EG((flag_1_0>=1 * p3_0>=1)))))] = FALSE
Checking (exact) 0 :((Init * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))) * !(E(TRUE U EG((flag_1_0>=1 * p3_0>=1)))))
Checking (exact) 1 :!(E(TRUE U EG((flag_1_0>=1 * p3_0>=1))))
Checking (exact) 1 :E(TRUE U EG((flag_1_0>=1 * p3_0>=1)))
Checking (exact) 1 :EG((flag_1_0>=1 * p3_0>=1))
(forward)formula 13,1,2.34534,54244,1,0,1002,266323,1384,512,9936,199615,1045
FORMULA Dekker-PT-020-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!(AX(((flag_1_16>=1 * flag_1_19>=1) * p1_19>=1))) * EF((AX(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1)) * (((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) * (((flag_1_7>=1 * flag_1_18>=1) * p1_7>=1) + ((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1))))))
=> equivalent forward existential formula: [((FwdU((Init * !(!(EX(!(((flag_1_16>=1 * flag_1_19>=1) * p1_19>=1)))))),TRUE) * (((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) * (((flag_1_7>=1 * flag_1_18>=1) * p1_7>=1) + ((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1)))) * !(EX(!(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU((Init * !(!(EX(!(((flag_1_16>=1 * flag_1_19>=1) * p1_19>=1)))))),TRUE) * (((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) * (((flag_1_7>=1 * flag_1_18>=1) * p1_7>=1) + ((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1)))) * !(EX(!(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1)))))] != FALSE
Checking (exact) 0 :((FwdU((Init * !(!(EX(!(((flag_1_16>=1 * flag_1_19>=1) * p1_19>=1)))))),TRUE) * (((flag_1_8>=1 * flag_1_9>=1) * p1_8>=1) * (((flag_1_7>=1 * flag_1_18>=1) * p1_7>=1) + ((flag_1_2>=1 * flag_1_7>=1) * p1_2>=1)))) * !(EX(!(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1)))))
Checking (exact) 1 :!(EX(!(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1))))
Checking (exact) 1 :EX(!(((flag_1_1>=1 * flag_1_11>=1) * p1_11>=1)))
(forward)formula 14,0,2.40043,55824,1,0,1005,272226,1387,514,9940,205003,1050
FORMULA Dekker-PT-020-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(AF(AG((flag_1_4>=1 * p3_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1))))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1))))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1))))))))
Checking (exact) 1 :!(EG(!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1)))))))
Checking (exact) 1 :EG(!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !((flag_1_4>=1 * p3_4>=1)))))
Checking (exact) 1 :E(TRUE U !((flag_1_4>=1 * p3_4>=1)))
(forward)formula 15,0,2.4264,56592,1,0,1005,275476,1392,515,9944,206920,1057
FORMULA Dekker-PT-020-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1463934218494

--------------------
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:23:34 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 22, 2016 4:23:34 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 150 ms
May 22, 2016 4:23:34 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
May 22, 2016 4:23:35 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 440 transitions.
May 22, 2016 4:23:35 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 321 ms
May 22, 2016 4:23:35 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 42 ms
May 22, 2016 4:23:35 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-020"
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-020.tgz
mv Dekker-PT-020 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-020, 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-146348008600022"
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 ;