About the Execution of MARCIE for S_SwimmingPool-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7515.720 | 21244.00 | 21091.00 | 20.00 | FTFFFFTFFFFFFFTT | 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-3253
Executing tool marcie
Input is S_SwimmingPool-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454300165
=====================================================================
--------------------
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-01-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496683444903
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: SwimmingPool_PT_01
(NrP: 9 NrTr: 7 NrArc: 20)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.001sec
init dd package: 0m 3.674sec
parse successfull
net created successfully
Net: SwimmingPool_PT_01
(NrP: 9 NrTr: 7 NrArc: 20)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.001sec
init dd package: 0m 9.395sec
RS generation: 0m 0.058sec
-> reachability set: #nodes 1934 (1.9e+03) #states 89,621 (4)
starting MCC model checker
--------------------------
checking: E [EF [3<=Undress] U AG [1<=WaitBag]]
normalized: E [E [true U 3<=Undress] U ~ [E [true U ~ [1<=WaitBag]]]]
abstracting: (1<=WaitBag)
states: 62,824 (4)
abstracting: (3<=Undress)
states: 26,078 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.131sec
checking: AG [InBath<=Out]
normalized: ~ [E [true U ~ [InBath<=Out]]]
abstracting: (InBath<=Out)
states: 49,945 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: EG [Undress<=InBath]
normalized: EG [Undress<=InBath]
abstracting: (Undress<=InBath)
states: 67,675 (4)
....................................................
EG iterations: 52
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.082sec
checking: AF [E [Entered<=InBath U 1<=WaitBag]]
normalized: ~ [EG [~ [E [Entered<=InBath U 1<=WaitBag]]]]
abstracting: (1<=WaitBag)
states: 62,824 (4)
abstracting: (Entered<=InBath)
states: 46,473 (4)
.....................................................................
EG iterations: 69
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.556sec
checking: AG [[Bags<=Dress | 1<=Cabins]]
normalized: ~ [E [true U ~ [[Bags<=Dress | 1<=Cabins]]]]
abstracting: (1<=Cabins)
states: 71,403 (4)
abstracting: (Bags<=Dress)
states: 12,872 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: [AG [Cabins<=Bags] & Dress<=Dress]
normalized: [Dress<=Dress & ~ [E [true U ~ [Cabins<=Bags]]]]
abstracting: (Cabins<=Bags)
states: 80,471 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: EF [[~ [[3<=Bags | Dress<=Bags]] & 3<=WaitBag]]
normalized: E [true U [3<=WaitBag & ~ [[3<=Bags | Dress<=Bags]]]]
abstracting: (Dress<=Bags)
states: 80,715 (4)
abstracting: (3<=Bags)
states: 80,091 (4)
abstracting: (3<=WaitBag)
states: 27,622 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: EF [AG [[WaitBag<=InBath | Bags<=Entered]]]
normalized: E [true U ~ [E [true U ~ [[WaitBag<=InBath | Bags<=Entered]]]]]
abstracting: (Bags<=Entered)
states: 24,808 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.087sec
checking: E [~ [Out<=Bags] U AF [Out<=InBath]]
normalized: E [~ [Out<=Bags] U ~ [EG [~ [Out<=InBath]]]]
abstracting: (Out<=InBath)
states: 46,473 (4)
......................
EG iterations: 22
abstracting: (Out<=Bags)
states: 72,877 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.213sec
checking: ~ [AF [[[1<=Undress & Undress<=WaitBag] | [3<=WaitBag | 1<=Dress]]]]
normalized: EG [~ [[[3<=WaitBag | 1<=Dress] | [1<=Undress & Undress<=WaitBag]]]]
abstracting: (Undress<=WaitBag)
states: 53,725 (4)
abstracting: (1<=Undress)
states: 61,536 (4)
abstracting: (1<=Dress)
states: 61,536 (4)
abstracting: (3<=WaitBag)
states: 27,622 (4)
...............................................................................
EG iterations: 79
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.298sec
checking: A [[~ [1<=Dressed] | [WaitBag<=Bags | InBath<=Dressed]] U EX [1<=Dress]]
normalized: [~ [EG [~ [EX [1<=Dress]]]] & ~ [E [~ [EX [1<=Dress]] U [~ [[[WaitBag<=Bags | InBath<=Dressed] | ~ [1<=Dressed]]] & ~ [EX [1<=Dress]]]]]]
abstracting: (1<=Dress)
states: 61,536 (4)
.abstracting: (1<=Dressed)
states: 62,824 (4)
abstracting: (InBath<=Dressed)
states: 33,033 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (1<=Dress)
states: 61,536 (4)
.abstracting: (1<=Dress)
states: 61,536 (4)
.....................................................
EG iterations: 52
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.122sec
checking: [[~ [2<=Dress] & AG [~ [2<=InBath]]] | [EX [~ [3<=Out]] | AG [[InBath<=Undress | Dressed<=Out]]]]
normalized: [[~ [E [true U ~ [[InBath<=Undress | Dressed<=Out]]]] | EX [~ [3<=Out]]] | [~ [E [true U 2<=InBath]] & ~ [2<=Dress]]]
abstracting: (2<=Dress)
states: 40,872 (4)
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (3<=Out)
states: 56,749 (4)
.abstracting: (Dressed<=Out)
states: 68,579 (4)
abstracting: (InBath<=Undress)
states: 32,890 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.115sec
checking: ~ [[AF [~ [InBath<=Dressed]] | ~ [[[Dress<=Dress | Out<=Entered] | [2<=Dress | 2<=Out]]]]]
normalized: ~ [[~ [[[2<=Dress | 2<=Out] | [Dress<=Dress | Out<=Entered]]] | ~ [EG [InBath<=Dressed]]]]
abstracting: (InBath<=Dressed)
states: 33,033 (4)
..........................................
EG iterations: 42
abstracting: (Out<=Entered)
states: 47,723 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (2<=Out)
states: 67,207 (4)
abstracting: (2<=Dress)
states: 40,872 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.145sec
checking: [[3<=WaitBag | AG [Undress<=Out]] & [[~ [[1<=Entered & 3<=Dressed]] | ~ [[Bags<=Bags & WaitBag<=Bags]]] & 3<=Cabins]]
normalized: [[3<=Cabins & [~ [[Bags<=Bags & WaitBag<=Bags]] | ~ [[1<=Entered & 3<=Dressed]]]] & [3<=WaitBag | ~ [E [true U ~ [Undress<=Out]]]]]
abstracting: (Undress<=Out)
states: 69,937 (4)
abstracting: (3<=WaitBag)
states: 27,622 (4)
abstracting: (3<=Dressed)
states: 27,622 (4)
abstracting: (1<=Entered)
states: 78,211 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (Bags<=Bags)
states: 89,621 (4)
abstracting: (3<=Cabins)
states: 40,334 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.056sec
checking: [[AF [[Undress<=Dressed & Out<=Bags]] | AG [WaitBag<=Bags]] & [A [Cabins<=Out U 3<=Out] | ~ [Out<=Undress]]]
normalized: [[~ [Out<=Undress] | [~ [EG [~ [3<=Out]]] & ~ [E [~ [3<=Out] U [~ [Cabins<=Out] & ~ [3<=Out]]]]]] & [~ [E [true U ~ [WaitBag<=Bags]]] | ~ [EG [~ [[Undress<=Dressed & Out<=Bags]]]]]]
abstracting: (Out<=Bags)
states: 72,877 (4)
abstracting: (Undress<=Dressed)
states: 53,725 (4)
.............
EG iterations: 13
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (3<=Out)
states: 56,749 (4)
abstracting: (Cabins<=Out)
states: 64,932 (4)
abstracting: (3<=Out)
states: 56,749 (4)
abstracting: (3<=Out)
states: 56,749 (4)
.
EG iterations: 1
abstracting: (Out<=Undress)
states: 30,093 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.195sec
checking: [~ [[[[Cabins<=Dressed & Entered<=Out] & [1<=Cabins & Entered<=Dressed]] | [[2<=InBath | Bags<=Entered] | 2<=WaitBag]]] & ~ [[AF [1<=Dressed] & ~ [[3<=Bags & 3<=WaitBag]]]]]
normalized: [~ [[~ [[3<=Bags & 3<=WaitBag]] & ~ [EG [~ [1<=Dressed]]]]] & ~ [[[2<=WaitBag | [2<=InBath | Bags<=Entered]] | [[1<=Cabins & Entered<=Dressed] & [Cabins<=Dressed & Entered<=Out]]]]]
abstracting: (Entered<=Out)
states: 47,723 (4)
abstracting: (Cabins<=Dressed)
states: 43,351 (4)
abstracting: (Entered<=Dressed)
states: 30,932 (4)
abstracting: (1<=Cabins)
states: 71,403 (4)
abstracting: (Bags<=Entered)
states: 24,808 (4)
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (2<=WaitBag)
states: 42,528 (4)
abstracting: (1<=Dressed)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (3<=WaitBag)
states: 27,622 (4)
abstracting: (3<=Bags)
states: 80,091 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.417sec
totally nodes used: 343145 (3.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1059614 753836 1813450
used/not used/entry size/cache size: 968477 66140387 16 1024MB
basic ops cache: hits/miss/sum: 688772 496271 1185043
used/not used/entry size/cache size: 907669 15869547 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 77666 37572 115238
used/not used/entry size/cache size: 37544 8351064 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66821852
1 265911
2 13818
3 2220
4 1124
5 822
6 527
7 559
8 330
9 401
>= 10 1300
Total processing time: 0m20.994sec
BK_STOP 1496683466147
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
ok
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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
ok
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: 0m 0.005sec
iterations count:66 (9), effective:17 (2)
initing FirstDep: 0m 0.000sec
iterations count:86 (12), effective:21 (3)
iterations count:26 (3), effective:6 (0)
iterations count:28 (4), effective:7 (1)
iterations count:21 (3), effective:5 (0)
iterations count:27 (3), effective:7 (1)
iterations count:34 (4), effective:8 (1)
iterations count:67 (9), effective:19 (2)
iterations count:48 (6), effective:12 (1)
iterations count:72 (10), effective:21 (3)
iterations count:7 (1), effective:0 (0)
iterations count:31 (4), effective:7 (1)
iterations count:39 (5), effective:10 (1)
iterations count:27 (3), effective:7 (1)
iterations count:37 (5), effective:10 (1)
iterations count:26 (3), effective:6 (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="S_SwimmingPool-PT-01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-01.tgz
mv S_SwimmingPool-PT-01 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_SwimmingPool-PT-01, 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 r151-ebro-149443454300165"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;