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

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

=== Now, execution of the tool begins

BK_START 1463996265287


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,1200,0.019314,4288,2,125,5,764,6,0,143,826,0


Converting to forward existential form...Done !
original formula: (((p_2_1>=1 * r_2_2>=1) * r_1_2>=1) + EF(((((p_0_0>=1 * r_0_1>=1) * (r_1_2>=1 * r_0_2>=1)) * ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)) * (!(p_1_0>=1) * (p_4_2>=1 * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))
=> equivalent forward existential formula: ([(Init * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))] != FALSE + [(FwdU(Init,TRUE) * ((((p_0_0>=1 * r_0_1>=1) * (r_1_2>=1 * r_0_2>=1)) * ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)) * (!(p_1_0>=1) * (p_4_2>=1 * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))))] != FALSE)
Checking (exact) 0 :([(Init * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))] != FALSE + [(FwdU(Init,TRUE) * ((((p_0_0>=1 * r_0_1>=1) * (r_1_2>=1 * r_0_2>=1)) * ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)) * (!(p_1_0>=1) * (p_4_2>=1 * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))))] != FALSE)
Checking (exact) 0 :[(Init * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))] != FALSE
Checking (exact) 0 :(Init * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((((p_0_0>=1 * r_0_1>=1) * (r_1_2>=1 * r_0_2>=1)) * ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)) * (!(p_1_0>=1) * (p_4_2>=1 * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((((p_0_0>=1 * r_0_1>=1) * (r_1_2>=1 * r_0_2>=1)) * ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)) * (!(p_1_0>=1) * (p_4_2>=1 * ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))))
(forward)formula 0,0,0.022457,4296,1,0,6,764,41,0,188,826,1
FORMULA ResAllocation-PT-R003C005-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AG(EF(p_4_2>=1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U p_4_2>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(EY(Init),TRUE) * !(E(TRUE U p_4_2>=1)))] = FALSE
Checking (exact) 0 :(FwdU(EY(Init),TRUE) * !(E(TRUE U p_4_2>=1)))
Checking (exact) 1 :!(E(TRUE U p_4_2>=1))
Checking (exact) 1 :E(TRUE U p_4_2>=1)
Checking (exact) 1 :FwdU(EY(Init),TRUE)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 1,0,0.073865,5492,1,0,67,5912,95,30,1001,6711,67
FORMULA ResAllocation-PT-R003C005-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1)) U (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))
=> equivalent forward existential formula: [(FwdU(Init,E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1))) * (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))] != FALSE
Checking (exact) 0 :[(FwdU(Init,E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1))) * (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))] != FALSE
Checking (exact) 0 :(FwdU(Init,E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1))) * (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))
Checking (exact) 1 :(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1))
Checking (exact) 1 :((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)
Checking (exact) 1 :r_3_2>=1
Checking (exact) 1 :FwdU(Init,E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :E((r_4_0>=1 * r_3_0>=1) U (r_4_0>=1 * r_3_0>=1))
(forward)formula 2,0,0.09941,6164,1,0,102,9073,120,63,1027,12333,119
FORMULA ResAllocation-PT-R003C005-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AG(EF((p_0_1>=1 * r_0_2>=1))) + (((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))),TRUE) * !(E(TRUE U (p_0_1>=1 * r_0_2>=1))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))),TRUE) * !(E(TRUE U (p_0_1>=1 * r_0_2>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))),TRUE) * !(E(TRUE U (p_0_1>=1 * r_0_2>=1))))
Checking (exact) 1 :!(E(TRUE U (p_0_1>=1 * r_0_2>=1)))
Checking (exact) 1 :E(TRUE U (p_0_1>=1 * r_0_2>=1))
Checking (exact) 1 :FwdU((Init * !((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))),TRUE)
Checking (exact) 1 :(Init * !((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1)))))
Checking (exact) 1 :!((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1))))
Checking (exact) 1 :(((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * EX((r_4_0>=1 * r_3_0>=1)))
Checking (exact) 1 :EX((r_4_0>=1 * r_3_0>=1))
Checking (exact) 1 :Init
(forward)formula 3,0,0.120449,6840,1,0,114,10958,130,75,1034,15120,143
FORMULA ResAllocation-PT-R003C005-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1))) U EF((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))) * !(E(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))) U (!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))) * !(E(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))) U (!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))) * !(E(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))) U (!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))))
Checking (exact) 1 :!(E(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))) U (!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))))))
Checking (exact) 1 :E(!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))) U (!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))))
Checking (exact) 1 :!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))
Checking (exact) 1 :E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))
Checking (exact) 1 :(!((((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + p_4_2>=1) + ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)) + ((p_3_0>=1 * (r_4_0>=1 * r_3_0>=1)) * (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * p_3_0>=1)))) * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))))
Checking (exact) 1 :!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1)))
Checking (exact) 1 :E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_0_2>=1))
(forward)formula 4,0,0.138715,6864,1,0,120,11433,157,80,1077,16037,155
FORMULA ResAllocation-PT-R003C005-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))) + AX((AF(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * AX((p_0_1>=1 * r_0_2>=1)))))
=> equivalent forward existential formula: ([FwdG(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1))))))))),!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] = FALSE * [(EY(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))))) * !((p_0_1>=1 * r_0_2>=1)))] = FALSE)
Checking (exact) 0 :([FwdG(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1))))))))),!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] = FALSE * [(EY(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))))) * !((p_0_1>=1 * r_0_2>=1)))] = FALSE)
Checking (exact) 1 :[(EY(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))))) * !((p_0_1>=1 * r_0_2>=1)))] = FALSE
Checking (exact) 0 :(EY(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))))) * !((p_0_1>=1 * r_0_2>=1)))
Checking (exact) 1 :!((p_0_1>=1 * r_0_2>=1))
Checking (exact) 1 :EY(EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1))))))))))
Checking (exact) 1 :EY((Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))))
Checking (exact) 1 :(Init * !(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1))))))))
Checking (exact) 1 :!(!(EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))))
Checking (exact) 1 :EX(!(((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_4_2>=1 * (r_2_0>=1 * r_1_0>=1))) * !(((r_3_2>=1 * r_2_2>=1) * p_3_0>=1)))))
Checking (exact) 1 :Init
(forward)formula 5,0,0.149564,6864,1,0,129,12833,171,85,1098,18095,161
FORMULA ResAllocation-PT-R003C005-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AF(!((p_0_0>=1 * r_0_1>=1))) * (p_0_2>=1 + EF(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!((p_0_0>=1 * r_0_1>=1))))] = FALSE * [((Init * !(p_0_2>=1)) * !(E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))] = FALSE)
Checking (exact) 0 :([FwdG(Init,!(!((p_0_0>=1 * r_0_1>=1))))] = FALSE * [((Init * !(p_0_2>=1)) * !(E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))] = FALSE)
Checking (exact) 1 :[((Init * !(p_0_2>=1)) * !(E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))] = FALSE
Checking (exact) 0 :((Init * !(p_0_2>=1)) * !(E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))
Checking (exact) 1 :!(E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))
Checking (exact) 1 :E(TRUE U ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))
Checking (exact) 1 :(Init * !(p_0_2>=1))
Checking (exact) 1 :[FwdG(Init,!(!((p_0_0>=1 * r_0_1>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!((p_0_0>=1 * r_0_1>=1))))
Checking (exact) 1 :Init
(forward)formula 6,1,0.17348,7780,1,0,151,15251,180,100,1103,22173,192
FORMULA ResAllocation-PT-R003C005-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(EX(EF(p_1_0>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))] = FALSE
Checking (exact) 0 :[(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))
Checking (exact) 1 :!(EX(E(TRUE U p_1_0>=1)))
Checking (exact) 1 :EX(E(TRUE U p_1_0>=1))
Checking (exact) 1 :E(TRUE U p_1_0>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 7,1,0.213415,8336,1,0,173,18899,180,115,1103,28478,230
FORMULA ResAllocation-PT-R003C005-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))) + (A((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) U (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)) * ((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)) + (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + AX(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))))
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))) * (!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))))] = FALSE * [FwdG((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))] = FALSE) * [(EY((((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))] = FALSE)
Checking (exact) 0 :(([(FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))) * (!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))))] = FALSE * [FwdG((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))] = FALSE) * [(EY((((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))] = FALSE)
Checking (exact) 1 :[(EY((((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))] = FALSE
Checking (exact) 0 :(EY((((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))
Checking (exact) 1 :!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))
Checking (exact) 1 :EY((((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :(((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))
Checking (exact) 1 :((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))) * !((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1))))
Checking (exact) 1 :!((((r_3_2>=1 * r_2_2>=1) + (p_4_2>=1 * ((r_3_0>=1 * p_3_1>=1) * r_2_0>=1))) * ((p_4_1>=1 * r_4_2>=1) * r_3_2>=1)))
Checking (exact) 1 :(Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))))
Checking (exact) 1 :!(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))
Checking (exact) 1 :EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))
Checking (exact) 1 :(EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))
Checking (exact) 1 :EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :([(FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))) * (!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))))] = FALSE * [FwdG((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))] = FALSE)
Checking (exact) 1 :[FwdG((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))] = FALSE
Checking (exact) 0 :FwdG((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))
Checking (exact) 1 :(Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))))
Checking (exact) 1 :!(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))
Checking (exact) 1 :EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))
Checking (exact) 1 :(EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))
Checking (exact) 1 :EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))) * (!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))) * (!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))))
Checking (exact) 1 :(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))
Checking (exact) 1 :!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1))
Checking (exact) 1 :FwdU((Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))),!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_2_2>=1)))
Checking (exact) 1 :(Init * !(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))))
Checking (exact) 1 :!(EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))))
Checking (exact) 1 :EG((EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1)))
Checking (exact) 1 :(EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1)) + ((p_2_0>=1 * r_2_1>=1) * r_1_1>=1))
Checking (exact) 1 :EX(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1))
Checking (exact) 1 :Init
(forward)formula 8,1,0.25592,9496,1,0,235,23267,216,156,1144,34715,292
FORMULA ResAllocation-PT-R003C005-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(p_0_2>=1)
=> equivalent forward existential formula: [FwdG(Init,!(p_0_2>=1))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(p_0_2>=1))] = FALSE
Checking (exact) 0 :FwdG(Init,!(p_0_2>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 18/0/2
(forward)formula 9,0,0.25897,9544,1,0,236,23424,222,159,1162,35109,296
FORMULA ResAllocation-PT-R003C005-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(((!((r_3_2>=1 * r_2_2>=1)) + AF(r_0_0>=1)) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * (E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))) * EX(AX((r_4_0>=1 * r_3_0>=1)))))
=> equivalent forward existential formula: [(EY(((Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))))) * !(EX(!((r_4_0>=1 * r_3_0>=1)))))] != FALSE
Checking (exact) 0 :[(EY(((Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))))) * !(EX(!((r_4_0>=1 * r_3_0>=1)))))] != FALSE
Checking (exact) 0 :(EY(((Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))))) * !(EX(!((r_4_0>=1 * r_3_0>=1)))))
Checking (exact) 1 :!(EX(!((r_4_0>=1 * r_3_0>=1))))
Checking (exact) 1 :EX(!((r_4_0>=1 * r_3_0>=1)))
Checking (exact) 1 :EY(((Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))))
Checking (exact) 1 :((Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1))))
Checking (exact) 1 :E(((r_3_1>=1 * p_3_2>=1) * r_2_1>=1) U (p_0_2>=1 * ((p_4_0>=1 * r_4_1>=1) * r_3_1>=1)))
Checking (exact) 1 :(Init * !(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :!(((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :((!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1)))) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))
Checking (exact) 1 :(!((r_3_2>=1 * r_2_2>=1)) + !(EG(!(r_0_0>=1))))
Checking (exact) 1 :!(EG(!(r_0_0>=1)))
Checking (exact) 1 :EG(!(r_0_0>=1))
Checking (exact) 1 :Init
(forward)formula 10,0,0.409051,13064,1,0,444,42179,234,264,1165,61611,529
FORMULA ResAllocation-PT-R003C005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((AF(!((p_0_1>=1 * r_0_2>=1))) + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)) * EF((((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))) * (r_3_2>=1 * r_2_2>=1))
=> equivalent forward existential formula: (([FwdG((Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))),!(!((p_0_1>=1 * r_0_2>=1))))] = FALSE * [(Init * !(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))] = FALSE) * [(Init * !((r_3_2>=1 * r_2_2>=1)))] = FALSE)
Checking (exact) 0 :(([FwdG((Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))),!(!((p_0_1>=1 * r_0_2>=1))))] = FALSE * [(Init * !(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))] = FALSE) * [(Init * !((r_3_2>=1 * r_2_2>=1)))] = FALSE)
Checking (exact) 1 :[(Init * !((r_3_2>=1 * r_2_2>=1)))] = FALSE
Checking (exact) 0 :(Init * !((r_3_2>=1 * r_2_2>=1)))
Checking (exact) 1 :([FwdG((Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))),!(!((p_0_1>=1 * r_0_2>=1))))] = FALSE * [(Init * !(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))] = FALSE)
Checking (exact) 1 :[(Init * !(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))] = FALSE
Checking (exact) 0 :(Init * !(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))))
Checking (exact) 1 :!(E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))))
Checking (exact) 1 :E(TRUE U (((r_3_0>=1 * p_3_1>=1) * r_2_0>=1) * (p_1_0>=1 + ((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG((Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))),!(!((p_0_1>=1 * r_0_2>=1))))] = FALSE
Checking (exact) 0 :FwdG((Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1))),!(!((p_0_1>=1 * r_0_2>=1))))
Checking (exact) 1 :(Init * !(((p_2_1>=1 * r_2_2>=1) * r_1_2>=1)))
(forward)formula 11,1,0.436503,14080,1,0,474,46446,243,285,1174,68091,582
FORMULA ResAllocation-PT-R003C005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: r_0_0>=1
=> equivalent forward existential formula: [(Init * r_0_0>=1)] != FALSE
Checking (exact) 0 :[(Init * r_0_0>=1)] != FALSE
Checking (exact) 0 :(Init * r_0_0>=1)
(forward)formula 12,1,0.436751,14088,1,0,475,46455,243,285,1174,68091,583
FORMULA ResAllocation-PT-R003C005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(A(p_4_2>=1 U p_3_0>=1) U (((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=1)) * AF(p_1_0>=1)))
=> equivalent forward existential formula: [((FwdU(Init,!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1))))) * ((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=1))) * !(EG(!(p_1_0>=1))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1))))) * ((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=1))) * !(EG(!(p_1_0>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1))))) * ((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=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 :(FwdU(Init,!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1))))) * ((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=1)))
Checking (exact) 1 :((p_0_0>=1 * r_0_1>=1) * (r_2_0>=1 * r_1_0>=1))
Checking (exact) 1 :(r_2_0>=1 * r_1_0>=1)
Checking (exact) 1 :r_1_0>=1
Checking (exact) 1 :FwdU(Init,!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!((E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1))))
Checking (exact) 1 :(E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1))) + EG(!(p_3_0>=1)))
Checking (exact) 1 :E(!(p_3_0>=1) U (!(p_4_2>=1) * !(p_3_0>=1)))
Checking (exact) 1 :EG(!(p_3_0>=1))
(forward)formula 13,0,0.545242,16968,1,0,662,61294,261,396,1178,91451,847
FORMULA ResAllocation-PT-R003C005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(A(((r_1_2>=1 * r_0_2>=1) + (r_4_0>=1 * r_3_0>=1)) U !(p_4_2>=1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(!(p_4_2>=1))) * (!(((r_1_2>=1 * r_0_2>=1) + (r_4_0>=1 * r_3_0>=1))) * !(!(p_4_2>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(p_4_2>=1)))] = FALSE)
Checking (exact) 0 :([(FwdU(FwdU(Init,TRUE),!(!(p_4_2>=1))) * (!(((r_1_2>=1 * r_0_2>=1) + (r_4_0>=1 * r_3_0>=1))) * !(!(p_4_2>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(p_4_2>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),!(!(p_4_2>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(!(p_4_2>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 18/0/2
(forward)formula 14,0,0.545902,17236,1,0,662,61294,267,397,1188,91454,850
FORMULA ResAllocation-PT-R003C005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(!(EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!(EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1)))))
Checking (exact) 1 :EG((((p_4_0>=1 * r_4_1>=1) * r_3_1>=1) * (r_4_0>=1 * r_3_0>=1)))
Fast SCC detection found none.
(forward)formula 15,1,0.547124,17236,1,0,662,61294,276,397,1193,91454,851
FORMULA ResAllocation-PT-R003C005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1463996270641

--------------------
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:37:48 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 9:37:49 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 54 ms
May 23, 2016 9:37:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 23, 2016 9:37:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 transitions.
May 23, 2016 9:37:49 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
May 23, 2016 9:37:49 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 22 ms
May 23, 2016 9:37:49 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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-R003C005"
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-R003C005.tgz
mv ResAllocation-PT-R003C005 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-R003C005, 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-146369138800292"
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 ;