About the Execution of Marcie for SwimmingPool-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4831.880 | 337883.00 | 337957.00 | 214.00 | FFTTFTTFFFFTFTTT | 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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200093
=====================================================================
--------------------
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-03-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433940905632
Model: SwimmingPool-PT-03
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: 0m6sec
RS generation: 0m4sec
-> reachability set: #nodes 21864 (2.2e+04) #states 32,209,356 (7)
starting MCC model checker
--------------------------
checking: [Dress<=Cabins & AG [[[3<=WaitBag | WaitBag<=Out] & 3<=Out]]]
normalized: [Dress<=Cabins & ~ [E [true U ~ [[3<=Out & [3<=WaitBag | WaitBag<=Out]]]]]]
abstracting: (WaitBag<=Out) states: 23,975,868 (7)
abstracting: (3<=WaitBag) states: 21,379,036 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (Dress<=Cabins) states: 19,905,168 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25sec
checking: [2<=Entered | AG [[[Out<=InBath & 2<=Entered] | Cabins<=Out]]]
normalized: [2<=Entered | ~ [E [true U ~ [[Cabins<=Out | [Out<=InBath & 2<=Entered]]]]]]
abstracting: (2<=Entered) states: 29,210,216 (7)
abstracting: (Out<=InBath) states: 16,018,692 (7)
abstracting: (Cabins<=Out) states: 22,723,424 (7)
abstracting: (2<=Entered) states: 29,210,216 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m58sec
checking: A [~ [Cabins<=Dress] U EG [WaitBag<=Undress]]
normalized: [~ [EG [~ [EG [WaitBag<=Undress]]]] & ~ [E [Cabins<=Dress U [Cabins<=Dress & ~ [EG [WaitBag<=Undress]]]]]]
abstracting: (WaitBag<=Undress) states: 16,886,916 (7)
....................................................................................................................................................................................................................
EG iterations: 212
abstracting: (Cabins<=Dress) states: 14,034,660 (7)
abstracting: (Cabins<=Dress) states: 14,034,660 (7)
abstracting: (WaitBag<=Undress) states: 16,886,916 (7)
....................................................................................................................................................................................................................
EG iterations: 212
.
EG iterations: 1
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11sec
checking: [[~ [AF [1<=InBath]] | Cabins<=Undress] & ~ [EX [~ [1<=Out]]]]
normalized: [~ [EX [~ [1<=Out]]] & [Cabins<=Undress | EG [~ [1<=InBath]]]]
abstracting: (1<=InBath) states: 30,493,444 (7)
......................................................................................................................................................................................
EG iterations: 182
abstracting: (Cabins<=Undress) states: 14,034,660 (7)
abstracting: (1<=Out) states: 30,701,728 (7)
.-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: AF [AG [[WaitBag<=InBath | Entered<=Cabins]]]
normalized: ~ [EG [E [true U ~ [[WaitBag<=InBath | Entered<=Cabins]]]]]
abstracting: (Entered<=Cabins) states: 10,854,432 (7)
abstracting: (WaitBag<=InBath) states: 23,583,420 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15sec
checking: [[EF [Bags<=Dressed] & [EF [Cabins<=Undress] | AX [Out<=WaitBag]]] & EF [[Dress<=Dressed | ~ [3<=Undress]]]]
normalized: [E [true U [Dress<=Dressed | ~ [3<=Undress]]] & [[~ [EX [~ [Out<=WaitBag]]] | E [true U Cabins<=Undress]] & E [true U Bags<=Dressed]]]
abstracting: (Bags<=Dressed) states: 2,139,144 (6)
abstracting: (Cabins<=Undress) states: 14,034,660 (7)
abstracting: (Out<=WaitBag) states: 9,540,770 (6)
.abstracting: (3<=Undress) states: 20,961,829 (7)
abstracting: (Dress<=Dressed) states: 17,494,428 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43sec
checking: AG [AX [[2<=WaitBag | 3<=Bags]]]
normalized: ~ [E [true U EX [~ [[2<=WaitBag | 3<=Bags]]]]]
abstracting: (3<=Bags) states: 31,381,878 (7)
abstracting: (2<=WaitBag) states: 24,624,004 (7)
.-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: ~ [EG [[[1<=Bags & 2<=Cabins] & [2<=InBath | WaitBag<=Dress]]]]
normalized: ~ [EG [[[1<=Bags & 2<=Cabins] & [2<=InBath | WaitBag<=Dress]]]]
abstracting: (WaitBag<=Dress) states: 16,886,916 (7)
abstracting: (2<=InBath) states: 28,823,908 (7)
abstracting: (2<=Cabins) states: 27,036,688 (7)
abstracting: (1<=Bags) states: 31,968,636 (7)
..........................................................................................
EG iterations: 90
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: ~ [AG [EG [3<=Bags]]]
normalized: E [true U ~ [EG [3<=Bags]]]
abstracting: (3<=Bags) states: 31,381,878 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: ~ [[[WaitBag<=Undress & AG [3<=Out]] & [Cabins<=InBath | [3<=Out | 1<=Cabins]]]]
normalized: ~ [[[Cabins<=InBath | [3<=Out | 1<=Cabins]] & [WaitBag<=Undress & ~ [E [true U ~ [3<=Out]]]]]]
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (WaitBag<=Undress) states: 16,886,916 (7)
abstracting: (1<=Cabins) states: 29,580,904 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (Cabins<=InBath) states: 21,960,260 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: E [~ [[2<=Cabins & 2<=Entered]] U 3<=Entered]
normalized: E [~ [[2<=Cabins & 2<=Entered]] U 3<=Entered]
abstracting: (3<=Entered) states: 27,737,115 (7)
abstracting: (2<=Entered) states: 29,210,216 (7)
abstracting: (2<=Cabins) states: 27,036,688 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: ~ [AG [Dress<=Cabins]]
normalized: E [true U ~ [Dress<=Cabins]]
abstracting: (Dress<=Cabins) states: 19,905,168 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: AG [EG [WaitBag<=Out]]
normalized: ~ [E [true U ~ [EG [WaitBag<=Out]]]]
abstracting: (WaitBag<=Out) states: 23,975,868 (7)
..
EG iterations: 2
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27sec
checking: [[AX [[Cabins<=Out | Undress<=Dressed]] & ~ [AG [Entered<=Cabins]]] | Bags<=WaitBag]
normalized: [Bags<=WaitBag | [E [true U ~ [Entered<=Cabins]] & ~ [EX [~ [[Cabins<=Out | Undress<=Dressed]]]]]]
abstracting: (Undress<=Dressed) states: 17,494,428 (7)
abstracting: (Cabins<=Out) states: 22,723,424 (7)
.abstracting: (Entered<=Cabins) states: 10,854,432 (7)
abstracting: (Bags<=WaitBag) states: 2,139,144 (6)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m54sec
checking: [Dressed<=Out & [[[1<=Dressed & [2<=Dress & Out<=WaitBag]] | [~ [1<=Undress] | InBath<=Cabins]] & ~ [EG [WaitBag<=Dress]]]]
normalized: [Dressed<=Out & [~ [EG [WaitBag<=Dress]] & [[InBath<=Cabins | ~ [1<=Undress]] | [1<=Dressed & [2<=Dress & Out<=WaitBag]]]]]
abstracting: (Out<=WaitBag) states: 9,540,770 (6)
abstracting: (2<=Dress) states: 24,296,536 (7)
abstracting: (1<=Dressed) states: 28,226,092 (7)
abstracting: (1<=Undress) states: 28,034,128 (7)
abstracting: (InBath<=Cabins) states: 11,686,752 (7)
abstracting: (WaitBag<=Dress) states: 16,886,916 (7)
............................................................................................
EG iterations: 92
abstracting: (Dressed<=Out) states: 23,975,868 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-03-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m57sec
checking: AG [1<=Cabins]
normalized: ~ [E [true U ~ [1<=Cabins]]]
abstracting: (1<=Cabins) states: 29,580,904 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
Total processing time: 5m37sec
BK_STOP 1433941243515
--------------------
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
58610
iterations count:1207 (172), effective:360 (51)
initing FirstDep: 0m0sec
iterations count:8 (1), effective:1 (0)
iterations count:134 (19), effective:52 (7)
iterations count:74 (10), effective:27 (3)
iterations count:148 (21), effective:58 (8)
iterations count:38 (5), effective:9 (1)
iterations count:16 (2), effective:3 (0)
iterations count:10 (1), effective:1 (0)
iterations count:163 (23), effective:59 (8)
iterations count:40 (5), effective:10 (1)
iterations count:8 (1), effective:1 (0)
iterations count:244 (34), effective:72 (10)
iterations count:35 (5), effective:9 (1)
iterations count:26 (3), effective:8 (1)
iterations count:25 (3), effective:7 (1)
iterations count:16 (2), effective:3 (0)
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-03"
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-03.tgz
mv SwimmingPool-PT-03 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-03, 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-143385262200093"
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 ;