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

About the Execution of Marcie for PGCD-PT-D05N025

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K 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 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:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K 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.9K 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 13K 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-D05N025-ReachabilityCardinality-00
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-01
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-02
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-03
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-04
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-05
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-06
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-07
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-08
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-09
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-10
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-11
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-12
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-13
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-14
FORMULA_NAME PGCD-PT-D05N025-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679897737688

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

parse successfull
net created successfully

Net: PGCD_COL_D5_N25
(NrP: 18 NrTr: 18 NrArc: 84)

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

net check time: 0m 0.000sec

init dd package: 0m 2.847sec


RS generation: 0m22.608sec


-> reachability set: #nodes 35891 (3.6e+04) #states 1,585,536,525,017,640 (15)



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

checking: AG [1<=p1_3]
normalized: ~ [E [true U ~ [1<=p1_3]]]

abstracting: (1<=p1_3)
states: 1,478,081,079,561,424 (15)
-> the formula is FALSE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.329sec

checking: EF [~ [p0_6<=19]]
normalized: E [true U ~ [p0_6<=19]]

abstracting: (p0_6<=19)
states: 1,212,948,061,428,618 (15)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.568sec

checking: EF [14<=p0_1]
normalized: E [true U 14<=p0_1]

abstracting: (14<=p0_1)
states: 587,150,152,487,400 (14)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.467sec

checking: EF [~ [19<=p1_3]]
normalized: E [true U ~ [19<=p1_3]]

abstracting: (19<=p1_3)
states: 401,379,579,798,945 (14)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.127sec

checking: EF [[25<=p0_6 & p2_5<=6]]
normalized: E [true U [25<=p0_6 & p2_5<=6]]

abstracting: (p2_5<=6)
states: 612,039,269,424,440 (14)
abstracting: (25<=p0_6)
states: 250,546,956,013,122 (14)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.679sec

checking: EF [~ [[p2_1<=14 | p2_6<=12]]]
normalized: E [true U ~ [[p2_1<=14 | p2_6<=12]]]

abstracting: (p2_6<=12)
states: 954,846,060,219,040 (14)
abstracting: (p2_1<=14)
states: 1,041,926,684,841,440 (15)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.169sec

checking: EF [[p1_4<=8 & p0_5<=p2_2]]
normalized: E [true U [p1_4<=8 & p0_5<=p2_2]]

abstracting: (p0_5<=p2_2)
states: 819,723,970,132,236 (14)
abstracting: (p1_4<=8)
states: 741,584,527,195,220 (14)
-> the formula is TRUE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.755sec

checking: AG [[[[22<=p0_4 | 19<=p1_1] | [~ [p0_2<=p2_2] | p0_6<=2]] | ~ [p1_2<=25]]]
normalized: ~ [E [true U ~ [[~ [p1_2<=25] | [[p0_6<=2 | ~ [p0_2<=p2_2]] | [22<=p0_4 | 19<=p1_1]]]]]]

abstracting: (19<=p1_1)
states: 401,379,579,798,945 (14)
abstracting: (22<=p0_4)
states: 318,811,398,204,360 (14)
abstracting: (p0_2<=p2_2)
states: 1,585,536,525,017,640 (15)
abstracting: (p0_6<=2)
states: 297,271,357,976,736 (14)
abstracting: (p1_2<=25)
states: 1,353,691,381,995,511 (15)
-> the formula is FALSE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.471sec

checking: AG [~ [[[[9<=p0_2 & [~ [p1_3<=15] | [~ [[[p1_4<=4 & 4<=p0_3] | [p2_6<=p1_4 & 1<=p2_5]]] | p2_6<=25]]] | ~ [[~ [[~ [p0_3<=8] & ~ [p0_4<=p1_3]]] | 2<=p0_6]]] & [~ [13<=p1_3] & p0_5<=p1_3]]]]
normalized: ~ [E [true U [[~ [[2<=p0_6 | ~ [[~ [p0_4<=p1_3] & ~ [p0_3<=8]]]]] | [9<=p0_2 & [[p2_6<=25 | ~ [[[p2_6<=p1_4 & 1<=p2_5] | [p1_4<=4 & 4<=p0_3]]]] | ~ [p1_3<=15]]]] & [p0_5<=p1_3 & ~ [13<=p1_3]]]]]

abstracting: (13<=p1_3)
states: 630,690,335,798,840 (14)
abstracting: (p0_5<=p1_3)
states: 819,723,942,929,060 (14)
abstracting: (p1_3<=15)
states: 1,079,931,357,719,814 (15)
abstracting: (4<=p0_3)
states: 1,204,570,083,286,908 (15)
abstracting: (p1_4<=4)
states: 464,661,693,384,460 (14)
abstracting: (1<=p2_5)
states: 1,478,081,241,198,900 (15)
abstracting: (p2_6<=p1_4)
states: 819,723,942,929,060 (14)
abstracting: (p2_6<=25)
states: 1,353,691,298,389,494 (15)
abstracting: (9<=p0_2)
states: 843,952,145,248,550 (14)
abstracting: (p0_3<=8)
states: 741,584,379,769,090 (14)
abstracting: (p0_4<=p1_3)
states: 819,723,942,929,060 (14)
abstracting: (2<=p0_6)
states: 1,383,173,216,930,700 (15)
-> the formula is FALSE

FORMULA PGCD-PT-D05N025-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679898221529

--------------------
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:28101 (1561), effective:9917 (550)

initing FirstDep: 0m 0.000sec


iterations count:528 (29), effective:164 (9)

iterations count:1223 (67), effective:319 (17)

iterations count:603 (33), effective:170 (9)

iterations count:474 (26), effective:146 (8)

iterations count:2051 (113), effective:547 (30)

iterations count:1568 (87), effective:428 (23)

iterations count:1107 (61), effective:325 (18)

iterations count:4110 (228), effective:1081 (60)

iterations count:2608 (144), effective:780 (43)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 346 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-D05N025"
export BK_EXAMINATION="ReachabilityCardinality"
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-D05N025, examination is ReachabilityCardinality"
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-167987241100486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D05N025.tgz
mv PGCD-PT-D05N025 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;