About the Execution of ITS-Tools for S_CircadianClock-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
311.660 | 5326.00 | 12406.00 | 176.20 | FTTTTTTFFFFFTFFF | normal |
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-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444252300013
=====================================================================
--------------------
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-000010-CTLFireability-0
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-1
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-15
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-2
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-3
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-4
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-5
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-6
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-7
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-8
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464825155370
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,644204,0.03742,4764,2,67,5,3794,6,0,75,3865,0
Converting to forward existential form...Done !
original formula: EF(!(EF((r>=1 + (da_a>=1 * ma_cap>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (r>=1 + (da_a>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (r>=1 + (da_a>=1 * ma_cap>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (r>=1 + (da_a>=1 * ma_cap>=1)))))
Checking (exact) 1 :!(E(TRUE U (r>=1 + (da_a>=1 * ma_cap>=1))))
Checking (exact) 1 :E(TRUE U (r>=1 + (da_a>=1 * ma_cap>=1)))
(forward)formula 0,0,0.042678,5008,1,0,6,3794,19,0,424,3865,5
FORMULA CircadianClock-PT-000010-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(EX(mr>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(mr>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(mr>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(mr>=1)))
Checking (exact) 1 :!(EX(mr>=1))
Checking (exact) 1 :EX(mr>=1)
(forward)formula 1,1,0.043138,5008,1,0,7,3794,20,0,424,3865,7
FORMULA CircadianClock-PT-000010-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(((AX((a>=1 * r>=1)) * AF(!(((a>=1 * r>=1) * c_cap>=1)))) + AG(EF((ma>=1 * a_cap>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !((!(EX(!((a>=1 * r>=1)))) * !(EG(!(!(((a>=1 * r>=1) * c_cap>=1)))))))),TRUE) * !(E(TRUE U (ma>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * !((!(EX(!((a>=1 * r>=1)))) * !(EG(!(!(((a>=1 * r>=1) * c_cap>=1)))))))),TRUE) * !(E(TRUE U (ma>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :(FwdU((Init * !((!(EX(!((a>=1 * r>=1)))) * !(EG(!(!(((a>=1 * r>=1) * c_cap>=1)))))))),TRUE) * !(E(TRUE U (ma>=1 * a_cap>=1))))
Checking (exact) 1 :!(E(TRUE U (ma>=1 * a_cap>=1)))
Checking (exact) 1 :E(TRUE U (ma>=1 * a_cap>=1))
(forward)formula 2,0,0.043967,5008,1,0,8,3794,24,0,426,3865,10
FORMULA CircadianClock-PT-000010-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(AF(r>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(r>=1)))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(r>=1)))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(r>=1)))))))
Checking (exact) 1 :!(E(TRUE U !(!(EG(!(r>=1))))))
Checking (exact) 1 :E(TRUE U !(!(EG(!(r>=1)))))
Checking (exact) 1 :!(!(EG(!(r>=1))))
Checking (exact) 1 :EG(!(r>=1))
(forward)formula 3,0,0.046007,5008,1,0,9,3794,33,0,451,3865,16
FORMULA CircadianClock-PT-000010-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (((((da_a>=1 * a_cap>=1) * EF(((a>=1 * r>=1) * c_cap>=1))) * AX((mr>=1 * (dr>=1 * mr_cap>=1)))) * !((c>=1 * r_cap>=1))) + !(EF(AX((dr_a>=1 * mr_cap>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1))))),TRUE) * !(EX(!((dr_a>=1 * mr_cap>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1))))),TRUE) * !(EX(!((dr_a>=1 * mr_cap>=1)))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1))))),TRUE) * !(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 :FwdU((Init * !(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1))))),TRUE)
Checking (exact) 1 :(Init * !(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1)))))
Checking (exact) 1 :!(((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1))))
Checking (exact) 1 :((((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))) * !((c>=1 * r_cap>=1)))
Checking (exact) 1 :!((c>=1 * r_cap>=1))
Checking (exact) 1 :(((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1))) * !(EX(!((mr>=1 * (dr>=1 * mr_cap>=1))))))
Checking (exact) 1 :!(EX(!((mr>=1 * (dr>=1 * mr_cap>=1)))))
Checking (exact) 1 :EX(!((mr>=1 * (dr>=1 * mr_cap>=1))))
Checking (exact) 1 :((da_a>=1 * a_cap>=1) * E(TRUE U ((a>=1 * r>=1) * c_cap>=1)))
Checking (exact) 1 :E(TRUE U ((a>=1 * r>=1) * c_cap>=1))
Checking (exact) 1 :Init
(forward)formula 4,0,0.071466,5196,1,0,22,5438,58,9,489,5772,27
FORMULA CircadianClock-PT-000010-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(!((((dr_a>=1 * mr_cap>=1) + (dr_a>=1 * a_cap>=1)) * ((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((dr_a>=1 * mr_cap>=1) + (dr_a>=1 * a_cap>=1)) * ((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (((dr_a>=1 * mr_cap>=1) + (dr_a>=1 * a_cap>=1)) * ((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (((dr_a>=1 * mr_cap>=1) + (dr_a>=1 * a_cap>=1)) * ((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1)))))
Checking (exact) 1 :(((dr_a>=1 * mr_cap>=1) + (dr_a>=1 * a_cap>=1)) * ((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1))))
Checking (exact) 1 :((ma>=1 * a_cap>=1) * !((dr_a>=1 * mr_cap>=1)))
Checking (exact) 1 :!((dr_a>=1 * mr_cap>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 5,0,0.074902,5456,1,0,27,5599,65,13,496,6144,29
FORMULA CircadianClock-PT-000010-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((AF(AG((dr>=1 * mr_cap>=1))) + EF((ma>=1 * !((ma>=1 * a_cap>=1))))) + ((da_a>=1 * ma_cap>=1) + A((c>=1 * r_cap>=1) U ma>=1)))
=> equivalent forward existential formula: [FwdG(((Init * !(((da_a>=1 * ma_cap>=1) + !((E(!(ma>=1) U (!((c>=1 * r_cap>=1)) * !(ma>=1))) + EG(!(ma>=1))))))) * !(E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1)))))),!(!(E(TRUE U !((dr>=1 * mr_cap>=1))))))] = FALSE
Checking (exact) 0 :[FwdG(((Init * !(((da_a>=1 * ma_cap>=1) + !((E(!(ma>=1) U (!((c>=1 * r_cap>=1)) * !(ma>=1))) + EG(!(ma>=1))))))) * !(E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1)))))),!(!(E(TRUE U !((dr>=1 * mr_cap>=1))))))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(((da_a>=1 * ma_cap>=1) + !((E(!(ma>=1) U (!((c>=1 * r_cap>=1)) * !(ma>=1))) + EG(!(ma>=1))))))) * !(E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1)))))),!(!(E(TRUE U !((dr>=1 * mr_cap>=1))))))
Checking (exact) 1 :((Init * !(((da_a>=1 * ma_cap>=1) + !((E(!(ma>=1) U (!((c>=1 * r_cap>=1)) * !(ma>=1))) + EG(!(ma>=1))))))) * !(E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1))))))
Checking (exact) 1 :!(E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1)))))
Checking (exact) 1 :E(TRUE U (ma>=1 * !((ma>=1 * a_cap>=1))))
Checking (exact) 1 :!(!(E(TRUE U !((dr>=1 * mr_cap>=1)))))
Checking (exact) 1 :E(TRUE U !((dr>=1 * mr_cap>=1)))
(forward)formula 6,1,0.080498,5628,1,0,29,6075,70,13,502,6582,35
FORMULA CircadianClock-PT-000010-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF((EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1))) * !(EX((da_a>=1 * a_cap>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1)))) * !(EX((da_a>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1)))) * !(EX((da_a>=1 * a_cap>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1)))) * !(EX((da_a>=1 * a_cap>=1))))
Checking (exact) 1 :!(EX((da_a>=1 * a_cap>=1)))
Checking (exact) 1 :EX((da_a>=1 * a_cap>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1))))
Checking (exact) 1 :EX(((da_a>=1 * a_cap>=1) * (a>=1 * dr>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 7,0,0.088165,5628,1,0,33,6805,74,16,508,7553,38
FORMULA CircadianClock-PT-000010-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((da_a>=1 * a_cap>=1) * AF(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))))
=> equivalent forward existential formula: ([(Init * !((da_a>=1 * a_cap>=1)))] = FALSE * [FwdG(Init,!(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))))] = FALSE)
Checking (exact) 0 :([(Init * !((da_a>=1 * a_cap>=1)))] = FALSE * [FwdG(Init,!(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))))] = FALSE)
Checking (exact) 1 :[FwdG(Init,!(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(E(r>=1 U ((a>=1 * r>=1) * c_cap>=1)))
Checking (exact) 1 :E(r>=1 U ((a>=1 * r>=1) * c_cap>=1))
Hit Full ! (commute/partial/dont) 12/0/4
(forward)formula 8,0,0.150035,6496,1,0,103,12250,83,87,520,15124,113
FORMULA CircadianClock-PT-000010-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: E((mr>=1 * r_cap>=1) U E(r>=1 U (dr_a>=1 * mr_cap>=1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(mr>=1 * r_cap>=1)),r>=1) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,(mr>=1 * r_cap>=1)),r>=1) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,(mr>=1 * r_cap>=1)),r>=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(FwdU(Init,(mr>=1 * r_cap>=1)),r>=1)
Checking (exact) 1 :FwdU(Init,(mr>=1 * r_cap>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9/6/7
Hit Full ! (commute/partial/dont) 12/0/4
(forward)formula 9,0,0.151717,6756,1,0,107,12251,97,89,551,15134,120
FORMULA CircadianClock-PT-000010-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (AX((dr>=1 * mr_cap>=1)) + E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1)))
=> equivalent forward existential formula: [(EY((Init * !(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1))))) * !((dr>=1 * mr_cap>=1)))] = FALSE
Checking (exact) 0 :[(EY((Init * !(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1))))) * !((dr>=1 * mr_cap>=1)))] = FALSE
Checking (exact) 0 :(EY((Init * !(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1))))) * !((dr>=1 * mr_cap>=1)))
Checking (exact) 1 :!((dr>=1 * mr_cap>=1))
Checking (exact) 1 :EY((Init * !(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1)))))
Checking (exact) 1 :(Init * !(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1))))
Checking (exact) 1 :!(E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1)))
Checking (exact) 1 :E((mr>=1 * r_cap>=1) U (da>=1 * ma_cap>=1))
Hit Full ! (commute/partial/dont) 9/6/7
Checking (exact) 1 :Init
(forward)formula 10,1,0.155699,6764,1,0,111,12626,106,92,572,15742,124
FORMULA CircadianClock-PT-000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG((!((ma>=1 * a_cap>=1)) + E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((ma>=1 * a_cap>=1)))) * !(E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(!((ma>=1 * a_cap>=1)))) * !(E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(!((ma>=1 * a_cap>=1)))) * !(E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1))))
Checking (exact) 1 :!(E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1)))
Checking (exact) 1 :E((ma>=1 * a_cap>=1) U (dr_a>=1 * a_cap>=1))
Hit Full ! (commute/partial/dont) 6/9/10
Checking (exact) 1 :(FwdU(Init,TRUE) * !(!((ma>=1 * a_cap>=1))))
Checking (exact) 1 :!(!((ma>=1 * a_cap>=1)))
Checking (exact) 1 :(ma>=1 * a_cap>=1)
Checking (exact) 1 :a_cap>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 11,1,0.161329,6772,1,0,116,13078,112,96,604,16492,129
FORMULA CircadianClock-PT-000010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AF(AF(((a>=1 * r>=1) * c_cap>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EG(!(((a>=1 * r>=1) * c_cap>=1))))))] != FALSE
Checking (exact) 0 :[FwdG(Init,!(!(EG(!(((a>=1 * r>=1) * c_cap>=1))))))] != FALSE
Checking (exact) 0 :FwdG(Init,!(!(EG(!(((a>=1 * r>=1) * c_cap>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EG(!(((a>=1 * r>=1) * c_cap>=1)))))
Checking (exact) 1 :EG(!(((a>=1 * r>=1) * c_cap>=1)))
(forward)formula 12,1,0.207763,7836,1,0,181,18283,122,165,611,24852,201
FORMULA CircadianClock-PT-000010-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AG((EG((dr_a>=1 * mr_cap>=1)) + AG((da_a>=1 * a_cap>=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG((dr_a>=1 * mr_cap>=1)))),TRUE) * !((da_a>=1 * a_cap>=1)))] != FALSE
Checking (exact) 0 :[(FwdU((FwdU(Init,TRUE) * !(EG((dr_a>=1 * mr_cap>=1)))),TRUE) * !((da_a>=1 * a_cap>=1)))] != FALSE
Checking (exact) 0 :(FwdU((FwdU(Init,TRUE) * !(EG((dr_a>=1 * mr_cap>=1)))),TRUE) * !((da_a>=1 * a_cap>=1)))
Checking (exact) 1 :!((da_a>=1 * a_cap>=1))
Checking (exact) 1 :FwdU((FwdU(Init,TRUE) * !(EG((dr_a>=1 * mr_cap>=1)))),TRUE)
Checking (exact) 1 :(FwdU(Init,TRUE) * !(EG((dr_a>=1 * mr_cap>=1))))
Checking (exact) 1 :!(EG((dr_a>=1 * mr_cap>=1)))
Checking (exact) 1 :EG((dr_a>=1 * mr_cap>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 13,1,0.21006,8104,1,0,183,18346,129,168,616,24965,204
FORMULA CircadianClock-PT-000010-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(EX((c>=1 * r_cap>=1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (c>=1 * r_cap>=1))] != FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * (c>=1 * r_cap>=1))] != FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * (c>=1 * r_cap>=1))
Checking (exact) 1 :(c>=1 * r_cap>=1)
Checking (exact) 1 :r_cap>=1
Checking (exact) 1 :EY(FwdU(Init,TRUE))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 14,1,0.210731,8104,1,0,186,18349,129,170,616,24978,207
FORMULA CircadianClock-PT-000010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E((EG((dr_a>=1 * a_cap>=1)) + (mr>=1 * r_cap>=1)) U (AF(ma>=1) * AG((dr>=1 * mr_cap>=1))))
=> equivalent forward existential formula: [((FwdU(Init,(EG((dr_a>=1 * a_cap>=1)) + (mr>=1 * r_cap>=1))) * !(EG(!(ma>=1)))) * !(E(TRUE U !((dr>=1 * mr_cap>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,(EG((dr_a>=1 * a_cap>=1)) + (mr>=1 * r_cap>=1))) * !(EG(!(ma>=1)))) * !(E(TRUE U !((dr>=1 * mr_cap>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,(EG((dr_a>=1 * a_cap>=1)) + (mr>=1 * r_cap>=1))) * !(EG(!(ma>=1)))) * !(E(TRUE U !((dr>=1 * mr_cap>=1)))))
Checking (exact) 1 :!(E(TRUE U !((dr>=1 * mr_cap>=1))))
Checking (exact) 1 :E(TRUE U !((dr>=1 * mr_cap>=1)))
(forward)formula 15,0,0.211433,8116,1,0,186,18349,129,170,616,24978,207
FORMULA CircadianClock-PT-000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1464825160696
--------------------
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:52:39 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 11:52:39 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
Jun 01, 2016 11:52:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Jun 01, 2016 11:52:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
Jun 01, 2016 11:52:39 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 48 ms
Jun 01, 2016 11:52:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 16 ms
Jun 01, 2016 11:52:39 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-000010"
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-000010.tgz
mv S_CircadianClock-PT-000010 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-000010, 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-146444252300013"
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 '
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 ;