About the Execution of Marcie for Parking-PT-104
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3974.660 | 6258.00 | 5909.00 | 110.20 | FTTFFFFFFFFTFFFT | 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-2270
Executing tool marcie
Input is Parking-PT-104, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800132
=====================================================================
--------------------
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 Parking-PT-104-CTLCardinality-0
FORMULA_NAME Parking-PT-104-CTLCardinality-1
FORMULA_NAME Parking-PT-104-CTLCardinality-10
FORMULA_NAME Parking-PT-104-CTLCardinality-11
FORMULA_NAME Parking-PT-104-CTLCardinality-12
FORMULA_NAME Parking-PT-104-CTLCardinality-13
FORMULA_NAME Parking-PT-104-CTLCardinality-14
FORMULA_NAME Parking-PT-104-CTLCardinality-15
FORMULA_NAME Parking-PT-104-CTLCardinality-2
FORMULA_NAME Parking-PT-104-CTLCardinality-3
FORMULA_NAME Parking-PT-104-CTLCardinality-4
FORMULA_NAME Parking-PT-104-CTLCardinality-5
FORMULA_NAME Parking-PT-104-CTLCardinality-6
FORMULA_NAME Parking-PT-104-CTLCardinality-7
FORMULA_NAME Parking-PT-104-CTLCardinality-8
FORMULA_NAME Parking-PT-104-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433637711046
Model: Parking-PT-104
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: 65 NrTr: 97 NrArc: 284)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 444 (4.4e+02) #states 31,745 (4)
starting MCC model checker
--------------------------
checking: [p10<=p43 & AF [EG [p16<=p43]]]
normalized: [p10<=p43 & ~ [EG [~ [EG [p16<=p43]]]]]
abstracting: (p16<=p43) states: 16,129 (4)
...........
EG iterations: 11
.....................
EG iterations: 21
abstracting: (p10<=p43) states: 16,129 (4)
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [EF [[2<=p15 & p19<=p12]]] | ~ [~ [1<=p59]]]
normalized: [1<=p59 | ~ [E [true U [2<=p15 & p19<=p12]]]]
abstracting: (p19<=p12) states: 31,361 (4)
abstracting: (2<=p15) states: 0
abstracting: (1<=p59) states: 1,024 (3)
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[[1<=p15 & p64<=p48] | ~ [1<=p29]] U EG [3<=p32]]
normalized: E [[~ [1<=p29] | [1<=p15 & p64<=p48]] U EG [3<=p32]]
abstracting: (3<=p32) states: 0
.
EG iterations: 1
abstracting: (p64<=p48) states: 29,953 (4)
abstracting: (1<=p15) states: 15,872 (4)
abstracting: (1<=p29) states: 512
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [AF [1<=p6] U AG [p19<=p18]]
normalized: [~ [EG [E [true U ~ [p19<=p18]]]] & ~ [E [EG [~ [1<=p6]] U [E [true U ~ [p19<=p18]] & EG [~ [1<=p6]]]]]]
abstracting: (1<=p6) states: 15,872 (4)
...............
EG iterations: 15
abstracting: (p19<=p18) states: 30,977 (4)
abstracting: (1<=p6) states: 15,872 (4)
...............
EG iterations: 15
abstracting: (p19<=p18) states: 30,977 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [1<=p0 & AF [~ [[p47<=p34 & p15<=p14]]]]
normalized: [1<=p0 & ~ [EG [[p47<=p34 & p15<=p14]]]]
abstracting: (p15<=p14) states: 23,809 (4)
abstracting: (p47<=p34) states: 30,721 (4)
..........................
EG iterations: 26
abstracting: (1<=p0) states: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AG [[p34<=p20 | p52<=p3]] | [p38<=p0 & 3<=p50]] & ~ [2<=p26]]
normalized: [~ [2<=p26] & [[p38<=p0 & 3<=p50] | ~ [E [true U ~ [[p34<=p20 | p52<=p3]]]]]]
abstracting: (p52<=p3) states: 31,233 (4)
abstracting: (p34<=p20) states: 30,977 (4)
abstracting: (3<=p50) states: 0
abstracting: (p38<=p0) states: 30,721 (4)
abstracting: (2<=p26) states: 0
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [A [2<=p36 U p3<=p43]]
normalized: EG [[~ [EG [~ [p3<=p43]]] & ~ [E [~ [2<=p36] U [~ [p3<=p43] & ~ [2<=p36]]]]]]
abstracting: (2<=p36) states: 0
abstracting: (p3<=p43) states: 16,129 (4)
abstracting: (2<=p36) states: 0
abstracting: (p3<=p43) states: 16,129 (4)
...........
EG iterations: 11
.
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [[~ [[p42<=p32 & 2<=p53]] & AG [p55<=p20]]]
normalized: ~ [EG [~ [[~ [[p42<=p32 & 2<=p53]] & ~ [E [true U ~ [p55<=p20]]]]]]]
abstracting: (p55<=p20) states: 30,721 (4)
abstracting: (2<=p53) states: 0
abstracting: (p42<=p32) states: 31,745 (4)
................
EG iterations: 16
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [E [p19<=p55 U 3<=p26]]
normalized: ~ [EG [~ [E [p19<=p55 U 3<=p26]]]]
abstracting: (3<=p26) states: 0
abstracting: (p19<=p55) states: 30,977 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [1<=p4 | [3<=p10 | [~ [p38<=p26] | EG [p35<=p17]]]]
normalized: [1<=p4 | [3<=p10 | [~ [p38<=p26] | EG [p35<=p17]]]]
abstracting: (p35<=p17) states: 31,233 (4)
............
EG iterations: 12
abstracting: (p38<=p26) states: 30,721 (4)
abstracting: (3<=p10) states: 0
abstracting: (1<=p4) states: 15,872 (4)
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[[~ [p63<=p45] | 3<=p12] & EX [1<=p14]]] & [AG [[p13<=p10 | p28<=p9]] | [EX [p22<=p25] & ~ [[2<=p25 | p3<=p17]]]]]
normalized: [~ [[EX [1<=p14] & [3<=p12 | ~ [p63<=p45]]]] & [~ [E [true U ~ [[p13<=p10 | p28<=p9]]]] | [~ [[2<=p25 | p3<=p17]] & EX [p22<=p25]]]]
abstracting: (p22<=p25) states: 30,721 (4)
.abstracting: (p3<=p17) states: 16,257 (4)
abstracting: (2<=p25) states: 0
abstracting: (p28<=p9) states: 31,361 (4)
abstracting: (p13<=p10) states: 23,809 (4)
abstracting: (p63<=p45) states: 22,273 (4)
abstracting: (3<=p12) states: 0
abstracting: (1<=p14) states: 15,872 (4)
.-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [EG [p62<=p2]]
normalized: ~ [EG [p62<=p2]]
abstracting: (p62<=p2) states: 28,929 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[3<=p7 & AX [p34<=p11]]]
normalized: E [true U [3<=p7 & ~ [EX [~ [p34<=p11]]]]]
abstracting: (p34<=p11) states: 31,361 (4)
.abstracting: (3<=p7) states: 0
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [AG [p64<=p31] U EG [p31<=p52]]
normalized: [~ [E [E [true U ~ [p64<=p31]] U [E [true U ~ [p64<=p31]] & ~ [EG [p31<=p52]]]]] & ~ [EG [~ [EG [p31<=p52]]]]]
abstracting: (p31<=p52) states: 30,721 (4)
.
EG iterations: 1
............
EG iterations: 12
abstracting: (p31<=p52) states: 30,721 (4)
.
EG iterations: 1
abstracting: (p64<=p31) states: 22,273 (4)
abstracting: (p64<=p31) states: 22,273 (4)
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[~ [AF [3<=p31]] & ~ [[[3<=p50 | 3<=p42] & [3<=p30 & p4<=p46]]]]]
normalized: ~ [[~ [[[3<=p30 & p4<=p46] & [3<=p50 | 3<=p42]]] & EG [~ [3<=p31]]]]
abstracting: (3<=p31) states: 0
EG iterations: 0
abstracting: (3<=p42) states: 0
abstracting: (3<=p50) states: 0
abstracting: (p4<=p46) states: 16,385 (4)
abstracting: (3<=p30) states: 0
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [[~ [3<=p55] & ~ [3<=p42]]]]
normalized: E [true U ~ [[~ [3<=p42] & ~ [3<=p55]]]]
abstracting: (3<=p55) states: 0
abstracting: (3<=p42) states: 0
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m6sec
BK_STOP 1433637717304
--------------------
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
416
iterations count:1147 (11), effective:103 (1)
initing FirstDep: 0m0sec
iterations count:864 (8), effective:56 (0)
iterations count:97 (1), effective:0 (0)
iterations count:864 (8), effective:56 (0)
iterations count:181 (1), effective:3 (0)
iterations count:888 (9), effective:55 (0)
iterations count:639 (6), effective:35 (0)
iterations count:639 (6), effective:35 (0)
iterations count:849 (8), effective:55 (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="Parking-PT-104"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/Parking-PT-104.tgz
mv Parking-PT-104 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Parking-PT-104, 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 r232su-smll-143354324800132"
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 ;