About the Execution of ITS-Tools for S_SwimmingPool-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2542.320 | 339420.00 | 350021.00 | 1013.80 | FTFTFTFFFFFFFFFT | 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_SwimmingPool-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444253600580
=====================================================================
--------------------
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 SwimmingPool-PT-02-CTLFireability-0
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-1
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-15
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-2
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-3
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-4
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-5
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-6
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-7
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-8
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464979417197
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,3.40803e+06,16.0055,155124,2,19065,5,634084,6,0,46,747758,0
Converting to forward existential form...Done !
original formula: (((A(Out>=1 U Undress>=1) + (EX((Cabins>=1 * InBath>=1)) + AX((Cabins>=1 * InBath>=1)))) + (AG(!((Cabins>=1 * InBath>=1))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))) + (AG(Dressed>=1) + Dressed>=1))
=> equivalent forward existential formula: [(FwdU(((Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))) * !(Dressed>=1)),TRUE) * !(Dressed>=1))] = FALSE
Checking (exact) 0 :[(FwdU(((Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))) * !(Dressed>=1)),TRUE) * !(Dressed>=1))] = FALSE
Checking (exact) 0 :(FwdU(((Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))) * !(Dressed>=1)),TRUE) * !(Dressed>=1))
Checking (exact) 1 :!(Dressed>=1)
Checking (exact) 1 :FwdU(((Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))) * !(Dressed>=1)),TRUE)
Checking (exact) 1 :((Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))) * !(Dressed>=1))
Checking (exact) 1 :!(Dressed>=1)
Checking (exact) 1 :(Init * !(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1)))))))
Checking (exact) 1 :!(((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))))
Checking (exact) 1 :((!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))) + (!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1)))))
Checking (exact) 1 :(!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))) + (EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1))))))
Checking (exact) 1 :!((E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1))))
Checking (exact) 1 :(E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1))) + EG(!(Undress>=1)))
Checking (exact) 1 :E(!(Undress>=1) U (!(Out>=1) * !(Undress>=1)))
Hit Full ! (commute/partial/dont) 5/0/2
Checking (exact) 1 :EG(!(Undress>=1))
Fast SCC detection found none.
Checking (exact) 1 :(EX((Cabins>=1 * InBath>=1)) + !(EX(!((Cabins>=1 * InBath>=1)))))
Checking (exact) 1 :EX((Cabins>=1 * InBath>=1))
Checking (exact) 1 :!(EX(!((Cabins>=1 * InBath>=1))))
Checking (exact) 1 :EX(!((Cabins>=1 * InBath>=1)))
Checking (exact) 1 :(!(E(TRUE U !(!((Cabins>=1 * InBath>=1))))) * !((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1))))
Checking (exact) 1 :!((((WaitBag>=1 * Bags>=1) + Dress>=1) + !(Dressed>=1)))
Checking (exact) 1 :!(E(TRUE U !(!((Cabins>=1 * InBath>=1)))))
Checking (exact) 1 :E(TRUE U !(!((Cabins>=1 * InBath>=1))))
Checking (exact) 1 :Init
(forward)formula 0,0,54.2362,432680,1,0,19,2.08486e+06,44,10,482,2.28662e+06,18
FORMULA SwimmingPool-PT-02-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EX((AF(((Cabins>=1 * InBath>=1) + Dress>=1)) + Undress>=1))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(((Cabins>=1 * InBath>=1) + Dress>=1)))))] != FALSE + [(EY(Init) * Undress>=1)] != FALSE)
Checking (exact) 0 :([(EY(Init) * !(EG(!(((Cabins>=1 * InBath>=1) + Dress>=1)))))] != FALSE + [(EY(Init) * Undress>=1)] != FALSE)
Checking (exact) 0 :[(EY(Init) * !(EG(!(((Cabins>=1 * InBath>=1) + Dress>=1)))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(EG(!(((Cabins>=1 * InBath>=1) + Dress>=1)))))
Checking (exact) 1 :!(EG(!(((Cabins>=1 * InBath>=1) + Dress>=1))))
Checking (exact) 1 :EG(!(((Cabins>=1 * InBath>=1) + Dress>=1)))
Fast SCC detection found none.
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 1,1,74.3012,633716,1,0,21,2.96779e+06,52,11,487,3.02795e+06,20
FORMULA SwimmingPool-PT-02-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AF(EG((!(Dress>=1) * Undress>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(Dress>=1) * Undress>=1))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(EG((!(Dress>=1) * Undress>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(EG((!(Dress>=1) * Undress>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG((!(Dress>=1) * Undress>=1)))
Checking (exact) 1 :EG((!(Dress>=1) * Undress>=1))
Fast SCC detection found none.
(forward)formula 2,0,178.045,1448416,1,0,22,6.18481e+06,62,12,493,6.1013e+06,22
FORMULA SwimmingPool-PT-02-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((AX(EF((WaitBag>=1 * Bags>=1))) * !(AG((Dressed>=1 + (Entered>=1 * Cabins>=1))))) * EG(!(EG(Undress>=1))))
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U (WaitBag>=1 * Bags>=1))))] = FALSE * [(Init * !(E(TRUE U !((Dressed>=1 + (Entered>=1 * Cabins>=1))))))] = FALSE) * [(Init * !(EG(!(EG(Undress>=1)))))] = FALSE)
Checking (exact) 0 :(([(EY(Init) * !(E(TRUE U (WaitBag>=1 * Bags>=1))))] = FALSE * [(Init * !(E(TRUE U !((Dressed>=1 + (Entered>=1 * Cabins>=1))))))] = FALSE) * [(Init * !(EG(!(EG(Undress>=1)))))] = FALSE)
Checking (exact) 1 :[(Init * !(EG(!(EG(Undress>=1)))))] = FALSE
Checking (exact) 0 :(Init * !(EG(!(EG(Undress>=1)))))
Checking (exact) 1 :!(EG(!(EG(Undress>=1))))
Checking (exact) 1 :EG(!(EG(Undress>=1)))
Checking (exact) 1 :!(EG(Undress>=1))
Checking (exact) 1 :EG(Undress>=1)
Fast SCC detection found none.
Checking (exact) 1 :Init
(forward)formula 3,0,178.796,1454132,1,0,22,6.18495e+06,73,13,508,6.15543e+06,24
FORMULA SwimmingPool-PT-02-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(EG(AG(Out>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(E(TRUE U !(Out>=1))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EG(!(E(TRUE U !(Out>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EG(!(E(TRUE U !(Out>=1))))))
Checking (exact) 1 :!(EG(!(E(TRUE U !(Out>=1)))))
Checking (exact) 1 :EG(!(E(TRUE U !(Out>=1))))
Checking (exact) 1 :!(E(TRUE U !(Out>=1)))
Checking (exact) 1 :E(TRUE U !(Out>=1))
Fast SCC detection found none.
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 4,0,189.988,1555848,1,0,23,6.54734e+06,76,13,508,6.58645e+06,27
FORMULA SwimmingPool-PT-02-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(EX(Dress>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(Dress>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(EX(Dress>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(EX(Dress>=1)))))
Checking (exact) 1 :!(E(TRUE U !(EX(Dress>=1))))
Checking (exact) 1 :E(TRUE U !(EX(Dress>=1)))
Checking (exact) 1 :!(EX(Dress>=1))
Checking (exact) 1 :EX(Dress>=1)
(forward)formula 5,0,205.778,1628460,1,0,25,6.86692e+06,76,14,508,6.96343e+06,31
FORMULA SwimmingPool-PT-02-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG(EG(!(((WaitBag>=1 * Bags>=1) + Undress>=1))))
=> equivalent forward existential formula: [FwdG(Init,EG(!(((WaitBag>=1 * Bags>=1) + Undress>=1))))] != FALSE
Checking (exact) 0 :[FwdG(Init,EG(!(((WaitBag>=1 * Bags>=1) + Undress>=1))))] != FALSE
Checking (exact) 0 :FwdG(Init,EG(!(((WaitBag>=1 * Bags>=1) + Undress>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :EG(!(((WaitBag>=1 * Bags>=1) + Undress>=1)))
Fast SCC detection found none.
(forward)formula 6,0,206.165,1632876,1,0,26,6.88563e+06,87,14,513,6.98285e+06,32
FORMULA SwimmingPool-PT-02-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(!(((Entered>=1 * Cabins>=1) + Undress>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(((Entered>=1 * Cabins>=1) + Undress>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(!(((Entered>=1 * Cabins>=1) + Undress>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(!(((Entered>=1 * Cabins>=1) + Undress>=1))))))
Checking (exact) 1 :!(E(TRUE U !(!(((Entered>=1 * Cabins>=1) + Undress>=1)))))
Checking (exact) 1 :E(TRUE U !(!(((Entered>=1 * Cabins>=1) + Undress>=1))))
(forward)formula 7,0,206.233,1633144,1,0,27,6.8861e+06,91,14,516,6.98404e+06,35
FORMULA SwimmingPool-PT-02-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG(!((!(Out>=1) + Undress>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(Out>=1) + Undress>=1)))] != FALSE
Checking (exact) 0 :[FwdG(Init,!((!(Out>=1) + Undress>=1)))] != FALSE
Checking (exact) 0 :FwdG(Init,!((!(Out>=1) + Undress>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 3/4/4
(forward)formula 8,0,206.365,1634424,1,0,29,6.89378e+06,99,15,540,6.98988e+06,39
FORMULA SwimmingPool-PT-02-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (A((Entered>=1 * Cabins>=1) U (Dress>=1 + (WaitBag>=1 * Bags>=1))) + AG((Out>=1 + !((Out>=1 * Undress>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((Dress>=1 + (WaitBag>=1 * Bags>=1))) U (!((Entered>=1 * Cabins>=1)) * !((Dress>=1 + (WaitBag>=1 * Bags>=1))))) + EG(!((Dress>=1 + (WaitBag>=1 * Bags>=1)))))))),TRUE) * !((Out>=1 + !((Out>=1 * Undress>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(!((E(!((Dress>=1 + (WaitBag>=1 * Bags>=1))) U (!((Entered>=1 * Cabins>=1)) * !((Dress>=1 + (WaitBag>=1 * Bags>=1))))) + EG(!((Dress>=1 + (WaitBag>=1 * Bags>=1)))))))),TRUE) * !((Out>=1 + !((Out>=1 * Undress>=1)))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(!((E(!((Dress>=1 + (WaitBag>=1 * Bags>=1))) U (!((Entered>=1 * Cabins>=1)) * !((Dress>=1 + (WaitBag>=1 * Bags>=1))))) + EG(!((Dress>=1 + (WaitBag>=1 * Bags>=1)))))))),TRUE) * !((Out>=1 + !((Out>=1 * Undress>=1)))))
(forward)formula 9,1,206.405,1635212,1,0,29,6.89384e+06,104,15,546,6.98988e+06,39
FORMULA SwimmingPool-PT-02-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: ((EF((((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * A(((Cabins>=1 * InBath>=1) * Dressed>=1) U (WaitBag>=1 * Bags>=1))) + AG(E((Cabins>=1 * InBath>=1) U Out>=1)))
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))))),TRUE) * !(E((Cabins>=1 * InBath>=1) U Out>=1)))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))))),TRUE) * !(E((Cabins>=1 * InBath>=1) U Out>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))))),TRUE) * !(E((Cabins>=1 * InBath>=1) U Out>=1)))
Checking (exact) 1 :!(E((Cabins>=1 * InBath>=1) U Out>=1))
Checking (exact) 1 :E((Cabins>=1 * InBath>=1) U Out>=1)
Hit Full ! (commute/partial/dont) 3/2/4
Checking (exact) 1 :FwdU((Init * !((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))))),TRUE)
Checking (exact) 1 :(Init * !((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1))))))))
Checking (exact) 1 :!((E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))))
Checking (exact) 1 :(E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1)))) * !((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1))))))
Checking (exact) 1 :!((E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1)))))
Checking (exact) 1 :(E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1)))) + EG(!((WaitBag>=1 * Bags>=1))))
Checking (exact) 1 :E(!((WaitBag>=1 * Bags>=1)) U (!(((Cabins>=1 * InBath>=1) * Dressed>=1)) * !((WaitBag>=1 * Bags>=1))))
Hit Full ! (commute/partial/dont) 4/0/3
Checking (exact) 1 :EG(!((WaitBag>=1 * Bags>=1)))
Fast SCC detection found none.
Checking (exact) 1 :E(TRUE U (((Entered>=1 * Cabins>=1) * (WaitBag>=1 * Bags>=1)) * ((WaitBag>=1 * Bags>=1) * (Cabins>=1 * InBath>=1))))
Checking (exact) 1 :Init
(forward)formula 10,0,228.447,1823300,1,0,36,7.75751e+06,129,21,605,7.86648e+06,49
FORMULA SwimmingPool-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AF(Undress>=1)
=> equivalent forward existential formula: [FwdG(Init,!(Undress>=1))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(Undress>=1))] = FALSE
Checking (exact) 0 :FwdG(Init,!(Undress>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 5/0/2
(forward)formula 11,1,228.551,1824212,1,0,37,7.76204e+06,135,22,616,7.87047e+06,52
FORMULA SwimmingPool-PT-02-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AF((Cabins>=1 * InBath>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((Cabins>=1 * InBath>=1)))] != FALSE
Checking (exact) 0 :[FwdG(Init,!((Cabins>=1 * InBath>=1)))] != FALSE
Checking (exact) 0 :FwdG(Init,!((Cabins>=1 * InBath>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 3/0/4
(forward)formula 12,0,230.732,1833120,1,0,38,7.81885e+06,141,23,633,7.93501e+06,55
FORMULA SwimmingPool-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (A((!(Undress>=1) + (Cabins>=1 * InBath>=1)) U (Undress>=1 + (Out>=1 * Dress>=1))) + (Entered>=1 * Cabins>=1))
=> equivalent forward existential formula: ([((Init * !(EG(!((Undress>=1 + (Out>=1 * Dress>=1)))))) * !(E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1)))))))] != FALSE + [(Init * (Entered>=1 * Cabins>=1))] != FALSE)
Checking (exact) 0 :([((Init * !(EG(!((Undress>=1 + (Out>=1 * Dress>=1)))))) * !(E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1)))))))] != FALSE + [(Init * (Entered>=1 * Cabins>=1))] != FALSE)
Checking (exact) 0 :[((Init * !(EG(!((Undress>=1 + (Out>=1 * Dress>=1)))))) * !(E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!((Undress>=1 + (Out>=1 * Dress>=1)))))) * !(E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1)))))))
Checking (exact) 1 :!(E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1))))))
Checking (exact) 1 :E(!((Undress>=1 + (Out>=1 * Dress>=1))) U (!((!(Undress>=1) + (Cabins>=1 * InBath>=1))) * !((Undress>=1 + (Out>=1 * Dress>=1)))))
Checking (exact) 1 :(Init * !(EG(!((Undress>=1 + (Out>=1 * Dress>=1))))))
Checking (exact) 1 :!(EG(!((Undress>=1 + (Out>=1 * Dress>=1)))))
Checking (exact) 1 :EG(!((Undress>=1 + (Out>=1 * Dress>=1))))
Fast SCC detection found none.
Checking (exact) 1 :Init
(forward)formula 13,1,243.465,1960044,1,0,39,8.48964e+06,155,23,646,8.52049e+06,57
FORMULA SwimmingPool-PT-02-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(E(AF((Cabins>=1 * InBath>=1)) U AF(Undress>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((Cabins>=1 * InBath>=1))))) * !(EG(!(Undress>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,!(EG(!((Cabins>=1 * InBath>=1))))) * !(EG(!(Undress>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,!(EG(!((Cabins>=1 * InBath>=1))))) * !(EG(!(Undress>=1))))
Checking (exact) 1 :!(EG(!(Undress>=1)))
Checking (exact) 1 :EG(!(Undress>=1))
Fast SCC detection found none.
Checking (exact) 1 :FwdU(Init,!(EG(!((Cabins>=1 * InBath>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!((Cabins>=1 * InBath>=1))))
Checking (exact) 1 :EG(!((Cabins>=1 * InBath>=1)))
Fast SCC detection found none.
(forward)formula 14,0,327.681,2212104,1,0,39,9.6085e+06,11,23,394,9.54703e+06,2
FORMULA SwimmingPool-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: A(AX(((Entered>=1 * Cabins>=1) * Undress>=1)) U AG((Out>=1 + Undress>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((Out>=1 + Undress>=1)))))))) * !(E(!(!(E(TRUE U !((Out>=1 + Undress>=1))))) U (!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1)))))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(!(E(TRUE U !((Out>=1 + Undress>=1)))))))) * !(E(!(!(E(TRUE U !((Out>=1 + Undress>=1))))) U (!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1)))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(!(E(TRUE U !((Out>=1 + Undress>=1)))))))) * !(E(!(!(E(TRUE U !((Out>=1 + Undress>=1))))) U (!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1)))))))))
Checking (exact) 1 :!(E(!(!(E(TRUE U !((Out>=1 + Undress>=1))))) U (!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1))))))))
Checking (exact) 1 :E(!(!(E(TRUE U !((Out>=1 + Undress>=1))))) U (!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1)))))))
Checking (exact) 1 :!(!(E(TRUE U !((Out>=1 + Undress>=1)))))
Checking (exact) 1 :E(TRUE U !((Out>=1 + Undress>=1)))
Checking (exact) 1 :(!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1))))) * !(!(E(TRUE U !((Out>=1 + Undress>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !((Out>=1 + Undress>=1)))))
Checking (exact) 1 :E(TRUE U !((Out>=1 + Undress>=1)))
Checking (exact) 1 :!(!(EX(!(((Entered>=1 * Cabins>=1) * Undress>=1)))))
Checking (exact) 1 :EX(!(((Entered>=1 * Cabins>=1) * Undress>=1)))
(forward)formula 15,0,332.826,2212104,1,0,39,9.6085e+06,26,23,418,9.54703e+06,9
FORMULA SwimmingPool-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1464979756617
--------------------
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 03, 2016 6:43:41 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2016 6:43:41 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 28 ms
Jun 03, 2016 6:43:41 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 9 places.
Jun 03, 2016 6:43:42 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 7 transitions.
Jun 03, 2016 6:43:42 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 03, 2016 6:43:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 16 ms
Jun 03, 2016 6:43:42 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_SwimmingPool-PT-02"
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_SwimmingPool-PT-02.tgz
mv S_SwimmingPool-PT-02 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_SwimmingPool-PT-02, 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-146444253600580"
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 ;