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 ResAllocation-PT-R003C015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097kn-smll-146369138800310
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463996477307


its-ctl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.78878e+08,0.82576,21960,2,6564,5,76517,6,0,423,106011,0


Converting to forward existential form...Done !
original formula: (AG((AF(((p_8_1>=1 * r_8_2>=1) * r_7_2>=1)) + (((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))) * EF(A(p_11_0>=1 U ((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))),!(((p_8_1>=1 * r_8_2>=1) * r_7_2>=1)))] = FALSE * [(Init * !(E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))))))] = FALSE)
Checking (exact) 0 :([FwdG((FwdU(Init,TRUE) * !((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))),!(((p_8_1>=1 * r_8_2>=1) * r_7_2>=1)))] = FALSE * [(Init * !(E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))))))] = FALSE)
Checking (exact) 1 :[(Init * !(E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))))))] = FALSE
Checking (exact) 0 :(Init * !(E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))))))
Checking (exact) 1 :!(E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))))))
Checking (exact) 1 :E(TRUE U !((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))))
Checking (exact) 1 :!((E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))))
Checking (exact) 1 :(E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))) + EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))
Checking (exact) 1 :E(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)) U (!(p_11_0>=1) * !(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1))))
Checking (exact) 1 :EG(!(((p_10_0>=1 * r_10_1>=1) * r_9_1>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG((FwdU(Init,TRUE) * !((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))),!(((p_8_1>=1 * r_8_2>=1) * r_7_2>=1)))] = FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * !((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))),!(((p_8_1>=1 * r_8_2>=1) * r_7_2>=1)))
Checking (exact) 1 :(FwdU(Init,TRUE) * !((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1))))
Checking (exact) 1 :!((((r_13_2>=1 * r_12_2>=1) + (r_10_0>=1 * r_9_0>=1)) * (((r_11_1>=1 * p_11_2>=1) * r_10_1>=1) + p_4_2>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 53/0/7
(forward)formula 0,0,76.7031,1778948,1,0,506,8.09e+06,193,244,3076,1.32812e+07,539
FORMULA ResAllocation-PT-R003C015-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((AG(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)) + AF(p_10_2>=1))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)))),!(p_10_2>=1))] = FALSE
Checking (exact) 0 :[FwdG((Init * !((!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)))),!(p_10_2>=1))] = FALSE
Checking (exact) 0 :FwdG((Init * !((!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)))),!(p_10_2>=1))
Checking (exact) 1 :(Init * !((!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1))))
Checking (exact) 1 :!((!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)))
Checking (exact) 1 :(!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))) + ((p_14_0>=1 * r_14_1>=1) * r_13_1>=1))
Checking (exact) 1 :!(E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))))
Checking (exact) 1 :E(TRUE U !(!((((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 58/0/2
(forward)formula 1,0,88.3657,1914488,1,0,522,8.67862e+06,223,258,3135,1.40927e+07,565
FORMULA ResAllocation-PT-R003C015-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EG((p_6_2>=1 + EF(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))) * EX((((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + AX(p_5_0>=1))))
=> equivalent forward existential formula: ([(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * ((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))] != FALSE + [(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * !(EX(!(p_5_0>=1))))] != FALSE)
Checking (exact) 0 :([(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * ((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))] != FALSE + [(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * !(EX(!(p_5_0>=1))))] != FALSE)
Checking (exact) 0 :[(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * ((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))] != FALSE
Checking (exact) 0 :(EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))) * ((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))
Checking (exact) 1 :((r_8_0>=1 * r_7_0>=1) * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))
Checking (exact) 1 :((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)
Checking (exact) 1 :r_3_1>=1
Checking (exact) 1 :EY((Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))))
Checking (exact) 1 :(Init * EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))
Checking (exact) 1 :EG((p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))
Checking (exact) 1 :(p_6_2>=1 + E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))
Checking (exact) 1 :E(TRUE U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))
Checking (exact) 1 :Init
(forward)formula 2,1,100.859,2188464,1,0,644,9.86192e+06,248,348,3150,1.59909e+07,727
FORMULA ResAllocation-PT-R003C015-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((AX((p_3_0>=1 + p_8_2>=1)) + ((!(((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)) * ((r_10_0>=1 * r_9_0>=1) * ((p_6_1>=1 * r_6_2>=1) * r_5_2>=1))) * p_6_2>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((p_3_0>=1 + p_8_2>=1)))))] != FALSE + [(FwdU(Init,TRUE) * ((!(((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)) * ((r_10_0>=1 * r_9_0>=1) * ((p_6_1>=1 * r_6_2>=1) * r_5_2>=1))) * p_6_2>=1))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(EX(!((p_3_0>=1 + p_8_2>=1)))))] != FALSE + [(FwdU(Init,TRUE) * ((!(((p_14_0>=1 * r_14_1>=1) * r_13_1>=1)) * ((r_10_0>=1 * r_9_0>=1) * ((p_6_1>=1 * r_6_2>=1) * r_5_2>=1))) * p_6_2>=1))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!((p_3_0>=1 + p_8_2>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!((p_3_0>=1 + p_8_2>=1)))))
Checking (exact) 1 :!(EX(!((p_3_0>=1 + p_8_2>=1))))
Checking (exact) 1 :EX(!((p_3_0>=1 + p_8_2>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 3,1,101.188,2199628,1,0,650,9.9132e+06,252,352,3154,1.60825e+07,732
FORMULA ResAllocation-PT-R003C015-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(AF((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1))) U ((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))
=> equivalent forward existential formula: [((Init * !(EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))) * !(E(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)) U (!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))) * !(E(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)) U (!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))) * !(E(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)) U (!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))))
Checking (exact) 1 :!(E(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)) U (!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))
Checking (exact) 1 :E(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)) U (!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))
Checking (exact) 1 :(!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1)))))) * !(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))
Checking (exact) 1 :!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))
Checking (exact) 1 :!(!(EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1))))))
Checking (exact) 1 :EG(!((((r_5_1>=1 * p_5_2>=1) * r_4_1>=1) * ((r_9_1>=1 * p_9_2>=1) * r_8_1>=1))))
Checking (exact) 1 :(Init * !(EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))))
Checking (exact) 1 :!(EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1))))
Checking (exact) 1 :EG(!(((r_11_0>=1 * p_11_1>=1) * r_10_0>=1)))
Checking (exact) 1 :Init
(forward)formula 4,0,186.565,2658204,1,0,834,1.24585e+07,23,449,1463,2.01342e+07,512
FORMULA ResAllocation-PT-R003C015-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))
Checking (exact) 1 :((EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1)) * E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))
Checking (exact) 1 :E((p_0_1>=1 * r_0_2>=1) U ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))
Checking (exact) 1 :(EG(r_0_0>=1) * (r_9_2>=1 * r_8_2>=1))
Checking (exact) 1 :(r_9_2>=1 * r_8_2>=1)
Checking (exact) 1 :r_8_2>=1
Checking (exact) 1 :EG(r_0_0>=1)
(forward)formula 5,0,236.816,2772460,1,0,834,1.26275e+07,51,449,1661,2.12203e+07,865
FORMULA ResAllocation-PT-R003C015-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((r_8_0>=1 * r_7_0>=1) * A(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) U AF(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))
=> equivalent forward existential formula: [(((Init * (r_8_0>=1 * r_7_0>=1)) * !(EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))) * !(E(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))) U (!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))))] != FALSE
Checking (exact) 0 :[(((Init * (r_8_0>=1 * r_7_0>=1)) * !(EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))) * !(E(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))) U (!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))))] != FALSE
Checking (exact) 0 :(((Init * (r_8_0>=1 * r_7_0>=1)) * !(EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))) * !(E(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))) U (!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))))
Checking (exact) 1 :!(E(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))) U (!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))))))
Checking (exact) 1 :E(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))) U (!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))
Checking (exact) 1 :!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))
Checking (exact) 1 :EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))
Checking (exact) 1 :(!(!((p_7_0>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1)))) * !(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))))
Checking (exact) 1 :!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))
Checking (exact) 1 :EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))
Checking (exact) 1 :((Init * (r_8_0>=1 * r_7_0>=1)) * !(EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))))))
Checking (exact) 1 :!(EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))))
Checking (exact) 1 :EG(!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1))))))
Checking (exact) 1 :!(!(EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))))
Checking (exact) 1 :EG(!(((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)))
Checking (exact) 1 :(Init * (r_8_0>=1 * r_7_0>=1))
(forward)formula 6,0,412.447,3715488,1,0,949,1.69941e+07,39,509,1462,2.83863e+07,649
FORMULA ResAllocation-PT-R003C015-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((EF((p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!((E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!((E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)))
Checking (exact) 1 :(E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1))) * ((r_7_0>=1 * p_7_1>=1) * r_6_0>=1))
Checking (exact) 1 :((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)
Checking (exact) 1 :r_6_0>=1
Checking (exact) 1 :E(TRUE U (p_5_0>=1 * (r_11_2>=1 * r_10_2>=1)))
(forward)formula 7,0,441.369,3715488,1,0,949,1.69941e+07,62,509,1736,2.83863e+07,797
FORMULA ResAllocation-PT-R003C015-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))) U (EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) * EG(((p_12_1>=1 * r_12_2>=1) * r_11_2>=1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,(((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))) * EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))),((p_12_1>=1 * r_12_2>=1) * r_11_2>=1))] != FALSE
Checking (exact) 0 :[FwdG((FwdU(Init,(((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))) * EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))),((p_12_1>=1 * r_12_2>=1) * r_11_2>=1))] != FALSE
Checking (exact) 0 :FwdG((FwdU(Init,(((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))) * EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))),((p_12_1>=1 * r_12_2>=1) * r_11_2>=1))
Checking (exact) 1 :(FwdU(Init,(((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))) * EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))
Checking (exact) 1 :EX(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))
Checking (exact) 1 :FwdU(Init,(((r_7_2>=1 * r_6_2>=1) + !(((p_6_0>=1 * r_6_1>=1) * r_5_1>=1))) + !(((r_12_0>=1 * r_11_0>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 36/0/24
Hit Full ! (commute/partial/dont) 53/11/7
(forward)formula 8,1,447.02,3715488,1,0,949,1.69941e+07,114,509,1987,2.83863e+07,809
FORMULA ResAllocation-PT-R003C015-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((((!(p_10_2>=1) + !(p_2_2>=1)) + ((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)) + ((r_2_0>=1 * r_1_0>=1) + ((p_10_1>=1 * r_10_2>=1) * r_9_2>=1))) + EG(AX(((p_14_1>=1 * r_14_2>=1) * r_13_2>=1)))) * AF(AG(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1))))
=> equivalent forward existential formula: ([((Init * !((((!(p_10_2>=1) + !(p_2_2>=1)) + ((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)) + ((r_2_0>=1 * r_1_0>=1) + ((p_10_1>=1 * r_10_2>=1) * r_9_2>=1))))) * !(EG(!(EX(!(((p_14_1>=1 * r_14_2>=1) * r_13_2>=1)))))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1))))))] = FALSE)
Checking (exact) 0 :([((Init * !((((!(p_10_2>=1) + !(p_2_2>=1)) + ((p_8_0>=1 * r_8_1>=1) * r_7_1>=1)) + ((r_2_0>=1 * r_1_0>=1) + ((p_10_1>=1 * r_10_2>=1) * r_9_2>=1))))) * !(EG(!(EX(!(((p_14_1>=1 * r_14_2>=1) * r_13_2>=1)))))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1))))))] = FALSE)
Checking (exact) 1 :[FwdG(Init,!(!(E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1)))))
Checking (exact) 1 :E(TRUE U !(((r_5_0>=1 * p_5_1>=1) * r_4_0>=1)))
(forward)formula 9,0,449.041,3715488,1,0,949,1.69941e+07,126,509,2054,2.83863e+07,818
FORMULA ResAllocation-PT-R003C015-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1)) + AX(EF(p_11_0>=1))) + EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))
=> equivalent forward existential formula: [(EY(((Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))) * !((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1))))) * !(E(TRUE U p_11_0>=1)))] = FALSE
Checking (exact) 0 :[(EY(((Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))) * !((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1))))) * !(E(TRUE U p_11_0>=1)))] = FALSE
Checking (exact) 0 :(EY(((Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))) * !((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1))))) * !(E(TRUE U p_11_0>=1)))
Checking (exact) 1 :!(E(TRUE U p_11_0>=1))
Checking (exact) 1 :E(TRUE U p_11_0>=1)
Checking (exact) 1 :EY(((Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))) * !((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1)))))
Checking (exact) 1 :((Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))) * !((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1))))
Checking (exact) 1 :!((!((r_14_0>=1 * r_13_0>=1)) * (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * p_3_0>=1)))
Checking (exact) 1 :(Init * !(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1))))))
Checking (exact) 1 :!(EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1)))))
Checking (exact) 1 :EX(((!(((r_7_0>=1 * p_7_1>=1) * r_6_0>=1)) + !((r_8_0>=1 * r_7_0>=1))) * (((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) + ((r_4_0>=1 * r_3_0>=1) * p_8_2>=1))))
Checking (exact) 1 :Init
(forward)formula 10,1,457.365,3715488,1,0,949,1.69941e+07,149,516,2087,2.83863e+07,860
FORMULA ResAllocation-PT-R003C015-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(AF(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EG(!(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1))))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!(EG(!(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1))))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(EG(!(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1))))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EG(!(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1)))))))
Checking (exact) 1 :EG(!(((r_8_0>=1 * r_7_0>=1) * !((r_1_2>=1 * r_0_2>=1)))))
(forward)formula 11,0,591.32,4655404,1,0,949,2.08342e+07,16,617,1637,3.5183e+07,249
FORMULA ResAllocation-PT-R003C015-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(AF(!((r_14_0>=1 * r_13_0>=1)))) * ((AG(p_10_2>=1) * (!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))) + !(AF(p_1_0>=1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!((r_14_0>=1 * r_13_0>=1))))] = FALSE * ([(FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE) * !(p_10_2>=1))] = FALSE * [((Init * !(!(!(EG(!(p_1_0>=1)))))) * !((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))] = FALSE))
Checking (exact) 0 :([FwdG(EY(Init),!(!((r_14_0>=1 * r_13_0>=1))))] = FALSE * ([(FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE) * !(p_10_2>=1))] = FALSE * [((Init * !(!(!(EG(!(p_1_0>=1)))))) * !((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))] = FALSE))
Checking (exact) 1 :([(FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE) * !(p_10_2>=1))] = FALSE * [((Init * !(!(!(EG(!(p_1_0>=1)))))) * !((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))] = FALSE)
Checking (exact) 1 :[((Init * !(!(!(EG(!(p_1_0>=1)))))) * !((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))] = FALSE
Checking (exact) 0 :((Init * !(!(!(EG(!(p_1_0>=1)))))) * !((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1))))
Checking (exact) 1 :!((!(p_10_2>=1) * ((r_9_0>=1 * p_9_1>=1) * r_8_0>=1)))
Checking (exact) 1 :(Init * !(!(!(EG(!(p_1_0>=1))))))
Checking (exact) 1 :!(!(!(EG(!(p_1_0>=1)))))
Checking (exact) 1 :!(EG(!(p_1_0>=1)))
Checking (exact) 1 :EG(!(p_1_0>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE) * !(p_10_2>=1))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE) * !(p_10_2>=1))
Checking (exact) 1 :!(p_10_2>=1)
Checking (exact) 1 :FwdU((Init * !(!(!(EG(!(p_1_0>=1)))))),TRUE)
Checking (exact) 1 :(Init * !(!(!(EG(!(p_1_0>=1))))))
Checking (exact) 1 :!(!(!(EG(!(p_1_0>=1)))))
Checking (exact) 1 :!(EG(!(p_1_0>=1)))
Checking (exact) 1 :EG(!(p_1_0>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG(EY(Init),!(!((r_14_0>=1 * r_13_0>=1))))] = FALSE
Checking (exact) 0 :FwdG(EY(Init),!(!((r_14_0>=1 * r_13_0>=1))))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 56/2/4
(forward)formula 12,0,617.024,4655404,1,0,949,2.08342e+07,47,617,1759,3.5183e+07,611
FORMULA ResAllocation-PT-R003C015-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(AX(EX(p_12_2>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(p_12_2>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(EX(p_12_2>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(EX(p_12_2>=1)))))
Checking (exact) 1 :!(EX(!(EX(p_12_2>=1))))
Checking (exact) 1 :EX(!(EX(p_12_2>=1)))
Checking (exact) 1 :!(EX(p_12_2>=1))
Checking (exact) 1 :EX(p_12_2>=1)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 13,1,617.496,4655404,1,0,949,2.08342e+07,48,617,1759,3.5183e+07,620
FORMULA ResAllocation-PT-R003C015-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (A(AG(p_11_0>=1) U AF(p_13_0>=1)) + (AG(AX(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))) + (!(EX((r_4_0>=1 * r_3_0>=1))) * (((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1)))))))
=> equivalent forward existential formula: ([(EY(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))) * (r_4_0>=1 * r_3_0>=1))] = FALSE * [(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))) * !((((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1))))))] = FALSE)
Checking (exact) 0 :([(EY(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))) * (r_4_0>=1 * r_3_0>=1))] = FALSE * [(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))) * !((((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1))))))] = FALSE)
Checking (exact) 1 :[(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))) * !((((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1))))))] = FALSE
Checking (exact) 0 :(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))) * !((((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1))))))
Checking (exact) 1 :!((((((p_8_0>=1 * r_8_1>=1) * r_7_1>=1) * p_1_0>=1) + !(p_4_2>=1)) * !((((r_5_0>=1 * p_5_1>=1) * r_4_0>=1) * (r_8_0>=1 * r_7_0>=1)))))
Checking (exact) 1 :((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))
Checking (exact) 1 :!(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))
Checking (exact) 1 :E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))
Checking (exact) 1 :!(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))
Checking (exact) 1 :EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))
Checking (exact) 1 :(Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1)))))))))
Checking (exact) 1 :!(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))
Checking (exact) 1 :(E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))
Checking (exact) 1 :E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1))))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :(!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :!(!(E(TRUE U !(p_11_0>=1))))
Checking (exact) 1 :E(TRUE U !(p_11_0>=1))
Checking (exact) 1 :EG(!(!(EG(!(p_13_0>=1)))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(EY(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))) * (r_4_0>=1 * r_3_0>=1))] = FALSE
Checking (exact) 0 :(EY(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))) * (r_4_0>=1 * r_3_0>=1))
Checking (exact) 1 :(r_4_0>=1 * r_3_0>=1)
Checking (exact) 1 :r_3_0>=1
Checking (exact) 1 :EY(((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))))
Checking (exact) 1 :((Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))) * !(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))))))
Checking (exact) 1 :!(!(E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))))
Checking (exact) 1 :E(TRUE U !(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1))))))
Checking (exact) 1 :!(!(EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))))
Checking (exact) 1 :EX(!(((r_11_1>=1 * p_11_2>=1) * r_10_1>=1)))
Checking (exact) 1 :(Init * !(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1)))))))))
Checking (exact) 1 :!(!((E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))))
Checking (exact) 1 :(E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))) + EG(!(!(EG(!(p_13_0>=1))))))
Checking (exact) 1 :E(!(!(EG(!(p_13_0>=1)))) U (!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1))))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :(!(!(E(TRUE U !(p_11_0>=1)))) * !(!(EG(!(p_13_0>=1)))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :!(!(E(TRUE U !(p_11_0>=1))))
Checking (exact) 1 :E(TRUE U !(p_11_0>=1))
Checking (exact) 1 :EG(!(!(EG(!(p_13_0>=1)))))
Checking (exact) 1 :!(!(EG(!(p_13_0>=1))))
Checking (exact) 1 :EG(!(p_13_0>=1))
Checking (exact) 1 :Init
(forward)formula 14,0,642.419,4655408,1,0,949,2.08342e+07,105,617,1883,3.5183e+07,1050
FORMULA ResAllocation-PT-R003C015-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1)))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!((!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!((!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1))))
Checking (exact) 1 :(!((((r_9_0>=1 * p_9_1>=1) * r_8_0>=1) + (p_13_0>=1 * (r_14_0>=1 * r_13_0>=1)))) * EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1)))
Checking (exact) 1 :EG((((p_6_0>=1 * r_6_1>=1) * r_5_1>=1) + p_2_2>=1))
(forward)formula 15,0,664.151,4655408,1,0,1037,2.08342e+07,125,679,1898,3.5183e+07,1298
FORMULA ResAllocation-PT-R003C015-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1463997147856

--------------------
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 23, 2016 9:41:20 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 9:41:21 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 132 ms
May 23, 2016 9:41:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 90 places.
May 23, 2016 9:41:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 transitions.
May 23, 2016 9:41:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 103 ms
May 23, 2016 9:41:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 21 ms
May 23, 2016 9:41:21 AM 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="ResAllocation-PT-R003C015"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r097kn-smll-146369138800310"
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 ;