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 |
6194.570 | 1100517.00 | 1100009.00 | 30.90 | FTTTFFFTTTTFFTFF | 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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200113
=====================================================================
--------------------
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-ReachabilityCardinality-0
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-1
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-15
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-2
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-3
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-4
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-5
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-6
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-7
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-8
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433940942283
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=ReachabilityCardinality.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: 0m7sec
RS generation: 0m15sec
-> reachability set: #nodes 47649 (4.8e+04) #states 164,385,221 (8)
starting MCC model checker
--------------------------
checking: AG [WaitBag<=Bags]
normalized: ~ [E [true U ~ [WaitBag<=Bags]]]
abstracting: (WaitBag<=Bags) states: 155,840,993 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: EF [Out<=Entered]
normalized: E [true U Out<=Entered]
abstracting: (Out<=Entered) states: 83,660,555 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m14sec
checking: EF [~ [2<=Out]]
normalized: E [true U ~ [2<=Out]]
abstracting: (2<=Out) states: 152,737,893 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: AG [Cabins<=Cabins]
normalized: ~ [E [true U ~ [Cabins<=Cabins]]]
abstracting: (Cabins<=Cabins) states: 164,385,221 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: AG [~ [~ [[1<=InBath | Bags<=Bags]]]]
normalized: ~ [E [true U ~ [[1<=InBath | Bags<=Bags]]]]
abstracting: (Bags<=Bags) states: 164,385,221 (8)
abstracting: (1<=InBath) states: 157,733,422 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[1<=Dressed & 2<=Undress] | ~ [2<=WaitBag]] | [[3<=Out | 1<=Bags] & 2<=WaitBag]]]
normalized: ~ [E [true U ~ [[[2<=WaitBag & [3<=Out | 1<=Bags]] | [~ [2<=WaitBag] | [1<=Dressed & 2<=Undress]]]]]]
abstracting: (2<=Undress) states: 132,760,453 (8)
abstracting: (1<=Dressed) states: 148,666,161 (8)
abstracting: (2<=WaitBag) states: 134,101,702 (8)
abstracting: (1<=Bags) states: 163,485,553 (8)
abstracting: (3<=Out) states: 146,988,358 (8)
abstracting: (2<=WaitBag) states: 134,101,702 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m5sec
checking: AG [[[3<=Undress | ~ [3<=WaitBag]] | 1<=Bags]]
normalized: ~ [E [true U ~ [[1<=Bags | [3<=Undress | ~ [3<=WaitBag]]]]]]
abstracting: (3<=WaitBag) states: 120,636,453 (8)
abstracting: (3<=Undress) states: 118,857,502 (8)
abstracting: (1<=Bags) states: 163,485,553 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [Out<=WaitBag]
normalized: E [true U Out<=WaitBag]
abstracting: (Out<=WaitBag) states: 47,576,287 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m6sec
checking: AG [[WaitBag<=Out & Dressed<=Cabins]]
normalized: ~ [E [true U ~ [[WaitBag<=Out & Dressed<=Cabins]]]]
abstracting: (Dressed<=Cabins) states: 98,858,529 (7)
abstracting: (WaitBag<=Out) states: 121,879,274 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m15sec
checking: AG [[~ [Bags<=Undress] & [[WaitBag<=Bags | Undress<=Cabins] | [Cabins<=WaitBag & 3<=Out]]]]
normalized: ~ [E [true U ~ [[[[Cabins<=WaitBag & 3<=Out] | [WaitBag<=Bags | Undress<=Cabins]] & ~ [Bags<=Undress]]]]]
abstracting: (Bags<=Undress) states: 17,743,792 (7)
abstracting: (Undress<=Cabins) states: 100,425,193 (8)
abstracting: (WaitBag<=Bags) states: 155,840,993 (8)
abstracting: (3<=Out) states: 146,988,358 (8)
abstracting: (Cabins<=WaitBag) states: 72,173,486 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25sec
checking: EF [[~ [[Out<=InBath & InBath<=Entered]] & ~ [[Entered<=WaitBag | WaitBag<=Cabins]]]]
normalized: E [true U [~ [[Entered<=WaitBag | WaitBag<=Cabins]] & ~ [[Out<=InBath & InBath<=Entered]]]]
abstracting: (InBath<=Entered) states: 86,457,217 (7)
abstracting: (Out<=InBath) states: 81,289,439 (7)
abstracting: (WaitBag<=Cabins) states: 98,858,529 (7)
abstracting: (Entered<=WaitBag) states: 47,576,287 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m56sec
checking: AG [Cabins<=Cabins]
normalized: ~ [E [true U ~ [Cabins<=Cabins]]]
abstracting: (Cabins<=Cabins) states: 164,385,221 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28sec
checking: AG [[1<=Cabins | [[3<=InBath | 3<=Cabins] | [3<=Cabins & 3<=Bags]]]]
normalized: ~ [E [true U ~ [[1<=Cabins | [[3<=Cabins & 3<=Bags] | [3<=InBath | 3<=Cabins]]]]]]
abstracting: (3<=Cabins) states: 134,169,526 (8)
abstracting: (3<=InBath) states: 144,837,077 (8)
abstracting: (3<=Bags) states: 161,384,319 (8)
abstracting: (3<=Cabins) states: 134,169,526 (8)
abstracting: (1<=Cabins) states: 154,055,377 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13sec
checking: EF [[~ [[3<=Cabins | Entered<=Entered]] & 1<=Dressed]]
normalized: E [true U [1<=Dressed & ~ [[3<=Cabins | Entered<=Entered]]]]
abstracting: (Entered<=Entered) states: 164,385,221 (8)
abstracting: (3<=Cabins) states: 134,169,526 (8)
abstracting: (1<=Dressed) states: 148,666,161 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m9sec
checking: AG [~ [Out<=Entered]]
normalized: ~ [E [true U Out<=Entered]]
abstracting: (Out<=Entered) states: 83,660,555 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m32sec
checking: AG [[[~ [3<=InBath] | [3<=Dress | InBath<=InBath]] | 3<=WaitBag]]
normalized: ~ [E [true U ~ [[3<=WaitBag | [[3<=Dress | InBath<=InBath] | ~ [3<=InBath]]]]]]
abstracting: (3<=InBath) states: 144,837,077 (8)
abstracting: (InBath<=InBath) states: 164,385,221 (8)
abstracting: (3<=Dress) states: 118,857,502 (8)
abstracting: (3<=WaitBag) states: 120,636,453 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
Total processing time: 18m20sec
BK_STOP 1433942042800
--------------------
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:36 (5), effective:9 (1)
iterations count:8 (1), effective:1 (0)
iterations count:8 (1), effective:1 (0)
iterations count:62 (8), effective:18 (2)
iterations count:63 (9), effective:17 (2)
iterations count:8 (1), effective:1 (0)
iterations count:26 (3), effective:7 (1)
iterations count:39 (5), effective:11 (1)
iterations count:329 (47), effective:134 (19)
iterations count:290 (41), effective:119 (17)
iterations count:8 (1), effective:1 (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-04"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
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-143385262200113"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;