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 CircadianClock-PT-000001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013kn-qhx2-146347844700004
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463936362159


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,128,0.01696,4236,2,22,5,256,6,0,75,210,0


Converting to forward existential form...Done !
original formula: EF((((((a>=1 * dr>=1) * (da_a>=1 * ma_cap>=1)) + !(mr>=1)) * (((mr>=1 * r_cap>=1) * (dr>=1 * mr_cap>=1)) + (dr_a>=1 * mr_cap>=1))) + (da_a>=1 * a_cap>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((a>=1 * dr>=1) * (da_a>=1 * ma_cap>=1)) + !(mr>=1)) * (((mr>=1 * r_cap>=1) * (dr>=1 * mr_cap>=1)) + (dr_a>=1 * mr_cap>=1))) + (da_a>=1 * a_cap>=1)))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (((((a>=1 * dr>=1) * (da_a>=1 * ma_cap>=1)) + !(mr>=1)) * (((mr>=1 * r_cap>=1) * (dr>=1 * mr_cap>=1)) + (dr_a>=1 * mr_cap>=1))) + (da_a>=1 * a_cap>=1)))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (((((a>=1 * dr>=1) * (da_a>=1 * ma_cap>=1)) + !(mr>=1)) * (((mr>=1 * r_cap>=1) * (dr>=1 * mr_cap>=1)) + (dr_a>=1 * mr_cap>=1))) + (da_a>=1 * a_cap>=1)))
Checking (exact) 1 :(((((a>=1 * dr>=1) * (da_a>=1 * ma_cap>=1)) + !(mr>=1)) * (((mr>=1 * r_cap>=1) * (dr>=1 * mr_cap>=1)) + (dr_a>=1 * mr_cap>=1))) + (da_a>=1 * a_cap>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,1,0.020756,4496,1,0,9,256,38,2,111,210,2
FORMULA CircadianClock-PT-000001-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((AG(AX(ma>=1)) * EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))) + (!(AG((r>=1 * (da>=1 * ma_cap>=1)))) + A(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1)) U (a>=1 * (c>=1 * r_cap>=1)))))
=> equivalent forward existential formula: ([(EY(FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE)) * !(ma>=1))] = FALSE * [((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))) * !(EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))))] = FALSE)
Checking (exact) 0 :([(EY(FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE)) * !(ma>=1))] = FALSE * [((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))) * !(EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))))] = FALSE)
Checking (exact) 1 :[((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))) * !(EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))))] = FALSE
Checking (exact) 0 :((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))) * !(EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))))
Checking (exact) 1 :!(EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1)))))
Checking (exact) 1 :EG(((((a>=1 * r>=1) * c_cap>=1) * (da>=1 * a>=1)) + (mr>=1 + (da>=1 * a>=1))))
Checking (exact) 1 :(Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))))))
Checking (exact) 1 :!((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))
Checking (exact) 1 :(!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))))
Checking (exact) 1 :!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1))))))
Checking (exact) 1 :E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1))))
Checking (exact) 1 :!((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))
Checking (exact) 1 :(E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))
Checking (exact) 1 :E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1)))))
Hit Full ! (commute/partial/dont) 6/0/10
Checking (exact) 1 :EG(!((a>=1 * (c>=1 * r_cap>=1))))
Checking (exact) 1 :[(EY(FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE)) * !(ma>=1))] = FALSE
Checking (exact) 0 :(EY(FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE)) * !(ma>=1))
Checking (exact) 1 :!(ma>=1)
Checking (exact) 1 :EY(FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE))
Checking (exact) 1 :FwdU((Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))),TRUE)
Checking (exact) 1 :(Init * !((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))))))
Checking (exact) 1 :!((!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))))
Checking (exact) 1 :(!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1)))))) + !((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))))
Checking (exact) 1 :!(!(E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1))))))
Checking (exact) 1 :E(TRUE U !((r>=1 * (da>=1 * ma_cap>=1))))
Checking (exact) 1 :!((E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1))))))
Checking (exact) 1 :(E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1))))) + EG(!((a>=1 * (c>=1 * r_cap>=1)))))
Checking (exact) 1 :E(!((a>=1 * (c>=1 * r_cap>=1))) U (!(((dr_a>=1 * mr_cap>=1) * (dr>=1 * mr_cap>=1))) * !((a>=1 * (c>=1 * r_cap>=1)))))
Checking (exact) 1 :EG(!((a>=1 * (c>=1 * r_cap>=1))))
(forward)formula 1,1,0.037349,4888,1,0,17,633,90,6,438,665,17
FORMULA CircadianClock-PT-000001-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((EG((!((mr>=1 * r_cap>=1)) * !((dr_a>=1 * a_cap>=1)))) * (AF(((dr>=1 * mr_cap>=1) + (da_a>=1 * ma_cap>=1))) * ((a>=1 * r>=1) * c_cap>=1))) + (dr_a>=1 * mr_cap>=1))
=> equivalent forward existential formula: ([((Init * !((dr_a>=1 * mr_cap>=1))) * !(EG((!((mr>=1 * r_cap>=1)) * !((dr_a>=1 * a_cap>=1))))))] = FALSE * ([FwdG((Init * !((dr_a>=1 * mr_cap>=1))),!(((dr>=1 * mr_cap>=1) + (da_a>=1 * ma_cap>=1))))] = FALSE * [((Init * !((dr_a>=1 * mr_cap>=1))) * !(((a>=1 * r>=1) * c_cap>=1)))] = FALSE))
Checking (exact) 0 :([((Init * !((dr_a>=1 * mr_cap>=1))) * !(EG((!((mr>=1 * r_cap>=1)) * !((dr_a>=1 * a_cap>=1))))))] = FALSE * ([FwdG((Init * !((dr_a>=1 * mr_cap>=1))),!(((dr>=1 * mr_cap>=1) + (da_a>=1 * ma_cap>=1))))] = FALSE * [((Init * !((dr_a>=1 * mr_cap>=1))) * !(((a>=1 * r>=1) * c_cap>=1)))] = FALSE))
Checking (exact) 1 :([FwdG((Init * !((dr_a>=1 * mr_cap>=1))),!(((dr>=1 * mr_cap>=1) + (da_a>=1 * ma_cap>=1))))] = FALSE * [((Init * !((dr_a>=1 * mr_cap>=1))) * !(((a>=1 * r>=1) * c_cap>=1)))] = FALSE)
Checking (exact) 1 :[((Init * !((dr_a>=1 * mr_cap>=1))) * !(((a>=1 * r>=1) * c_cap>=1)))] = FALSE
Checking (exact) 0 :((Init * !((dr_a>=1 * mr_cap>=1))) * !(((a>=1 * r>=1) * c_cap>=1)))
Checking (exact) 1 :!(((a>=1 * r>=1) * c_cap>=1))
Checking (exact) 1 :(Init * !((dr_a>=1 * mr_cap>=1)))
(forward)formula 2,0,0.038209,4888,1,0,20,645,92,8,443,691,19
FORMULA CircadianClock-PT-000001-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((((da_a>=1 * a_cap>=1) + E((dr_a>=1 * mr_cap>=1) U a>=1)) * !(A(r>=1 U a>=1))))
=> equivalent forward existential formula: ([((Init * !((da_a>=1 * a_cap>=1))) * !(E((dr_a>=1 * mr_cap>=1) U a>=1)))] != FALSE + [((Init * !(EG(!(a>=1)))) * !(E(!(a>=1) U (!(r>=1) * !(a>=1)))))] != FALSE)
Checking (exact) 0 :([((Init * !((da_a>=1 * a_cap>=1))) * !(E((dr_a>=1 * mr_cap>=1) U a>=1)))] != FALSE + [((Init * !(EG(!(a>=1)))) * !(E(!(a>=1) U (!(r>=1) * !(a>=1)))))] != FALSE)
Checking (exact) 0 :[((Init * !((da_a>=1 * a_cap>=1))) * !(E((dr_a>=1 * mr_cap>=1) U a>=1)))] != FALSE
Checking (exact) 0 :((Init * !((da_a>=1 * a_cap>=1))) * !(E((dr_a>=1 * mr_cap>=1) U a>=1)))
Checking (exact) 1 :!(E((dr_a>=1 * mr_cap>=1) U a>=1))
Checking (exact) 1 :E((dr_a>=1 * mr_cap>=1) U a>=1)
Hit Full ! (commute/partial/dont) 11/4/5
Checking (exact) 1 :(Init * !((da_a>=1 * a_cap>=1)))
(forward)formula 3,1,0.040109,4888,1,0,23,741,99,10,470,826,24
FORMULA CircadianClock-PT-000001-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !((A((c>=1 * r_cap>=1) U ((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))) + (((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1))))
=> equivalent forward existential formula: ([(FwdU((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))) * (!((c>=1 * r_cap>=1)) * !(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))))] != FALSE + [FwdG((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))] != FALSE)
Checking (exact) 0 :([(FwdU((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))) * (!((c>=1 * r_cap>=1)) * !(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))))] != FALSE + [FwdG((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))] != FALSE)
Checking (exact) 0 :[(FwdU((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))) * (!((c>=1 * r_cap>=1)) * !(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))))] != FALSE
Checking (exact) 0 :(FwdU((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))) * (!((c>=1 * r_cap>=1)) * !(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))))
Checking (exact) 1 :(!((c>=1 * r_cap>=1)) * !(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))
Checking (exact) 1 :!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1)))
Checking (exact) 1 :FwdU((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))
Checking (exact) 1 :(Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1))))
Checking (exact) 0 :[FwdG((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))] != FALSE
Checking (exact) 0 :FwdG((Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1)))),!(((da>=1 * ma_cap>=1) + (mr>=1 * r_cap>=1))))
Checking (exact) 1 :(Init * !((((!(((a>=1 * r>=1) * c_cap>=1)) + !((dr>=1 * mr_cap>=1))) + (!((c>=1 * r_cap>=1)) + !((ma>=1 * a_cap>=1)))) + (ma>=1 * a_cap>=1))))
(forward)formula 4,0,0.044069,4888,1,0,28,778,124,12,498,895,28
FORMULA CircadianClock-PT-000001-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1)))) U EF((da>=1 * a>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (da>=1 * a>=1)))))) * !(E(!(E(TRUE U (da>=1 * a>=1))) U (!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1)))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(TRUE U (da>=1 * a>=1)))))) * !(E(!(E(TRUE U (da>=1 * a>=1))) U (!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(TRUE U (da>=1 * a>=1)))))) * !(E(!(E(TRUE U (da>=1 * a>=1))) U (!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1)))))))
Checking (exact) 1 :!(E(!(E(TRUE U (da>=1 * a>=1))) U (!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1))))))
Checking (exact) 1 :E(!(E(TRUE U (da>=1 * a>=1))) U (!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1)))))
Checking (exact) 1 :!(E(TRUE U (da>=1 * a>=1)))
Checking (exact) 1 :E(TRUE U (da>=1 * a>=1))
Checking (exact) 1 :(!(((dr_a>=1 * a_cap>=1) * (((dr_a>=1 * mr_cap>=1) * ma>=1) + (((a>=1 * r>=1) * c_cap>=1) * (c>=1 * r_cap>=1))))) * !(E(TRUE U (da>=1 * a>=1))))
Checking (exact) 1 :!(E(TRUE U (da>=1 * a>=1)))
Checking (exact) 1 :E(TRUE U (da>=1 * a>=1))
Checking (exact) 1 :(Init * !(EG(!(E(TRUE U (da>=1 * a>=1))))))
Checking (exact) 1 :!(EG(!(E(TRUE U (da>=1 * a>=1)))))
Checking (exact) 1 :EG(!(E(TRUE U (da>=1 * a>=1))))
Checking (exact) 1 :!(E(TRUE U (da>=1 * a>=1)))
Checking (exact) 1 :E(TRUE U (da>=1 * a>=1))
Fast SCC detection found none.
Checking (exact) 1 :Init
(forward)formula 5,1,0.046734,4888,1,0,29,778,139,13,513,898,31
FORMULA CircadianClock-PT-000001-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((ma>=1 * a_cap>=1) + !((AF(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))) + !(EG((dr_a>=1 * mr_cap>=1))))))
=> equivalent forward existential formula: ([(Init * (ma>=1 * a_cap>=1))] != FALSE + [FwdG((Init * !(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))))),(dr_a>=1 * mr_cap>=1))] != FALSE)
Checking (exact) 0 :([(Init * (ma>=1 * a_cap>=1))] != FALSE + [FwdG((Init * !(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))))),(dr_a>=1 * mr_cap>=1))] != FALSE)
Checking (exact) 0 :[(Init * (ma>=1 * a_cap>=1))] != FALSE
Checking (exact) 0 :(Init * (ma>=1 * a_cap>=1))
Checking (exact) 0 :[FwdG((Init * !(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))))),(dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :FwdG((Init * !(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))))),(dr_a>=1 * mr_cap>=1))
Checking (exact) 1 :(Init * !(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1)))))))
Checking (exact) 1 :!(!(EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))))
Checking (exact) 1 :EG(!(((a>=1 * dr>=1) * (ma>=1 * a_cap>=1))))
Checking (exact) 1 :Init
(forward)formula 6,0,0.048017,4888,1,0,30,786,148,14,521,907,34
FORMULA CircadianClock-PT-000001-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(E(!(r>=1) U ((a>=1 * r>=1) * c_cap>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(r>=1) U ((a>=1 * r>=1) * c_cap>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(!(r>=1) U ((a>=1 * r>=1) * c_cap>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(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)))
Checking (exact) 1 :E(!(r>=1) U ((a>=1 * r>=1) * c_cap>=1))
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 7,0,0.049531,4888,1,0,33,845,155,16,533,972,37
FORMULA CircadianClock-PT-000001-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(!((EG(ma>=1) * AF(mr>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(ma>=1)) * !(EG(!(mr>=1))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * EG(ma>=1)) * !(EG(!(mr>=1))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * EG(ma>=1)) * !(EG(!(mr>=1))))
Checking (exact) 1 :!(EG(!(mr>=1)))
Checking (exact) 1 :EG(!(mr>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * EG(ma>=1))
Checking (exact) 1 :EG(ma>=1)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 8,0,0.050735,4892,1,0,36,903,167,19,539,1034,40
FORMULA CircadianClock-PT-000001-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(EF(!(AF((ma>=1 * a_cap>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((ma>=1 * a_cap>=1)))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),!((ma>=1 * a_cap>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!((ma>=1 * a_cap>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 6/0/10
(forward)formula 9,0,0.051709,4892,1,0,37,956,173,19,556,1130,44
FORMULA CircadianClock-PT-000001-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (da>=1 * a>=1)
=> equivalent forward existential formula: [(Init * (da>=1 * a>=1))] != FALSE
Checking (exact) 0 :[(Init * (da>=1 * a>=1))] != FALSE
Checking (exact) 0 :(Init * (da>=1 * a>=1))
(forward)formula 10,0,0.05204,4892,1,0,38,963,173,19,556,1130,45
FORMULA CircadianClock-PT-000001-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG((A(((a>=1 * r>=1) * c_cap>=1) U (da_a>=1 * a_cap>=1)) * !((da_a>=1 * a_cap>=1))))
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),!((da_a>=1 * a_cap>=1))) * (!(((a>=1 * r>=1) * c_cap>=1)) * !((da_a>=1 * a_cap>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((da_a>=1 * a_cap>=1)))] = FALSE) * [(FwdU(Init,TRUE) * (da_a>=1 * a_cap>=1))] = FALSE)
Checking (exact) 0 :(([(FwdU(FwdU(Init,TRUE),!((da_a>=1 * a_cap>=1))) * (!(((a>=1 * r>=1) * c_cap>=1)) * !((da_a>=1 * a_cap>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((da_a>=1 * a_cap>=1)))] = FALSE) * [(FwdU(Init,TRUE) * (da_a>=1 * a_cap>=1))] = FALSE)
Checking (exact) 1 :[(FwdU(Init,TRUE) * (da_a>=1 * a_cap>=1))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (da_a>=1 * a_cap>=1))
Checking (exact) 1 :(da_a>=1 * a_cap>=1)
Checking (exact) 1 :a_cap>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 11,0,0.052596,4892,1,0,41,970,173,21,556,1148,47
FORMULA CircadianClock-PT-000001-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EX((!(mr>=1) * EG(a>=1))) + (E(((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1)) U ((dr>=1 * mr_cap>=1) + ma>=1)) + (((r>=1 * (mr>=1 + ma>=1)) + (((da>=1 * ma_cap>=1) + (da_a>=1 * ma_cap>=1)) + ((dr_a>=1 * a_cap>=1) + (c>=1 * r_cap>=1)))) + EG((r>=1 + ma>=1)))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(mr>=1)),a>=1)] != FALSE + ([(FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1))) * ((dr>=1 * mr_cap>=1) + ma>=1))] != FALSE + ([(Init * ((r>=1 * (mr>=1 + ma>=1)) + (((da>=1 * ma_cap>=1) + (da_a>=1 * ma_cap>=1)) + ((dr_a>=1 * a_cap>=1) + (c>=1 * r_cap>=1)))))] != FALSE + [FwdG(Init,(r>=1 + ma>=1))] != FALSE)))
Checking (exact) 0 :([FwdG((EY(Init) * !(mr>=1)),a>=1)] != FALSE + ([(FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1))) * ((dr>=1 * mr_cap>=1) + ma>=1))] != FALSE + ([(Init * ((r>=1 * (mr>=1 + ma>=1)) + (((da>=1 * ma_cap>=1) + (da_a>=1 * ma_cap>=1)) + ((dr_a>=1 * a_cap>=1) + (c>=1 * r_cap>=1)))))] != FALSE + [FwdG(Init,(r>=1 + ma>=1))] != FALSE)))
Checking (exact) 0 :[FwdG((EY(Init) * !(mr>=1)),a>=1)] != FALSE
Checking (exact) 0 :FwdG((EY(Init) * !(mr>=1)),a>=1)
Checking (exact) 1 :(EY(Init) * !(mr>=1))
Checking (exact) 1 :!(mr>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 0 :([(FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1))) * ((dr>=1 * mr_cap>=1) + ma>=1))] != FALSE + ([(Init * ((r>=1 * (mr>=1 + ma>=1)) + (((da>=1 * ma_cap>=1) + (da_a>=1 * ma_cap>=1)) + ((dr_a>=1 * a_cap>=1) + (c>=1 * r_cap>=1)))))] != FALSE + [FwdG(Init,(r>=1 + ma>=1))] != FALSE))
Checking (exact) 0 :[(FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1))) * ((dr>=1 * mr_cap>=1) + ma>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1))) * ((dr>=1 * mr_cap>=1) + ma>=1))
Checking (exact) 1 :((dr>=1 * mr_cap>=1) + ma>=1)
Checking (exact) 1 :FwdU(Init,((ma>=1 * a_cap>=1) + (dr_a>=1 * mr_cap>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 3/0/13
(forward)formula 12,1,0.054625,4892,1,0,47,1029,186,26,570,1251,53
FORMULA CircadianClock-PT-000001-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(AX(((da>=1 * ma_cap>=1) * ((mr>=1 * r_cap>=1) * (c>=1 * r_cap>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((da>=1 * ma_cap>=1) * ((mr>=1 * r_cap>=1) * (c>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :[(EY(FwdU(Init,TRUE)) * !(((da>=1 * ma_cap>=1) * ((mr>=1 * r_cap>=1) * (c>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :(EY(FwdU(Init,TRUE)) * !(((da>=1 * ma_cap>=1) * ((mr>=1 * r_cap>=1) * (c>=1 * r_cap>=1)))))
Checking (exact) 1 :!(((da>=1 * ma_cap>=1) * ((mr>=1 * r_cap>=1) * (c>=1 * r_cap>=1))))
Checking (exact) 1 :EY(FwdU(Init,TRUE))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 13,0,0.055895,4892,1,0,49,1043,191,28,578,1269,55
FORMULA CircadianClock-PT-000001-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((A(ma>=1 U r>=1) + !(a>=1)))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(r>=1)))) * !(E(!(r>=1) U (!(ma>=1) * !(r>=1)))))] != FALSE + [(FwdU(Init,TRUE) * !(a>=1))] != FALSE)
Checking (exact) 0 :([((FwdU(Init,TRUE) * !(EG(!(r>=1)))) * !(E(!(r>=1) U (!(ma>=1) * !(r>=1)))))] != FALSE + [(FwdU(Init,TRUE) * !(a>=1))] != FALSE)
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(EG(!(r>=1)))) * !(E(!(r>=1) U (!(ma>=1) * !(r>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(EG(!(r>=1)))) * !(E(!(r>=1) U (!(ma>=1) * !(r>=1)))))
Checking (exact) 1 :!(E(!(r>=1) U (!(ma>=1) * !(r>=1))))
Checking (exact) 1 :E(!(r>=1) U (!(ma>=1) * !(r>=1)))
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :(FwdU(Init,TRUE) * !(EG(!(r>=1))))
Checking (exact) 1 :!(EG(!(r>=1)))
Checking (exact) 1 :EG(!(r>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 14,1,0.057349,4892,1,0,51,1065,194,30,581,1313,59
FORMULA CircadianClock-PT-000001-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AX(((!(ma>=1) + ((da>=1 * a>=1) + (mr>=1 * r_cap>=1))) + AF(r>=1))) * A(((a>=1 + (da>=1 * a>=1)) * ((a>=1 * r>=1) * c_cap>=1)) U ((da>=1 * a>=1) * !(r>=1))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * !((!(ma>=1) + ((da>=1 * a>=1) + (mr>=1 * r_cap>=1))))),!(r>=1))] = FALSE * ([(FwdU(Init,!(((da>=1 * a>=1) * !(r>=1)))) * (!(((a>=1 + (da>=1 * a>=1)) * ((a>=1 * r>=1) * c_cap>=1))) * !(((da>=1 * a>=1) * !(r>=1)))))] = FALSE * [FwdG(Init,!(((da>=1 * a>=1) * !(r>=1))))] = FALSE))
Checking (exact) 0 :([FwdG((EY(Init) * !((!(ma>=1) + ((da>=1 * a>=1) + (mr>=1 * r_cap>=1))))),!(r>=1))] = FALSE * ([(FwdU(Init,!(((da>=1 * a>=1) * !(r>=1)))) * (!(((a>=1 + (da>=1 * a>=1)) * ((a>=1 * r>=1) * c_cap>=1))) * !(((da>=1 * a>=1) * !(r>=1)))))] = FALSE * [FwdG(Init,!(((da>=1 * a>=1) * !(r>=1))))] = FALSE))
Checking (exact) 1 :([(FwdU(Init,!(((da>=1 * a>=1) * !(r>=1)))) * (!(((a>=1 + (da>=1 * a>=1)) * ((a>=1 * r>=1) * c_cap>=1))) * !(((da>=1 * a>=1) * !(r>=1)))))] = FALSE * [FwdG(Init,!(((da>=1 * a>=1) * !(r>=1))))] = FALSE)
Checking (exact) 1 :[FwdG(Init,!(((da>=1 * a>=1) * !(r>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(((da>=1 * a>=1) * !(r>=1))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 5/0/11
(forward)formula 15,0,0.062726,4896,1,0,52,1787,203,31,601,2285,63
FORMULA CircadianClock-PT-000001-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1463936367700

--------------------
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 22, 2016 4:59:26 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 22, 2016 4:59:26 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 30 ms
May 22, 2016 4:59:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
May 22, 2016 4:59:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
May 22, 2016 4:59:27 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 45 ms
May 22, 2016 4:59:27 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 14 ms
May 22, 2016 4:59:27 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="CircadianClock-PT-000001"
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/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 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 CircadianClock-PT-000001, 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 r013kn-qhx2-146347844700004"
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 ;