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

About the Execution of Marcie for GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13022.880 199982.00 200060.00 0.00 2000 200 10 1592 4007 1104 796 10 10 2000 10 10 400 700 700 1000 normal

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.r161-tall-167838845800861.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 GPPP-PT-C0100N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845800861
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0100N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679885058584

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=GPPP-PT-C0100N0000001000
Not applying reductions.
Model is PT
UpperBounds 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 2.879sec


RS generation: 3m12.085sec


-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)



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

checking: place_bound(NADplus)
normalized: place_bound(NADplus)

-> the formula is 2000

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-00 2000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a1)
normalized: place_bound(a1)

-> the formula is 200

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-01 200 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(_3PG)
normalized: place_bound(_3PG)

-> the formula is 10

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-02 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(GSH)
normalized: place_bound(GSH)

-> the formula is 1592

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-03 1592 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ATP)
normalized: place_bound(ATP)

-> the formula is 4007

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-04 4007 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ADP)
normalized: place_bound(ADP)

-> the formula is 1104

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-05 1104 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(NADPH)
normalized: place_bound(NADPH)

-> the formula is 796

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-06 796 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(_1_3_BPG)
normalized: place_bound(_1_3_BPG)

-> the formula is 10

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-07 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Lac)
normalized: place_bound(Lac)

-> the formula is 10

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-08 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(NADPplus)
normalized: place_bound(NADPplus)

-> the formula is 2000

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-09 2000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(DHAP)
normalized: place_bound(DHAP)

-> the formula is 10

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(Pyr)
normalized: place_bound(Pyr)

-> the formula is 10

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Gluc)
normalized: place_bound(Gluc)

-> the formula is 400

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-12 400 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c2)
normalized: place_bound(c2)

-> the formula is 700

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-13 700 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Pi)
normalized: place_bound(Pi)

-> the formula is 700

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-14 700 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(GSSG)
normalized: place_bound(GSSG)

-> the formula is 1000

FORMULA GPPP-PT-C0100N0000001000-UpperBounds-15 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 22775121 (2.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 187796662 31258001 219054663
used/not used/entry size/cache size: 24938766 42170098 16 1024MB
basic ops cache: hits/miss/sum: 104922959 22616902 127539861
used/not used/entry size/cache size: 16141089 636127 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: 4311971 721170 5033141
used/not used/entry size/cache size: 686270 7702338 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 58232496
1 2808094
2 2607668
3 1166077
4 1332474
5 499946
6 312545
7 66471
8 41048
9 19658
>= 10 22387

Total processing time: 3m19.896sec


BK_STOP 1679885258566

--------------------
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:11921 (541), effective:2875 (130)

initing FirstDep: 0m 0.002sec

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="GPPP-PT-C0100N0000001000"
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 GPPP-PT-C0100N0000001000, 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 r161-tall-167838845800861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;