About the Execution of Marcie for SwimmingPool-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8447.550 | 1740029.00 | 1739991.00 | 672.90 | TTTFTFTFTFFTTTTT | 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-2265
Executing tool marcie
Input is SwimmingPool-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200106
=====================================================================
--------------------
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-04-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433940928836
Model: SwimmingPool-PT-04
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 9 NrTr: 7 NrArc: 20)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m5sec
RS generation: 0m12sec
-> reachability set: #nodes 47649 (4.8e+04) #states 164,385,221 (8)
starting MCC model checker
--------------------------
checking: AF [1<=WaitBag]
normalized: ~ [EG [~ [1<=WaitBag]]]
abstracting: (1<=WaitBag) states: 148,666,161 (8)
..............................................................................................................................................................................................................................................................................................................
EG iterations: 302
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24sec
checking: [[2<=Dressed & EF [[Bags<=Out & 1<=Entered]]] | [EG [[2<=Entered | 3<=InBath]] | A [WaitBag<=Bags U 1<=InBath]]]
normalized: [[[~ [EG [~ [1<=InBath]]] & ~ [E [~ [WaitBag<=Bags] U [~ [1<=InBath] & ~ [WaitBag<=Bags]]]]] | EG [[2<=Entered | 3<=InBath]]] | [2<=Dressed & E [true U [Bags<=Out & 1<=Entered]]]]
abstracting: (1<=Entered) states: 158,538,534 (8)
abstracting: (Bags<=Out) states: 35,993,804 (7)
abstracting: (2<=Dressed) states: 134,101,702 (8)
abstracting: (3<=InBath) states: 144,837,077 (8)
abstracting: (2<=Entered) states: 152,737,893 (8)
.
EG iterations: 1
abstracting: (WaitBag<=Bags) states: 155,840,993 (8)
abstracting: (1<=InBath) states: 157,733,422 (8)
abstracting: (WaitBag<=Bags) states: 155,840,993 (8)
abstracting: (1<=InBath) states: 157,733,422 (8)
..................................................................................................................................................................................................................................................
EG iterations: 242
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m34sec
checking: [EF [Entered<=InBath] & [EF [[3<=Dressed & 2<=Undress]] & 1<=Out]]
normalized: [[1<=Out & E [true U [3<=Dressed & 2<=Undress]]] & E [true U Entered<=InBath]]
abstracting: (Entered<=InBath) states: 81,289,439 (7)
abstracting: (2<=Undress) states: 132,760,453 (8)
abstracting: (3<=Dressed) states: 120,636,453 (8)
abstracting: (1<=Out) states: 158,538,534 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m44sec
checking: [[Out<=WaitBag | ~ [3<=Undress]] & [A [2<=InBath U 1<=WaitBag] | E [Undress<=InBath U 3<=Dress]]]
normalized: [[E [Undress<=InBath U 3<=Dress] | [~ [EG [~ [1<=WaitBag]]] & ~ [E [~ [2<=InBath] U [~ [2<=InBath] & ~ [1<=WaitBag]]]]]] & [Out<=WaitBag | ~ [3<=Undress]]]
abstracting: (3<=Undress) states: 118,857,502 (8)
abstracting: (Out<=WaitBag) states: 47,576,287 (7)
abstracting: (1<=WaitBag) states: 148,666,161 (8)
abstracting: (2<=InBath) states: 151,217,374 (8)
abstracting: (2<=InBath) states: 151,217,374 (8)
abstracting: (1<=WaitBag) states: 148,666,161 (8)
..............................................................................................................................................................................................................................................................................................................
EG iterations: 302
abstracting: (3<=Dress) states: 118,857,502 (8)
abstracting: (Undress<=InBath) states: 119,940,975 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m14sec
checking: [[EF [Entered<=Dressed] & AG [Undress<=Bags]] & [[[~ [Entered<=Dress] | [Undress<=Entered & 3<=Out]] | AG [3<=Undress]] | [AX [Dressed<=Entered] | AX [2<=Dressed]]]]
normalized: [[[~ [EX [~ [2<=Dressed]]] | ~ [EX [~ [Dressed<=Entered]]]] | [~ [E [true U ~ [3<=Undress]]] | [[Undress<=Entered & 3<=Out] | ~ [Entered<=Dress]]]] & [~ [E [true U ~ [Undress<=Bags]]] & E [true U Entered<=Dressed]]]
abstracting: (Entered<=Dressed) states: 47,576,287 (7)
abstracting: (Undress<=Bags) states: 148,466,175 (8)
abstracting: (Entered<=Dress) states: 46,001,109 (7)
abstracting: (3<=Out) states: 146,988,358 (8)
abstracting: (Undress<=Entered) states: 123,687,795 (8)
abstracting: (3<=Undress) states: 118,857,502 (8)
abstracting: (Dressed<=Entered) states: 121,879,274 (8)
.abstracting: (2<=Dressed) states: 134,101,702 (8)
.-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m41sec
checking: [1<=InBath | EX [EF [Out<=Bags]]]
normalized: [1<=InBath | EX [E [true U Out<=Bags]]]
abstracting: (Out<=Bags) states: 132,361,845 (8)
.abstracting: (1<=InBath) states: 157,733,422 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m15sec
checking: [[Out<=WaitBag | EF [[1<=InBath & 3<=Dress]]] & 3<=Bags]
normalized: [3<=Bags & [Out<=WaitBag | E [true U [1<=InBath & 3<=Dress]]]]
abstracting: (3<=Dress) states: 118,857,502 (8)
abstracting: (1<=InBath) states: 157,733,422 (8)
abstracting: (Out<=WaitBag) states: 47,576,287 (7)
abstracting: (3<=Bags) states: 161,384,319 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m33sec
checking: [[3<=InBath & ~ [2<=WaitBag]] | E [~ [Bags<=WaitBag] U ~ [2<=Cabins]]]
normalized: [E [~ [Bags<=WaitBag] U ~ [2<=Cabins]] | [3<=InBath & ~ [2<=WaitBag]]]
abstracting: (2<=WaitBag) states: 134,101,702 (8)
abstracting: (3<=InBath) states: 144,837,077 (8)
abstracting: (2<=Cabins) states: 143,975,839 (8)
abstracting: (Bags<=WaitBag) states: 10,342,640 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: EG [EF [~ [3<=Cabins]]]
normalized: EG [E [true U ~ [3<=Cabins]]]
abstracting: (3<=Cabins) states: 134,169,526 (8)
EG iterations: 0
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12sec
checking: AG [AF [[2<=Dressed | 1<=InBath]]]
normalized: ~ [E [true U EG [~ [[2<=Dressed | 1<=InBath]]]]]
abstracting: (1<=InBath) states: 157,733,422 (8)
abstracting: (2<=Dressed) states: 134,101,702 (8)
..................................................................................................................................................................................................................................................
EG iterations: 242
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13sec
checking: ~ [EG [AG [3<=Cabins]]]
normalized: ~ [EG [~ [E [true U ~ [3<=Cabins]]]]]
abstracting: (3<=Cabins) states: 134,169,526 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AF [[3<=Out | 3<=Cabins]] | [~ [~ [1<=Undress]] & 3<=Out]] & EX [AG [1<=Bags]]]
normalized: [EX [~ [E [true U ~ [1<=Bags]]]] & [[1<=Undress & 3<=Out] | ~ [EG [~ [[3<=Out | 3<=Cabins]]]]]]
abstracting: (3<=Cabins) states: 134,169,526 (8)
abstracting: (3<=Out) states: 146,988,358 (8)
.
EG iterations: 1
abstracting: (3<=Out) states: 146,988,358 (8)
abstracting: (1<=Undress) states: 147,909,559 (8)
abstracting: (1<=Bags) states: 163,485,553 (8)
.-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10sec
checking: EF [Out<=InBath]
normalized: E [true U Out<=InBath]
abstracting: (Out<=InBath) states: 81,289,439 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m17sec
checking: EG [[~ [WaitBag<=Dressed] | AG [Bags<=Out]]]
normalized: EG [[~ [E [true U ~ [Bags<=Out]]] | ~ [WaitBag<=Dressed]]]
abstracting: (WaitBag<=Dressed) states: 86,270,217 (7)
abstracting: (Bags<=Out) states: 35,993,804 (7)
..........................................
EG iterations: 42
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m49sec
checking: ~ [AG [[~ [Cabins<=WaitBag] | [Cabins<=Cabins & WaitBag<=Entered]]]]
normalized: E [true U ~ [[[Cabins<=Cabins & WaitBag<=Entered] | ~ [Cabins<=WaitBag]]]]
abstracting: (Cabins<=WaitBag) states: 72,173,486 (7)
abstracting: (WaitBag<=Entered) states: 121,879,274 (8)
abstracting: (Cabins<=Cabins) states: 164,385,221 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m16sec
checking: EG [AX [~ [1<=Undress]]]
normalized: EG [~ [EX [1<=Undress]]]
abstracting: (1<=Undress) states: 147,909,559 (8)
...........................................................................................................................................................................................................................................................................................
EG iterations: 282
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m54sec
Total processing time: 28m59sec
BK_STOP 1433942668865
--------------------
content from stderr:
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m0sec
154411
iterations count:1607 (229), effective:480 (68)
initing FirstDep: 0m0sec
iterations count:48 (6), effective:12 (1)
iterations count:36 (5), effective:7 (1)
iterations count:37 (5), effective:10 (1)
iterations count:11 (1), effective:1 (0)
iterations count:45 (6), effective:12 (1)
iterations count:32 (4), effective:6 (0)
iterations count:28 (4), effective:7 (1)
iterations count:11 (1), effective:1 (0)
iterations count:8 (1), effective:1 (0)
iterations count:31 (4), effective:8 (1)
iterations count:16 (2), effective:3 (0)
iterations count:16 (2), effective:3 (0)
iterations count:16 (2), effective:3 (0)
iterations count:40 (5), effective:10 (1)
iterations count:8 (1), effective:1 (0)
iterations count:19 (2), effective:5 (0)
iterations count:35 (5), effective:8 (1)
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="SwimmingPool-PT-04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/SwimmingPool-PT-04.tgz
mv SwimmingPool-PT-04 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is SwimmingPool-PT-04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r288su-ebro-143385262200106"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;