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

About the Execution of Marcie for PGCD-PT-D04N025

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 724834.00 0.00 0.00 FFF?F??TF??TT?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-167987241100465.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 PGCD-PT-D04N025, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241100465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 23 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 23 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:25 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 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K 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 PGCD-PT-D04N025-CTLCardinality-00
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-01
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-02
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-03
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-04
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-05
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-06
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-07
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-08
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-09
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-10
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-11
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-12
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-13
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-14
FORMULA_NAME PGCD-PT-D04N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679896724271

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=PGCD-PT-D04N025
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: PGCD_COL_D4_N25
(NrP: 15 NrTr: 15 NrArc: 70)

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

net check time: 0m 0.000sec

init dd package: 0m 2.824sec


RS generation: 0m 5.661sec


-> reachability set: #nodes 20489 (2.0e+04) #states 2,573,637,642,576 (12)



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

checking: AX [AG [p0_4<=17]]
normalized: ~ [EX [E [true U ~ [p0_4<=17]]]]

abstracting: (p0_4<=17)
states: 1,862,933,199,101 (12)
.-> the formula is FALSE

FORMULA PGCD-PT-D04N025-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.982sec

checking: AG [EF [~ [p1_2<=p2_4]]]
normalized: ~ [E [true U ~ [E [true U ~ [p1_2<=p2_4]]]]]

abstracting: (p1_2<=p2_4)
states: 1,329,771,391,728 (12)
-> the formula is FALSE

FORMULA PGCD-PT-D04N025-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.787sec

checking: E [~ [p1_3<=2] U 25<=p0_5]
normalized: E [~ [p1_3<=2] U 25<=p0_5]

abstracting: (25<=p0_5)
states: 406,920,639,972 (11)
abstracting: (p1_3<=2)
states: 475,286,114,992 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D04N025-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.885sec

checking: EF [[AG [AX [EX [16<=p2_4]]] & p0_1<=5]]
normalized: E [true U [p0_1<=5 & ~ [E [true U EX [~ [EX [16<=p2_4]]]]]]]

abstracting: (16<=p2_4)
states: 827,705,343,965 (11)
..abstracting: (p0_1<=5)
states: 863,672,070,976 (11)
-> the formula is TRUE

FORMULA PGCD-PT-D04N025-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.143sec

checking: AG [AF [E [7<=p2_1 U AG [EF [p2_3<=p2_1]]]]]
normalized: ~ [E [true U EG [~ [E [7<=p2_1 U ~ [E [true U ~ [E [true U p2_3<=p2_1]]]]]]]]]

abstracting: (p2_3<=p2_1)
states: 1,329,767,378,368 (12)
abstracting: (7<=p2_1)
states: 1,590,894,329,024 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D04N025-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.657sec

checking: AG [~ [[p2_3<=p0_4 & A [AX [E [p0_5<=3 U 22<=p1_3]] U 13<=p2_1]]]]
normalized: ~ [E [true U [p2_3<=p0_4 & [~ [EG [~ [13<=p2_1]]] & ~ [E [~ [13<=p2_1] U [EX [~ [E [p0_5<=3 U 22<=p1_3]]] & ~ [13<=p2_1]]]]]]]]

abstracting: (13<=p2_1)
states: 1,032,889,512,926 (12)
abstracting: (22<=p1_3)
states: 519,824,427,870 (11)
abstracting: (p0_5<=3)
states: 609,941,176,416 (11)
.abstracting: (13<=p2_1)
states: 1,032,889,512,926 (12)
abstracting: (13<=p2_1)
states: 1,032,889,512,926 (12)
.
EG iterations: 1
abstracting: (p2_3<=p0_4)
states: 1,329,767,378,368 (12)
-> the formula is FALSE

FORMULA PGCD-PT-D04N025-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.086sec

checking: EF [[EG [AF [[p0_4<=10 & EG [5<=p0_3]]]] & AG [[p0_2<=p2_2 | [EG [p0_3<=20] | 15<=p0_2]]]]]
normalized: E [true U [~ [E [true U ~ [[p0_2<=p2_2 | [15<=p0_2 | EG [p0_3<=20]]]]]] & EG [~ [EG [~ [[p0_4<=10 & EG [5<=p0_3]]]]]]]]

abstracting: (5<=p0_3)
states: 1,829,036,814,176 (12)
.
EG iterations: 1
abstracting: (p0_4<=10)
states: 1,378,031,138,512 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p0_3<=20)
states: 2,012,511,886,924 (12)
.
EG iterations: 1
abstracting: (15<=p0_2)
states: 890,163,977,124 (11)
abstracting: (p0_2<=p2_2)
states: 2,573,637,642,576 (12)
-> the formula is TRUE

FORMULA PGCD-PT-D04N025-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.950sec

