About the Execution of Marcie for Murphy-COL-D2N100
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r513-tall-167987240900301.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Murphy-COL-D2N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240900301
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-00
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-01
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-02
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-03
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-04
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-05
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-06
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-07
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-08
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-09
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-10
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-11
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-12
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-13
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-14
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1680937620545
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D2N100
Not applying reductions.
Model is COL
UpperBounds COL
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Unfolding complete |P|=18|T|=21|A|=81
Time for unfolding: 0m 0.437sec
Net: Murphy_COL_D2N100
(NrP: 18 NrTr: 21 NrArc: 81)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.926sec
RS generation: 0m23.824sec
-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)
starting MCC model checker
--------------------------
checking: place_bound(p0_c0,p0_c1,p0_c2)
normalized: place_bound(p0_c0,p0_c1,p0_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-00 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p5_c0,p5_c1,p5_c2)
normalized: place_bound(p5_c0,p5_c1,p5_c2)
-> the formula is 9
FORMULA Murphy-COL-D2N100-UpperBounds-01 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p2_c0,p2_c1,p2_c2)
normalized: place_bound(p2_c0,p2_c1,p2_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-02 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p3_c0,p3_c1,p3_c2)
normalized: place_bound(p3_c0,p3_c1,p3_c2)
-> the formula is 3
FORMULA Murphy-COL-D2N100-UpperBounds-03 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p0_c0,p0_c1,p0_c2)
normalized: place_bound(p0_c0,p0_c1,p0_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-04 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p3_c0,p3_c1,p3_c2)
normalized: place_bound(p3_c0,p3_c1,p3_c2)
-> the formula is 3
FORMULA Murphy-COL-D2N100-UpperBounds-05 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p0_c0,p0_c1,p0_c2)
normalized: place_bound(p0_c0,p0_c1,p0_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-06 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p3_c0,p3_c1,p3_c2)
normalized: place_bound(p3_c0,p3_c1,p3_c2)
-> the formula is 3
FORMULA Murphy-COL-D2N100-UpperBounds-07 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p3_c0,p3_c1,p3_c2)
normalized: place_bound(p3_c0,p3_c1,p3_c2)
-> the formula is 3
FORMULA Murphy-COL-D2N100-UpperBounds-08 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p1_c0,p1_c1,p1_c2)
normalized: place_bound(p1_c0,p1_c1,p1_c2)
-> the formula is 301
FORMULA Murphy-COL-D2N100-UpperBounds-09 301 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p0_c0,p0_c1,p0_c2)
normalized: place_bound(p0_c0,p0_c1,p0_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-10 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p1_c0,p1_c1,p1_c2)
normalized: place_bound(p1_c0,p1_c1,p1_c2)
-> the formula is 301
FORMULA Murphy-COL-D2N100-UpperBounds-11 301 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p5_c0,p5_c1,p5_c2)
normalized: place_bound(p5_c0,p5_c1,p5_c2)
-> the formula is 9
FORMULA Murphy-COL-D2N100-UpperBounds-12 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p0_c0,p0_c1,p0_c2)
normalized: place_bound(p0_c0,p0_c1,p0_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-13 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p2_c0,p2_c1,p2_c2)
normalized: place_bound(p2_c0,p2_c1,p2_c2)
-> the formula is 303
FORMULA Murphy-COL-D2N100-UpperBounds-14 303 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p5_c0,p5_c1,p5_c2)
normalized: place_bound(p5_c0,p5_c1,p5_c2)
-> the formula is 9
FORMULA Murphy-COL-D2N100-UpperBounds-15 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 957167 (9.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 216310976 6443604 222754580
used/not used/entry size/cache size: 6883594 60225270 16 1024MB
basic ops cache: hits/miss/sum: 936387 80102 1016489
used/not used/entry size/cache size: 127816 16649400 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: 237238 53357 290595
used/not used/entry size/cache size: 53106 8335502 32 256MB
max state cache: hits/miss/sum: 1186190 266785 1452975
used/not used/entry size/cache size: 53106 8335502 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66272171
1 751733
2 59998
3 14780
4 9844
5 333
6 3
7 2
8 0
9 0
>= 10 0
Total processing time: 0m29.475sec
BK_STOP 1680937650072
--------------------
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
initing FirstDep: 0m 0.000sec
iterations count:14959 (712), effective:3586 (170)
initing FirstDep: 0m 0.001sec
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="Murphy-COL-D2N100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is Murphy-COL-D2N100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987240900301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N100.tgz
mv Murphy-COL-D2N100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;