fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r513-tall-167987241000369
Last Updated
May 14, 2023

About the Execution of Marcie for Murphy-PT-D4N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 355125.00 0.00 0.00 T??FF?????F?T?T? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r513-tall-167987241000369.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-PT-D4N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241000369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 22K Mar 26 22:42 model.pnml

--------------------
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 Murphy-PT-D4N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679895461665

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
Not applying reductions.
Model is PT
CTLCardinality PT
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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_COL_D4_N50
(NrP: 30 NrTr: 35 NrArc: 135)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.811sec


RS generation: 1m22.405sec


-> reachability set: #nodes 80010 (8.0e+04) #states 7,258,754,799,509,878,656 (18)



starting MCC model checker
--------------------------

checking: AG [EX [[50<=p3_4 | p0_2<=4]]]
normalized: ~ [E [true U ~ [EX [[50<=p3_4 | p0_2<=4]]]]]

abstracting: (p0_2<=4)
states: 1,160,947,802,707,318,656 (18)
abstracting: (50<=p3_4)
states: 0
.-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.762sec

checking: ~ [EG [EX [AF [~ [p3_4<=p0_2]]]]]
normalized: ~ [EG [EX [~ [EG [p3_4<=p0_2]]]]]

abstracting: (p3_4<=p0_2)
states: 7,136,872,953,887,932,560 (18)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.586sec

checking: EF [EX [AX [~ [E [p5_3<=23 U p3_3<=p1_3]]]]]
normalized: E [true U EX [~ [EX [E [p5_3<=23 U p3_3<=p1_3]]]]]

abstracting: (p3_3<=p1_3)
states: 7,136,872,721,328,759,984 (18)
abstracting: (p5_3<=23)
states: 7,258,754,799,509,878,656 (18)
..-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.352sec

checking: AG [EG [A [~ [[~ [p4_1<=p2_4] & ~ [p1_3<=p1_5]]] U [AF [p5_3<=34] | EG [p5_3<=40]]]]]
normalized: ~ [E [true U ~ [EG [[~ [EG [~ [[EG [p5_3<=40] | ~ [EG [~ [p5_3<=34]]]]]]] & ~ [E [~ [[EG [p5_3<=40] | ~ [EG [~ [p5_3<=34]]]]] U [[~ [p1_3<=p1_5] & ~ [p4_1<=p2_4]] & ~ [[EG [p5_3<=40] | ~ [EG [~ [p5_3<=34]]]]]]]]]]]]]

abstracting: (p5_3<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p5_3<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
abstracting: (p4_1<=p2_4)
states: 7,014,990,983,510,486,304 (18)
abstracting: (p1_3<=p1_5)
states: 3,692,200,985,370,228,384 (18)
abstracting: (p5_3<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p5_3<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
abstracting: (p5_3<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p5_3<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.530sec

checking: EF [[AG [p4_5<=p5_3] & [A [~ [EX [p1_5<=10]] U p4_3<=p4_4] & [p5_3<=47 | 2<=p0_1]]]]
normalized: E [true U [[[p5_3<=47 | 2<=p0_1] & [~ [EG [~ [p4_3<=p4_4]]] & ~ [E [~ [p4_3<=p4_4] U [EX [p1_5<=10] & ~ [p4_3<=p4_4]]]]]] & ~ [E [true U ~ [p4_5<=p5_3]]]]]

abstracting: (p4_5<=p5_3)
states: 5,645,698,177,396,572,288 (18)
abstracting: (p4_3<=p4_4)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p1_5<=10)
states: 2,337,467,135,468,718,816 (18)
.abstracting: (p4_3<=p4_4)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p4_3<=p4_4)
states: 4,839,169,866,339,919,104 (18)
.
EG iterations: 1
abstracting: (2<=p0_1)
states: 6,771,227,042,755,593,792 (18)
abstracting: (p5_3<=47)
states: 7,258,754,799,509,878,656 (18)
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 4.632sec

checking: AG [EF [[~ [AG [AX [4<=p1_1]]] | [EX [p3_2<=p1_3] | [[p3_2<=p5_4 | 38<=p3_5] & A [39<=p3_2 U 40<=p1_2]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[~ [EG [~ [40<=p1_2]]] & ~ [E [~ [40<=p1_2] U [~ [39<=p3_2] & ~ [40<=p1_2]]]]] & [p3_2<=p5_4 | 38<=p3_5]] | EX [p3_2<=p1_3]] | E [true U EX [~ [4<=p1_1]]]]]]]]

abstracting: (4<=p1_1)
states: 6,313,023,169,731,139,968 (18)
.abstracting: (p3_2<=p1_3)
states: 7,136,872,721,328,759,984 (18)
.abstracting: (38<=p3_5)
states: 0
abstracting: (p3_2<=p5_4)
states: 6,653,858,566,217,388,768 (18)
abstracting: (40<=p1_2)
states: 1,612,872,342,455,174,784 (18)
abstracting: (39<=p3_2)
states: 0
abstracting: (40<=p1_2)
states: 1,612,872,342,455,174,784 (18)
abstracting: (40<=p1_2)
states: 1,612,872,342,455,174,784 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.090sec

checking: E [AX [AG [EF [38<=p2_3]]] U E [AG [[[[p5_1<=31 & p1_4<=p3_1] & AX [25<=p5_4]] | ~ [[49<=p4_5 | p5_5<=p1_3]]]] U 6<=p3_1]]
normalized: E [~ [EX [E [true U ~ [E [true U 38<=p2_3]]]]] U E [~ [E [true U ~ [[~ [[49<=p4_5 | p5_5<=p1_3]] | [~ [EX [~ [25<=p5_4]]] & [p5_1<=31 & p1_4<=p3_1]]]]]] U 6<=p3_1]]

abstracting: (6<=p3_1)
states: 0
abstracting: (p1_4<=p3_1)
states: 365,646,234,543,356,016 (17)
abstracting: (p5_1<=31)
states: 7,258,754,799,509,878,656 (18)
abstracting: (25<=p5_4)
states: 0
.abstracting: (p5_5<=p1_3)
states: 6,895,552,313,658,660,048 (18)
abstracting: (49<=p4_5)
states: 0

BK_STOP 1679895816790

--------------------
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.001sec


iterations count:45332 (1295), effective:8976 (256)

initing FirstDep: 0m 0.000sec


iterations count:1150 (32), effective:215 (6)

iterations count:132 (3), effective:18 (0)

iterations count:57 (1), effective:6 (0)

iterations count:1183 (33), effective:250 (7)

iterations count:356 (10), effective:261 (7)

iterations count:35 (1), effective:0 (0)

iterations count:35 (1), effective:0 (0)

iterations count:50 (1), effective:4 (0)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 339 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-PT-D4N050"
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"
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-PT-D4N050, 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 r513-tall-167987241000369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N050.tgz
mv Murphy-PT-D4N050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;