checking: AF [AG [[p2_4<=14 | ~ [[[~ [p1_1<=p0_1] | [9<=p2_3 & p2_3<=p0_3]] & 15<=p0_5]]]]]
normalized: ~ [EG [E [true U ~ [[p2_4<=14 | ~ [[15<=p0_5 & [[9<=p2_3 & p2_3<=p0_3] | ~ [p1_1<=p0_1]]]]]]]]]

abstracting: (p1_1<=p0_1)
states: 1,372,458,964,448 (12)
abstracting: (p2_3<=p0_3)
states: 2,573,637,642,576 (12)
abstracting: (9<=p2_3)
states: 1,380,723,664,736 (12)
abstracting: (15<=p0_5)
states: 890,163,977,124 (11)
abstracting: (p2_4<=14)
states: 1,683,473,665,452 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D04N025-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.587sec

checking: EF [AX [~ [[A [[p0_3<=25 | p1_4<=p1_1] U ~ [p2_5<=14]] | ~ [A [p1_3<=p2_2 U p1_5<=p0_2]]]]]]
normalized: E [true U ~ [EX [[~ [[~ [EG [~ [p1_5<=p0_2]]] & ~ [E [~ [p1_5<=p0_2] U [~ [p1_3<=p2_2] & ~ [p1_5<=p0_2]]]]]] | [~ [EG [p2_5<=14]] & ~ [E [p2_5<=14 U [p2_5<=14 & ~ [[p0_3<=25 | p1_4<=p1_1]]]]]]]]]]

abstracting: (p1_4<=p1_1)
states: 1,329,769,050,720 (12)
abstracting: (p0_3<=25)
states: 2,197,676,432,886 (12)
abstracting: (p2_5<=14)
states: 1,683,473,665,452 (12)
abstracting: (p2_5<=14)
states: 1,683,473,665,452 (12)
abstracting: (p2_5<=14)
states: 1,683,473,665,452 (12)
.
EG iterations: 1
abstracting: (p1_5<=p0_2)
states: 1,329,771,391,728 (12)
abstracting: (p1_3<=p2_2)
states: 1,329,771,391,728 (12)
abstracting: (p1_5<=p0_2)
states: 1,329,771,391,728 (12)
abstracting: (p1_5<=p0_2)
states: 1,329,771,391,728 (12)
...
EG iterations: 3
.-> the formula is TRUE

FORMULA PGCD-PT-D04N025-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m29.212sec

checking: AF [~ [E [[E [A [p1_5<=12 U p2_4<=p1_2] U E [p1_1<=20 U p1_2<=12]] | EG [[p1_5<=p1_4 & 25<=p2_3]]] U p1_2<=2]]]
normalized: ~ [EG [E [[EG [[p1_5<=p1_4 & 25<=p2_3]] | E [[~ [EG [~ [p2_4<=p1_2]]] & ~ [E [~ [p2_4<=p1_2] U [~ [p1_5<=12] & ~ [p2_4<=p1_2]]]]] U E [p1_1<=20 U p1_2<=12]]] U p1_2<=2]]]

abstracting: (p1_2<=2)
states: 475,286,114,992 (11)
abstracting: (p1_2<=12)
states: 1,540,751,469,640 (12)
abstracting: (p1_1<=20)
states: 2,012,514,426,384 (12)
abstracting: (p2_4<=p1_2)
states: 1,329,766,566,128 (12)
abstracting: (p1_5<=12)
states: 1,540,751,469,640 (12)
abstracting: (p2_4<=p1_2)
states: 1,329,766,566,128 (12)
abstracting: (p2_4<=p1_2)
states: 1,329,766,566,128 (12)
.
EG iterations: 1
abstracting: (25<=p2_3)
states: 406,920,639,972 (11)
abstracting: (p1_5<=p1_4)
states: 1,329,769,050,720 (12)
.
EG iterations: 1

BK_STOP 1679897449105

--------------------
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:13045 (869), effective:4432 (295)

initing FirstDep: 0m 0.000sec


iterations count:830 (55), effective:220 (14)

iterations count:590 (39), effective:160 (10)

iterations count:7005 (467), effective:2092 (139)

iterations count:1294 (86), effective:345 (23)

iterations count:426 (28), effective:119 (7)

iterations count:4707 (313), effective:1532 (102)

iterations count:858 (57), effective:321 (21)

iterations count:3552 (236), effective:1167 (77)

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

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

iterations count:1036 (69), effective:267 (17)

iterations count:478 (31), effective:148 (9)

iterations count:797 (53), effective:253 (16)

iterations count:627 (41), effective:170 (11)

iterations count:1863 (124), effective:537 (35)

iterations count:1403 (93), effective:452 (30)

iterations count:1678 (111), effective:487 (32)

iterations count:1468 (97), effective:394 (26)

iterations count:2419 (161), effective:572 (38)

iterations count:773 (51), effective:215 (14)

iterations count:135 (9), effective:102 (6)

iterations count:3595 (239), effective:1280 (85)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 335 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="PGCD-PT-D04N025"
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 PGCD-PT-D04N025, 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-167987241100465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D04N025.tgz
mv PGCD-PT-D04N025 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 ;