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.r289-tall-167873940100205.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 Philosophers-PT-000020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873940100205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 21K Feb 25 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 25 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 171K Feb 25 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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 Philosophers-PT-000020-UpperBounds-00
FORMULA_NAME Philosophers-PT-000020-UpperBounds-01
FORMULA_NAME Philosophers-PT-000020-UpperBounds-02
FORMULA_NAME Philosophers-PT-000020-UpperBounds-03
FORMULA_NAME Philosophers-PT-000020-UpperBounds-04
FORMULA_NAME Philosophers-PT-000020-UpperBounds-05
FORMULA_NAME Philosophers-PT-000020-UpperBounds-06
FORMULA_NAME Philosophers-PT-000020-UpperBounds-07
FORMULA_NAME Philosophers-PT-000020-UpperBounds-08
FORMULA_NAME Philosophers-PT-000020-UpperBounds-09
FORMULA_NAME Philosophers-PT-000020-UpperBounds-10
FORMULA_NAME Philosophers-PT-000020-UpperBounds-11
FORMULA_NAME Philosophers-PT-000020-UpperBounds-12
FORMULA_NAME Philosophers-PT-000020-UpperBounds-13
FORMULA_NAME Philosophers-PT-000020-UpperBounds-14
FORMULA_NAME Philosophers-PT-000020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678758937735

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=Philosophers-PT-000020
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: Philosophers_PT_000020
(NrP: 100 NrTr: 100 NrArc: 320)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 500 (5.0e+02) #states 3,486,784,401 (9)



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

checking: place_bound(Catch1_12)
normalized: place_bound(Catch1_12)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_13)
normalized: place_bound(Catch2_13)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_12)
normalized: place_bound(Think_12)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_4)
normalized: place_bound(Catch1_4)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_3)
normalized: place_bound(Catch1_3)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_11)
normalized: place_bound(Fork_11)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_20)
normalized: place_bound(Catch2_20)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_12)
normalized: place_bound(Think_12)

-> the formula is 1

FORMULA Philosophers-PT-000020-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-00 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-01 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-02 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_1,Catch1_4,Catch1_5,Catch1_2,Catch1_3,Catch1_9,Catch1_8,Catch1_7,Catch1_6,Catch1_13,Catch1_12,Catch1_11,Catch1_10,Catch1_17,Catch1_16,Catch1_15,Catch1_14,Catch1_20,Catch1_19,Catch1_18)
normalized: place_bound(Catch1_1,Catch1_4,Catch1_5,Catch1_2,Catch1_3,Catch1_9,Catch1_8,Catch1_7,Catch1_6,Catch1_13,Catch1_12,Catch1_11,Catch1_10,Catch1_17,Catch1_16,Catch1_15,Catch1_14,Catch1_20,Catch1_19,Catch1_18)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-03 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-04 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_1,Catch2_6,Catch2_7,Catch2_8,Catch2_9,Catch2_2,Catch2_3,Catch2_4,Catch2_5,Catch2_14,Catch2_15,Catch2_16,Catch2_17,Catch2_10,Catch2_11,Catch2_12,Catch2_13,Catch2_19,Catch2_18,Catch2_20)
normalized: place_bound(Catch2_1,Catch2_6,Catch2_7,Catch2_8,Catch2_9,Catch2_2,Catch2_3,Catch2_4,Catch2_5,Catch2_14,Catch2_15,Catch2_16,Catch2_17,Catch2_10,Catch2_11,Catch2_12,Catch2_13,Catch2_19,Catch2_18,Catch2_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-05 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-06 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_20)

-> the formula is 20

FORMULA Philosophers-PT-000020-UpperBounds-07 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 8363 (8.4e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1991 29565 31556
used/not used/entry size/cache size: 32126 67076738 16 1024MB
basic ops cache: hits/miss/sum: 0 4950 4950
used/not used/entry size/cache size: 14831 16762385 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: 114 500 614
used/not used/entry size/cache size: 500 8388108 32 256MB
max state cache: hits/miss/sum: 342 1500 1842
used/not used/entry size/cache size: 500 8388108 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67100503
1 8359
2 2
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.466sec


BK_STOP 1678758943247

--------------------
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:458 (4), effective:60 (0)

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="Philosophers-PT-000020"
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 Philosophers-PT-000020, 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 r289-tall-167873940100205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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