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_CircadianClock-PT-000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444252300022
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464825194996


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,4.20404e+10,2.53101,45968,2,517,5,235094,6,0,75,262885,0


Converting to forward existential form...Done !
original formula: E(!((((da>=1 * a>=1) + (mr>=1 * r_cap>=1)) + ((c>=1 * r_cap>=1) + (a>=1 * dr>=1)))) U (dr_a>=1 * mr_cap>=1))
=> equivalent forward existential formula: [(FwdU(Init,!((((da>=1 * a>=1) + (mr>=1 * r_cap>=1)) + ((c>=1 * r_cap>=1) + (a>=1 * dr>=1))))) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!((((da>=1 * a>=1) + (mr>=1 * r_cap>=1)) + ((c>=1 * r_cap>=1) + (a>=1 * dr>=1))))) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((((da>=1 * a>=1) + (mr>=1 * r_cap>=1)) + ((c>=1 * r_cap>=1) + (a>=1 * dr>=1))))) * (dr_a>=1 * mr_cap>=1))
Checking (exact) 1 :(dr_a>=1 * mr_cap>=1)
Checking (exact) 1 :mr_cap>=1
Checking (exact) 1 :FwdU(Init,!((((da>=1 * a>=1) + (mr>=1 * r_cap>=1)) + ((c>=1 * r_cap>=1) + (a>=1 * dr>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 2/6/14
(forward)formula 0,0,2.57356,46048,1,0,11,235094,35,2,469,262885,5
FORMULA CircadianClock-PT-000100-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((EF(AX((dr_a>=1 * mr_cap>=1))) * !(A(a>=1 U (c>=1 * r_cap>=1)))) + AG(!(EX((da>=1 * a>=1)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))),TRUE)) * (da>=1 * a>=1))] = FALSE
Checking (exact) 0 :[(EY(FwdU((Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))),TRUE)) * (da>=1 * a>=1))] = FALSE
Checking (exact) 0 :(EY(FwdU((Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))),TRUE)) * (da>=1 * a>=1))
Checking (exact) 1 :(da>=1 * a>=1)
Checking (exact) 1 :a>=1
Checking (exact) 1 :EY(FwdU((Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))),TRUE))
Checking (exact) 1 :FwdU((Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))),TRUE)
Checking (exact) 1 :(Init * !((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1)))))))))
Checking (exact) 1 :!((E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))))
Checking (exact) 1 :(E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1))))) * !(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1)))))))
Checking (exact) 1 :!(!((E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))))
Checking (exact) 1 :(E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1)))) + EG(!((c>=1 * r_cap>=1))))
Checking (exact) 1 :E(!((c>=1 * r_cap>=1)) U (!(a>=1) * !((c>=1 * r_cap>=1))))
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :EG(!((c>=1 * r_cap>=1)))
Checking (exact) 1 :E(TRUE U !(EX(!((dr_a>=1 * mr_cap>=1)))))
Checking (exact) 1 :!(EX(!((dr_a>=1 * mr_cap>=1))))
Checking (exact) 1 :EX(!((dr_a>=1 * mr_cap>=1)))
Checking (exact) 1 :Init
(forward)formula 1,1,2.75185,46072,1,0,21,235094,55,7,1418,262885,20
FORMULA CircadianClock-PT-000100-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(EX(AG((da>=1 * ma_cap>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))
Checking (exact) 1 :!(E(TRUE U !((da>=1 * ma_cap>=1))))
Checking (exact) 1 :E(TRUE U !((da>=1 * ma_cap>=1)))
(forward)formula 2,0,2.7545,46072,1,0,22,235094,59,7,1422,262885,23
FORMULA CircadianClock-PT-000100-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(!(AX(mr>=1)) U AX(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(mr>=1))))) * !(EX(!(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!(!(EX(!(mr>=1))))) * !(EX(!(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!(!(EX(!(mr>=1))))) * !(EX(!(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1))))))
Checking (exact) 1 :!(EX(!(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1)))))
Checking (exact) 1 :EX(!(((da>=1 * a>=1) * (dr_a>=1 * a_cap>=1))))
(forward)formula 3,0,2.77032,46072,1,0,23,235094,65,7,1430,262885,25
FORMULA CircadianClock-PT-000100-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(E((a>=1 * dr>=1) U a>=1)) + E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U AG(mr>=1)))
=> equivalent forward existential formula: [(EY((Init * !(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1))))))) * !(E((a>=1 * dr>=1) U a>=1)))] = FALSE
Checking (exact) 0 :[(EY((Init * !(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1))))))) * !(E((a>=1 * dr>=1) U a>=1)))] = FALSE
Checking (exact) 0 :(EY((Init * !(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1))))))) * !(E((a>=1 * dr>=1) U a>=1)))
Checking (exact) 1 :!(E((a>=1 * dr>=1) U a>=1))
Checking (exact) 1 :E((a>=1 * dr>=1) U a>=1)
Hit Full ! (commute/partial/dont) 8/6/8
Checking (exact) 1 :EY((Init * !(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1)))))))
Checking (exact) 1 :(Init * !(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1))))))
Checking (exact) 1 :!(E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1)))))
Checking (exact) 1 :E(!(((dr_a>=1 * mr_cap>=1) + (da_a>=1 * a_cap>=1))) U !(E(TRUE U !(mr>=1))))
Checking (exact) 1 :!(E(TRUE U !(mr>=1)))
Checking (exact) 1 :E(TRUE U !(mr>=1))
Checking (exact) 1 :Init
(forward)formula 4,0,2.84769,46072,1,0,28,235094,82,10,1470,262885,33
FORMULA CircadianClock-PT-000100-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(EG(AG((da>=1 * ma_cap>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((da>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),!(E(TRUE U !((da>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(E(TRUE U !((da>=1 * ma_cap>=1)))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Checking (exact) 1 :!(E(TRUE U !((da>=1 * ma_cap>=1))))
Checking (exact) 1 :E(TRUE U !((da>=1 * ma_cap>=1)))
(forward)formula 5,0,2.84839,46072,1,0,28,235094,86,10,1471,262885,33
FORMULA CircadianClock-PT-000100-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(!(AG(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1))))))] = FALSE
Checking (exact) 0 :[(EY(Init) * !(E(TRUE U !(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1))))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(E(TRUE U !(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1))))))
Checking (exact) 1 :!(E(TRUE U !(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1)))))
Checking (exact) 1 :E(TRUE U !(((da_a>=1 * a_cap>=1) + (da>=1 * ma_cap>=1))))
(forward)formula 6,1,2.86234,46072,1,0,29,235094,88,10,1473,262885,36
FORMULA CircadianClock-PT-000100-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((a>=1 * r>=1) * c_cap>=1)
=> equivalent forward existential formula: [(Init * ((a>=1 * r>=1) * c_cap>=1))] != FALSE
Checking (exact) 0 :[(Init * ((a>=1 * r>=1) * c_cap>=1))] != FALSE
Checking (exact) 0 :(Init * ((a>=1 * r>=1) * c_cap>=1))
(forward)formula 7,0,2.86327,46072,1,0,30,235094,94,10,1478,262885,37
FORMULA CircadianClock-PT-000100-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((!(EF((a>=1 * dr>=1))) * AX((c>=1 * r_cap>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (a>=1 * dr>=1)))) * !(EX(!((c>=1 * r_cap>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(E(TRUE U (a>=1 * dr>=1)))) * !(EX(!((c>=1 * r_cap>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(E(TRUE U (a>=1 * dr>=1)))) * !(EX(!((c>=1 * r_cap>=1)))))
Checking (exact) 1 :!(EX(!((c>=1 * r_cap>=1))))
Checking (exact) 1 :EX(!((c>=1 * r_cap>=1)))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(E(TRUE U (a>=1 * dr>=1))))
Checking (exact) 1 :!(E(TRUE U (a>=1 * dr>=1)))
Checking (exact) 1 :E(TRUE U (a>=1 * dr>=1))
(forward)formula 8,0,2.86622,46072,1,0,32,235094,94,11,1478,262885,40
FORMULA CircadianClock-PT-000100-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EG((c>=1 * r_cap>=1)) * EF((((da>=1 * ma_cap>=1) * ((da>=1 * ma_cap>=1) + ma>=1)) * !((ma>=1 * a_cap>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * EG((c>=1 * r_cap>=1))),TRUE) * (((da>=1 * ma_cap>=1) * ((da>=1 * ma_cap>=1) + ma>=1)) * !((ma>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * EG((c>=1 * r_cap>=1))),TRUE) * (((da>=1 * ma_cap>=1) * ((da>=1 * ma_cap>=1) + ma>=1)) * !((ma>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :(FwdU((Init * EG((c>=1 * r_cap>=1))),TRUE) * (((da>=1 * ma_cap>=1) * ((da>=1 * ma_cap>=1) + ma>=1)) * !((ma>=1 * a_cap>=1))))
Checking (exact) 1 :(((da>=1 * ma_cap>=1) * ((da>=1 * ma_cap>=1) + ma>=1)) * !((ma>=1 * a_cap>=1)))
Checking (exact) 1 :!((ma>=1 * a_cap>=1))
Checking (exact) 1 :FwdU((Init * EG((c>=1 * r_cap>=1))),TRUE)
Checking (exact) 1 :(Init * EG((c>=1 * r_cap>=1)))
Checking (exact) 1 :EG((c>=1 * r_cap>=1))
Checking (exact) 1 :Init
(forward)formula 9,0,2.88136,46072,1,0,37,235094,109,13,1491,262885,44
FORMULA CircadianClock-PT-000100-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(E(AF((da>=1 * ma_cap>=1)) U (!(mr>=1) + (a>=1 * dr>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((da>=1 * ma_cap>=1))))) * (!(mr>=1) + (a>=1 * dr>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,!(EG(!((da>=1 * ma_cap>=1))))) * (!(mr>=1) + (a>=1 * dr>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,!(EG(!((da>=1 * ma_cap>=1))))) * (!(mr>=1) + (a>=1 * dr>=1)))
Checking (exact) 1 :(!(mr>=1) + (a>=1 * dr>=1))
Checking (exact) 1 :FwdU(Init,!(EG(!((da>=1 * ma_cap>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!((da>=1 * ma_cap>=1))))
Checking (exact) 1 :EG(!((da>=1 * ma_cap>=1)))
(forward)formula 10,0,20.7071,278000,1,0,1439,1.40862e+06,120,1421,1495,2.07966e+06,2153
FORMULA CircadianClock-PT-000100-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX((c>=1 * r_cap>=1)) + (!(EF(!(mr>=1))) * (((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EX(!((c>=1 * r_cap>=1)))))),TRUE) * !(mr>=1))] = FALSE * [((Init * !(!(EX(!((c>=1 * r_cap>=1)))))) * !((((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1))))))] = FALSE)
Checking (exact) 0 :([(FwdU((Init * !(!(EX(!((c>=1 * r_cap>=1)))))),TRUE) * !(mr>=1))] = FALSE * [((Init * !(!(EX(!((c>=1 * r_cap>=1)))))) * !((((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1))))))] = FALSE)
Checking (exact) 1 :[((Init * !(!(EX(!((c>=1 * r_cap>=1)))))) * !((((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1))))))] = FALSE
Checking (exact) 0 :((Init * !(!(EX(!((c>=1 * r_cap>=1)))))) * !((((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1))))))
Checking (exact) 1 :!((((r>=1 * (dr_a>=1 * mr_cap>=1)) * (mr>=1 * r_cap>=1)) + (((ma>=1 * a_cap>=1) * ((dr_a>=1 * a_cap>=1) + mr>=1)) + ((r>=1 * a>=1) + ((c>=1 * r_cap>=1) * ma>=1)))))
Checking (exact) 1 :(Init * !(!(EX(!((c>=1 * r_cap>=1))))))
Checking (exact) 1 :!(!(EX(!((c>=1 * r_cap>=1)))))
Checking (exact) 1 :EX(!((c>=1 * r_cap>=1)))
Checking (exact) 1 :Init
(forward)formula 11,0,20.7377,278828,1,0,1442,1.4117e+06,135,1424,1523,2.08477e+06,2154
FORMULA CircadianClock-PT-000100-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(ma>=1 U ((!(ma>=1) * (dr>=1 * mr_cap>=1)) * AF((da>=1 * a>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))) * !(E(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))) U (!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))) * !(E(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))) U (!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))) * !(E(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))) U (!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))))
Checking (exact) 1 :!(E(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))) U (!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))))))
Checking (exact) 1 :E(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))) U (!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))
Checking (exact) 1 :!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))
Checking (exact) 1 :((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))
Checking (exact) 1 :!(EG(!((da>=1 * a>=1))))
Checking (exact) 1 :EG(!((da>=1 * a>=1)))
Checking (exact) 1 :(!(ma>=1) * !(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))))
Checking (exact) 1 :!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))
Checking (exact) 1 :((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))
Checking (exact) 1 :!(EG(!((da>=1 * a>=1))))
Checking (exact) 1 :EG(!((da>=1 * a>=1)))
Checking (exact) 1 :(Init * !(EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))))))
Checking (exact) 1 :!(EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))))
Checking (exact) 1 :EG(!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))))
Checking (exact) 1 :!(((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1))))))
Checking (exact) 1 :((!(ma>=1) * (dr>=1 * mr_cap>=1)) * !(EG(!((da>=1 * a>=1)))))
Checking (exact) 1 :!(EG(!((da>=1 * a>=1))))
Checking (exact) 1 :EG(!((da>=1 * a>=1)))
Checking (exact) 1 :Init
(forward)formula 12,0,27.5964,369544,1,0,1649,1.8525e+06,152,1632,1545,2.74182e+06,2364
FORMULA CircadianClock-PT-000100-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(((!(EF((a>=1 * dr>=1))) * ((((a>=1 * dr>=1) * (da>=1 * a>=1)) * (mr>=1 * (dr_a>=1 * a_cap>=1))) + ((((a>=1 * r>=1) * c_cap>=1) + r>=1) * !(((a>=1 * r>=1) * c_cap>=1))))) + (a>=1 * dr>=1)))
=> equivalent forward existential formula: ([(FwdU((Init * !((a>=1 * dr>=1))),TRUE) * (a>=1 * dr>=1))] != FALSE + [((Init * !((a>=1 * dr>=1))) * !(((((a>=1 * dr>=1) * (da>=1 * a>=1)) * (mr>=1 * (dr_a>=1 * a_cap>=1))) + ((((a>=1 * r>=1) * c_cap>=1) + r>=1) * !(((a>=1 * r>=1) * c_cap>=1))))))] != FALSE)
Checking (exact) 0 :([(FwdU((Init * !((a>=1 * dr>=1))),TRUE) * (a>=1 * dr>=1))] != FALSE + [((Init * !((a>=1 * dr>=1))) * !(((((a>=1 * dr>=1) * (da>=1 * a>=1)) * (mr>=1 * (dr_a>=1 * a_cap>=1))) + ((((a>=1 * r>=1) * c_cap>=1) + r>=1) * !(((a>=1 * r>=1) * c_cap>=1))))))] != FALSE)
Checking (exact) 0 :[(FwdU((Init * !((a>=1 * dr>=1))),TRUE) * (a>=1 * dr>=1))] != FALSE
Checking (exact) 0 :(FwdU((Init * !((a>=1 * dr>=1))),TRUE) * (a>=1 * dr>=1))
Checking (exact) 1 :(a>=1 * dr>=1)
Checking (exact) 1 :dr>=1
Checking (exact) 1 :FwdU((Init * !((a>=1 * dr>=1))),TRUE)
Checking (exact) 1 :(Init * !((a>=1 * dr>=1)))
(forward)formula 13,1,30.1996,408668,1,0,1650,2.08133e+06,154,1634,1554,3.00031e+06,2368
FORMULA CircadianClock-PT-000100-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1)))) U !(r>=1))
=> equivalent forward existential formula: [((Init * !(EG(!(!(r>=1))))) * !(E(!(!(r>=1)) U (!(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1))))) * !(!(r>=1))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(!(r>=1))))) * !(E(!(!(r>=1)) U (!(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1))))) * !(!(r>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(!(r>=1))))) * !(E(!(!(r>=1)) U (!(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1))))) * !(!(r>=1))))))
Checking (exact) 1 :!(E(!(!(r>=1)) U (!(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1))))) * !(!(r>=1)))))
Checking (exact) 1 :E(!(!(r>=1)) U (!(!(((dr>=1 * mr_cap>=1) + ((ma>=1 * a_cap>=1) * (mr>=1 * r_cap>=1))))) * !(!(r>=1))))
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :(Init * !(EG(!(!(r>=1)))))
Checking (exact) 1 :!(EG(!(!(r>=1))))
Checking (exact) 1 :EG(!(!(r>=1)))
Checking (exact) 1 :Init
(forward)formula 14,1,30.2678,409892,1,0,1653,2.08502e+06,166,1636,1569,3.0063e+06,2373
FORMULA CircadianClock-PT-000100-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!(((AG((c>=1 * r_cap>=1)) + AF((mr>=1 * r_cap>=1))) * (!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1)))))) * a>=1)
=> equivalent forward existential formula: ([FwdG(((Init * a>=1) * !(!(E(TRUE U !((c>=1 * r_cap>=1)))))),!((mr>=1 * r_cap>=1)))] != FALSE + [((Init * a>=1) * !((!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1))))))] != FALSE)
Checking (exact) 0 :([FwdG(((Init * a>=1) * !(!(E(TRUE U !((c>=1 * r_cap>=1)))))),!((mr>=1 * r_cap>=1)))] != FALSE + [((Init * a>=1) * !((!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1))))))] != FALSE)
Checking (exact) 0 :[FwdG(((Init * a>=1) * !(!(E(TRUE U !((c>=1 * r_cap>=1)))))),!((mr>=1 * r_cap>=1)))] != FALSE
Checking (exact) 0 :FwdG(((Init * a>=1) * !(!(E(TRUE U !((c>=1 * r_cap>=1)))))),!((mr>=1 * r_cap>=1)))
Checking (exact) 1 :((Init * a>=1) * !(!(E(TRUE U !((c>=1 * r_cap>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !((c>=1 * r_cap>=1)))))
Checking (exact) 1 :E(TRUE U !((c>=1 * r_cap>=1)))
Checking (exact) 1 :(Init * a>=1)
Checking (exact) 0 :[((Init * a>=1) * !((!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1))))))] != FALSE
Checking (exact) 0 :((Init * a>=1) * !((!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1))))))
Checking (exact) 1 :!((!(((dr_a>=1 * a_cap>=1) + (a>=1 * dr>=1))) + (((da>=1 * a>=1) * r>=1) + !((a>=1 * dr>=1)))))
Checking (exact) 1 :(Init * a>=1)
(forward)formula 15,0,30.7778,415800,1,0,1657,2.10683e+06,179,1637,1583,3.03369e+06,2378
FORMULA CircadianClock-PT-000100-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1464825231375

--------------------
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
Jun 01, 2016 11:53:19 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 11:53:19 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 32 ms
Jun 01, 2016 11:53:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Jun 01, 2016 11:53:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
Jun 01, 2016 11:53:19 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 01, 2016 11:53:19 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 17 ms
Jun 01, 2016 11:53:19 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_CircadianClock-PT-000100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/fko/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_CircadianClock-PT-000100.tgz
mv S_CircadianClock-PT-000100 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_CircadianClock-PT-000100, 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 r193kn-qhx2-146444252300022"
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 ;