Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_ResAllocation-PT-R002C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110700265
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464505029804


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,8,0.009697,4108,2,16,5,77,6,0,41,57,0


Converting to forward existential form...Done !
original formula: (!((p_1_0>=1 * r_0_0>=1)) + (E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1) * (AF((p_0_1>=1 + p_1_0>=1)) + EF(((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))))
=> equivalent forward existential formula: ([((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1)))] = FALSE * [FwdG(((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))),!((p_0_1>=1 + p_1_0>=1)))] = FALSE)
Checking (exact) 0 :([((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1)))] = FALSE * [FwdG(((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))),!((p_0_1>=1 + p_1_0>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))),!((p_0_1>=1 + p_1_0>=1)))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))),!((p_0_1>=1 + p_1_0>=1)))
Checking (exact) 1 :((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))
Checking (exact) 1 :!(E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :E(TRUE U ((p_0_0>=1 * r_0_1>=1) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :(Init * !(!((p_1_0>=1 * r_0_0>=1))))
Checking (exact) 1 :[((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1)))] = FALSE
Checking (exact) 0 :((Init * !(!((p_1_0>=1 * r_0_0>=1)))) * !(E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1)))
Checking (exact) 1 :!(E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1))
Checking (exact) 1 :E((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (r_1_1>=1 * r_0_1>=1)) U p_0_1>=1)
Checking (exact) 1 :(Init * !(!((p_1_0>=1 * r_0_0>=1))))
(forward)formula 0,1,0.018511,4468,1,0,39,231,64,23,250,323,56
FORMULA ResAllocation-PT-R002C002-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX((AF((p_1_0>=1 + r_0_0>=1)) + ((r_1_1>=1 * r_0_1>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!((p_1_0>=1 + r_0_0>=1)))))] != FALSE + [(EY(Init) * ((r_1_1>=1 * r_0_1>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE)
Checking (exact) 0 :([(EY(Init) * !(EG(!((p_1_0>=1 + r_0_0>=1)))))] != FALSE + [(EY(Init) * ((r_1_1>=1 * r_0_1>=1) + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE)
Checking (exact) 0 :[(EY(Init) * !(EG(!((p_1_0>=1 + r_0_0>=1)))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(EG(!((p_1_0>=1 + r_0_0>=1)))))
Checking (exact) 1 :!(EG(!((p_1_0>=1 + r_0_0>=1))))
Checking (exact) 1 :EG(!((p_1_0>=1 + r_0_0>=1)))
Fast SCC detection found none.
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 1,1,0.020312,4492,1,0,48,255,70,33,253,390,90
FORMULA ResAllocation-PT-R002C002-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)
=> equivalent forward existential formula: [(Init * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))] != FALSE
Checking (exact) 0 :[(Init * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))] != FALSE
Checking (exact) 0 :(Init * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))
(forward)formula 2,0,0.020989,4492,1,0,48,255,70,33,253,391,91
FORMULA ResAllocation-PT-R002C002-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(E(p_1_0>=1 U r_0_0>=1))
=> equivalent forward existential formula: [(FwdU(Init,p_1_0>=1) * r_0_0>=1)] = FALSE
Checking (exact) 0 :[(FwdU(Init,p_1_0>=1) * r_0_0>=1)] = FALSE
Checking (exact) 0 :(FwdU(Init,p_1_0>=1) * r_0_0>=1)
Checking (exact) 1 :r_0_0>=1
Checking (exact) 1 :FwdU(Init,p_1_0>=1)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 3,0,0.021603,4504,1,0,49,255,76,34,264,394,95
FORMULA ResAllocation-PT-R002C002-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (p_0_0>=1 * r_0_1>=1)
=> equivalent forward existential formula: [(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE
Checking (exact) 0 :[(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE
Checking (exact) 0 :(Init * (p_0_0>=1 * r_0_1>=1))
(forward)formula 4,0,0.022111,4504,1,0,49,255,76,34,264,394,96
FORMULA ResAllocation-PT-R002C002-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(((AG(p_1_0>=1) * AF(p_1_0>=1)) + !(r_0_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(p_1_0>=1))) * !(EG(!(p_1_0>=1)))) + !(r_0_0>=1))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(((!(E(TRUE U !(p_1_0>=1))) * !(EG(!(p_1_0>=1)))) + !(r_0_0>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(((!(E(TRUE U !(p_1_0>=1))) * !(EG(!(p_1_0>=1)))) + !(r_0_0>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(((!(E(TRUE U !(p_1_0>=1))) * !(EG(!(p_1_0>=1)))) + !(r_0_0>=1)))
Checking (exact) 1 :((!(E(TRUE U !(p_1_0>=1))) * !(EG(!(p_1_0>=1)))) + !(r_0_0>=1))
Checking (exact) 1 :(!(E(TRUE U !(p_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 :!(E(TRUE U !(p_1_0>=1)))
Checking (exact) 1 :E(TRUE U !(p_1_0>=1))
(forward)formula 5,1,0.024756,4532,1,0,57,282,87,53,269,548,138
FORMULA ResAllocation-PT-R002C002-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E((EG(r_0_0>=1) * EF(p_1_0>=1)) U (!(((p_0_0>=1 * r_0_1>=1) * r_0_0>=1)) * AG(r_0_0>=1)))
=> equivalent forward existential formula: [((FwdU(Init,(EG(r_0_0>=1) * E(TRUE U p_1_0>=1))) * !(((p_0_0>=1 * r_0_1>=1) * r_0_0>=1))) * !(E(TRUE U !(r_0_0>=1))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,(EG(r_0_0>=1) * E(TRUE U p_1_0>=1))) * !(((p_0_0>=1 * r_0_1>=1) * r_0_0>=1))) * !(E(TRUE U !(r_0_0>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,(EG(r_0_0>=1) * E(TRUE U p_1_0>=1))) * !(((p_0_0>=1 * r_0_1>=1) * r_0_0>=1))) * !(E(TRUE U !(r_0_0>=1))))
Checking (exact) 1 :!(E(TRUE U !(r_0_0>=1)))
Checking (exact) 1 :E(TRUE U !(r_0_0>=1))
(forward)formula 6,0,0.025341,4536,1,0,57,282,87,53,269,548,140
FORMULA ResAllocation-PT-R002C002-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!(((AF((r_1_1>=1 * r_0_1>=1)) + ((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1))) + EF((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) + p_0_1>=1)
=> equivalent forward existential formula: ([FwdG(((Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) * !(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))] != FALSE + [(Init * p_0_1>=1)] != FALSE)
Checking (exact) 0 :([FwdG(((Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) * !(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))] != FALSE + [(Init * p_0_1>=1)] != FALSE)
Checking (exact) 0 :[FwdG(((Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) * !(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))] != FALSE
Checking (exact) 0 :FwdG(((Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) * !(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))
Checking (exact) 1 :((Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))) * !(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1))))
Checking (exact) 1 :!(((p_1_0>=1 * r_0_0>=1) * ((r_1_1>=1 * r_0_1>=1) + r_0_0>=1)))
Checking (exact) 1 :(Init * !(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1))))
Checking (exact) 1 :!(E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1)))
Checking (exact) 1 :E(TRUE U (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * p_1_0>=1))
Checking (exact) 1 :Init
Checking (exact) 0 :[(Init * p_0_1>=1)] != FALSE
Checking (exact) 0 :(Init * p_0_1>=1)
(forward)formula 7,0,0.028338,4536,1,0,58,283,99,55,283,555,144
FORMULA ResAllocation-PT-R002C002-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!((r_1_1>=1 * r_0_1>=1)) + (((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * AX(p_1_0>=1)))
=> equivalent forward existential formula: ([((Init * !(!((r_1_1>=1 * r_0_1>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] = FALSE * [(EY((Init * !(!((r_1_1>=1 * r_0_1>=1))))) * !(p_1_0>=1))] = FALSE)
Checking (exact) 0 :([((Init * !(!((r_1_1>=1 * r_0_1>=1)))) * !(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] = FALSE * [(EY((Init * !(!((r_1_1>=1 * r_0_1>=1))))) * !(p_1_0>=1))] = FALSE)
Checking (exact) 1 :[(EY((Init * !(!((r_1_1>=1 * r_0_1>=1))))) * !(p_1_0>=1))] = FALSE
Checking (exact) 0 :(EY((Init * !(!((r_1_1>=1 * r_0_1>=1))))) * !(p_1_0>=1))
Checking (exact) 1 :!(p_1_0>=1)
Checking (exact) 1 :EY((Init * !(!((r_1_1>=1 * r_0_1>=1)))))
Checking (exact) 1 :(Init * !(!((r_1_1>=1 * r_0_1>=1))))
(forward)formula 8,0,0.029004,4540,1,0,59,283,99,57,283,566,145
FORMULA ResAllocation-PT-R002C002-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(A(r_0_0>=1 U (r_1_1>=1 * r_0_1>=1)) U (AX(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * (!(r_0_0>=1) + p_1_0>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))) * !(E(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))) U (!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))) * !(E(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))) U (!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))) * !(E(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))) U (!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))))
Checking (exact) 1 :!(E(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))) U (!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))))))
Checking (exact) 1 :E(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))) U (!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))
Checking (exact) 1 :!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))
Checking (exact) 1 :(!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))
Checking (exact) 1 :(!(r_0_0>=1) + p_1_0>=1)
Checking (exact) 1 :!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :(!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1)))))) * !((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))))
Checking (exact) 1 :!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))
Checking (exact) 1 :(!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))
Checking (exact) 1 :(!(r_0_0>=1) + p_1_0>=1)
Checking (exact) 1 :!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :!(!((E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1))))))
Checking (exact) 1 :(E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1)))) + EG(!((r_1_1>=1 * r_0_1>=1))))
Checking (exact) 1 :E(!((r_1_1>=1 * r_0_1>=1)) U (!(r_0_0>=1) * !((r_1_1>=1 * r_0_1>=1))))
Checking (exact) 1 :EG(!((r_1_1>=1 * r_0_1>=1)))
Fast SCC detection found none.
Checking (exact) 1 :(Init * !(EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))))))
Checking (exact) 1 :!(EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))))
Checking (exact) 1 :EG(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))))
Checking (exact) 1 :!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1)))
Checking (exact) 1 :(!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * (!(r_0_0>=1) + p_1_0>=1))
Checking (exact) 1 :(!(r_0_0>=1) + p_1_0>=1)
Checking (exact) 1 :!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :Init
(forward)formula 9,0,0.039967,4580,1,0,73,313,112,83,290,703,202
FORMULA ResAllocation-PT-R002C002-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!((EF(!(p_0_1>=1)) + p_1_0>=1)) + AF((r_1_1>=1 * r_0_1>=1)))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(TRUE U !(p_0_1>=1)) + p_1_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))] = FALSE
Checking (exact) 0 :[FwdG((Init * !(!((E(TRUE U !(p_0_1>=1)) + p_1_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))] = FALSE
Checking (exact) 0 :FwdG((Init * !(!((E(TRUE U !(p_0_1>=1)) + p_1_0>=1)))),!((r_1_1>=1 * r_0_1>=1)))
Checking (exact) 1 :(Init * !(!((E(TRUE U !(p_0_1>=1)) + p_1_0>=1))))
Checking (exact) 1 :!(!((E(TRUE U !(p_0_1>=1)) + p_1_0>=1)))
Checking (exact) 1 :(E(TRUE U !(p_0_1>=1)) + p_1_0>=1)
Checking (exact) 1 :E(TRUE U !(p_0_1>=1))
Checking (exact) 1 :Init
(forward)formula 10,1,0.041165,4580,1,0,74,315,113,85,290,711,208
FORMULA ResAllocation-PT-R002C002-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((!((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1)))) * EF((r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) + EF(AX(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) + p_1_0>=1)
=> equivalent forward existential formula: (([(FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE) * (r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))] != FALSE) + [(Init * p_1_0>=1)] != FALSE)
Checking (exact) 0 :(([(FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE) * (r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))] != FALSE) + [(Init * p_1_0>=1)] != FALSE)
Checking (exact) 0 :([(FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE) * (r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))] != FALSE)
Checking (exact) 0 :[(FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE) * (r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))] != FALSE
Checking (exact) 0 :(FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE) * (r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))
Checking (exact) 1 :(r_0_0>=1 + ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))
Checking (exact) 1 :FwdU((Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1))))),TRUE)
Checking (exact) 1 :(Init * !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) * !((p_0_0>=1 * r_0_1>=1)))))
(forward)formula 11,1,0.043729,4580,1,0,74,318,119,87,304,723,212
FORMULA ResAllocation-PT-R002C002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((((p_0_0>=1 * r_0_1>=1) + AX(!(r_0_0>=1))) + EF(((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))) + ((AG((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))) + !(EF(p_0_1>=1))) * (AF(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))) * p_1_0>=1)))
=> equivalent forward existential formula: ([(FwdU(((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))),TRUE) * p_0_1>=1)] = FALSE * ([FwdG((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))),!(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))] = FALSE * [((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(p_1_0>=1))] = FALSE))
Checking (exact) 0 :([(FwdU(((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))),TRUE) * p_0_1>=1)] = FALSE * ([FwdG((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))),!(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))] = FALSE * [((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(p_1_0>=1))] = FALSE))
Checking (exact) 1 :([FwdG((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))),!(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))] = FALSE * [((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(p_1_0>=1))] = FALSE)
Checking (exact) 1 :[((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(p_1_0>=1))] = FALSE
Checking (exact) 0 :((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(p_1_0>=1))
Checking (exact) 1 :!(p_1_0>=1)
Checking (exact) 1 :(Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))))
Checking (exact) 1 :!((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))
Checking (exact) 1 :(((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))
Checking (exact) 1 :((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1)))))
Checking (exact) 1 :!(EX(!(!(r_0_0>=1))))
Checking (exact) 1 :EX(!(!(r_0_0>=1)))
Checking (exact) 1 :E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))
Checking (exact) 1 :[FwdG((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))),!(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))] = FALSE
Checking (exact) 0 :FwdG((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))),!(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))))
Checking (exact) 1 :(Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))))
Checking (exact) 1 :!((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))
Checking (exact) 1 :(((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))
Checking (exact) 1 :((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1)))))
Checking (exact) 1 :!(EX(!(!(r_0_0>=1))))
Checking (exact) 1 :EX(!(!(r_0_0>=1)))
Checking (exact) 1 :E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))
Checking (exact) 1 :[(FwdU(((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))),TRUE) * p_0_1>=1)] = FALSE
Checking (exact) 0 :(FwdU(((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))),TRUE) * p_0_1>=1)
Checking (exact) 1 :p_0_1>=1
Checking (exact) 1 :FwdU(((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))),TRUE)
Checking (exact) 1 :((Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))) * !(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1)))))))
Checking (exact) 1 :!(!(E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))))
Checking (exact) 1 :E(TRUE U !((((r_1_0>=1 * p_1_1>=1) * r_0_0>=1) + (p_0_0>=1 * r_0_1>=1))))
Checking (exact) 1 :(Init * !((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))))
Checking (exact) 1 :!((((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))))
Checking (exact) 1 :(((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1))))) + E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1))))
Checking (exact) 1 :((p_0_0>=1 * r_0_1>=1) + !(EX(!(!(r_0_0>=1)))))
Checking (exact) 1 :!(EX(!(!(r_0_0>=1))))
Checking (exact) 1 :EX(!(!(r_0_0>=1)))
Checking (exact) 1 :E(TRUE U ((r_0_0>=1 * p_1_0>=1) + (r_1_1>=1 * r_0_1>=1)))
(forward)formula 12,1,0.053027,4596,1,0,80,335,129,93,310,765,230
FORMULA ResAllocation-PT-R002C002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1)) + AF(EG(p_0_1>=1))) + (p_0_0>=1 * r_0_1>=1))
=> equivalent forward existential formula: [FwdG(((Init * !((p_0_0>=1 * r_0_1>=1))) * !((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1)))),!(EG(p_0_1>=1)))] = FALSE
Checking (exact) 0 :[FwdG(((Init * !((p_0_0>=1 * r_0_1>=1))) * !((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1)))),!(EG(p_0_1>=1)))] = FALSE
Checking (exact) 0 :FwdG(((Init * !((p_0_0>=1 * r_0_1>=1))) * !((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1)))),!(EG(p_0_1>=1)))
Checking (exact) 1 :((Init * !((p_0_0>=1 * r_0_1>=1))) * !((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1))))
Checking (exact) 1 :!((p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1)))
Checking (exact) 1 :(p_1_0>=1 * E(r_0_0>=1 U p_1_0>=1))
Checking (exact) 1 :E(r_0_0>=1 U p_1_0>=1)
Checking (exact) 1 :(Init * !((p_0_0>=1 * r_0_1>=1)))
Checking (exact) 1 :!(EG(p_0_1>=1))
Checking (exact) 1 :EG(p_0_1>=1)
Fast SCC detection found none.
(forward)formula 13,0,0.055913,4612,1,0,84,349,136,105,310,846,266
FORMULA ResAllocation-PT-R002C002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: p_0_1>=1
=> equivalent forward existential formula: [(Init * p_0_1>=1)] != FALSE
Checking (exact) 0 :[(Init * p_0_1>=1)] != FALSE
Checking (exact) 0 :(Init * p_0_1>=1)
(forward)formula 14,0,0.056169,4612,1,0,84,349,136,105,310,846,266
FORMULA ResAllocation-PT-R002C002-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (r_0_0>=1 + (r_1_1>=1 * r_0_1>=1))
=> equivalent forward existential formula: [(Init * (r_0_0>=1 + (r_1_1>=1 * r_0_1>=1)))] != FALSE
Checking (exact) 0 :[(Init * (r_0_0>=1 + (r_1_1>=1 * r_0_1>=1)))] != FALSE
Checking (exact) 0 :(Init * (r_0_0>=1 + (r_1_1>=1 * r_0_1>=1)))
(forward)formula 15,1,0.056821,4612,1,0,84,349,136,105,310,846,267
FORMULA ResAllocation-PT-R002C002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464505034389

--------------------
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 29, 2016 6:57:13 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2016 6:57:13 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 38 ms
May 29, 2016 6:57:13 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 8 places.
May 29, 2016 6:57:13 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 6 transitions.
May 29, 2016 6:57:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
May 29, 2016 6:57:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 14 ms
May 29, 2016 6:57:13 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="S_ResAllocation-PT-R002C002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_ResAllocation-PT-R002C002.tgz
mv S_ResAllocation-PT-R002C002 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_ResAllocation-PT-R002C002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444110700265"
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 ;