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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678767717677

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=PhilosophersDyn-PT-10
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: PhilosophersDyn_PT_10
(NrP: 170 NrTr: 2310 NrArc: 18190)

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

net check time: 0m 0.002sec

init dd package: 0m 2.902sec


RS generation: 10m58.258sec


-> reachability set: #nodes 1086823 (1.1e+06) #states 199,051 (5)



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

checking: place_bound(Think_7)
normalized: place_bound(Think_7)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(WaitRight_6)
normalized: place_bound(WaitRight_6)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_10)
normalized: place_bound(HasRight_10)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_1)
normalized: place_bound(HasRight_1)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_5)
normalized: place_bound(HasRight_5)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_10)
normalized: place_bound(HasRight_10)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WaitRight_1)
normalized: place_bound(WaitRight_1)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WaitLeft_9)
normalized: place_bound(WaitLeft_9)

-> the formula is 1

FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_9,HasRight_2,HasRight_3,HasRight_8,HasRight_1,HasRight_10,HasRight_6,HasRight_7,HasRight_4,HasRight_5)
normalized: place_bound(HasRight_9,HasRight_2,HasRight_3,HasRight_8,HasRight_1,HasRight_10,HasRight_6,HasRight_7,HasRight_4,HasRight_5)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-01 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_9,Think_8,Think_1,Think_2,Think_3,Think_7,Think_6,Think_4,Think_5,Think_10)
normalized: place_bound(Think_9,Think_8,Think_1,Think_2,Think_3,Think_7,Think_6,Think_4,Think_5,Think_10)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WaitLeft_7,WaitLeft_4,WaitLeft_10,WaitLeft_5,WaitLeft_2,WaitLeft_3,WaitLeft_1,WaitLeft_8,WaitLeft_9,WaitLeft_6)
normalized: place_bound(WaitLeft_7,WaitLeft_4,WaitLeft_10,WaitLeft_5,WaitLeft_2,WaitLeft_3,WaitLeft_1,WaitLeft_8,WaitLeft_9,WaitLeft_6)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Outside_10,Outside_4,Outside_3,Outside_5,Outside_6,Outside_7,Outside_8,Outside_9,Outside_2,Outside_1)
normalized: place_bound(Outside_10,Outside_4,Outside_3,Outside_5,Outside_6,Outside_7,Outside_8,Outside_9,Outside_2,Outside_1)

-> the formula is 10

FORMULA PhilosophersDyn-PT-10-UpperBounds-04 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasRight_9,HasRight_2,HasRight_3,HasRight_8,HasRight_1,HasRight_10,HasRight_6,HasRight_7,HasRight_4,HasRight_5)
normalized: place_bound(HasRight_9,HasRight_2,HasRight_3,HasRight_8,HasRight_1,HasRight_10,HasRight_6,HasRight_7,HasRight_4,HasRight_5)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(HasLeft_6,HasLeft_1,HasLeft_8,HasLeft_9,HasLeft_3,HasLeft_10,HasLeft_2,HasLeft_5,HasLeft_4,HasLeft_7)
normalized: place_bound(HasLeft_6,HasLeft_1,HasLeft_8,HasLeft_9,HasLeft_3,HasLeft_10,HasLeft_2,HasLeft_5,HasLeft_4,HasLeft_7)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Neighbourhood_7_3,Neighbourhood_2_10,Neighbourhood_9_1,Neighbourhood_3_8,Neighbourhood_8_2,Neighbourhood_5_5,Neighbourhood_8_9,Neighbourhood_3_4,Neighbourhood_7_7,Neighbourhood_3_6,Neighbourhood_4_8,Neighbourhood_5_10,Neighbourhood_5_1,Neighbourhood_6_5,Neighbourhood_1_9,Neighbourhood_1_7,Neighbourhood_6_3,Neighbourhood_9_2,Neighbourhood_2_2,Neighbourhood_10_4,Neighbourhood_7_5,Neighbourhood_1_2,Neighbourhood_5_8,Neighbourhood_6_1,Neighbourhood_9_9,Neighbourhood_2_7,Neighbourhood_6_7,Neighbourhood_10_2,Neighbourhood_4_4,Neighbourhood_2_6,Neighbourhood_5_3,Neighbourhood_4_10,Neighbourhood_3_1,Neighbourhood_9_4,Neighbourhood_9_7,Neighbourhood_8_5,Neighbourhood_4_3,Neighbourhood_6_8,Neighbourhood_9_6,Neighbourhood_10_8,Neighbourhood_1_6,Neighbourhood_9_8,Neighbourhood_1_4,Neighbourhood_6_9,Neighbourhood_7_10,Neighbourhood_8_7,Neighbourhood_7_8,Neighbourhood_4_1,Neighbourhood_6_10,Neighbourhood_4_2,Neighbourhood_3_3,Neighbourhood_1_5,Neighbourhood_2_4,Neighbourhood_8_8,Neighbourhood_7_9,Neighbourhood_10_6,Neighbourhood_10_5,Neighbourhood_3_2,Neighbourhood_9_3,Neighbourhood_4_7,Neighbourhood_6_4,Neighbourhood_2_3,Neighbourhood_5_2,Neighbourhood_6_6,Neighbourhood_8_1,Neighbourhood_10_3,Neighbourhood_2_5,Neighbourhood_1_1,Neighbourhood_10_7,Neighbourhood_1_3,Neighbourhood_9_5,Neighbourhood_7_1,Neighbourhood_3_7,Neighbourhood_8_6,Neighbourhood_6_2,Neighbourhood_5_4,Neighbourhood_8_10,Neighbourhood_5_9,Neighbourhood_9_10,Neighbourhood_4_9,Neighbourhood_7_6,Neighbourhood_2_1,Neighbourhood_1_8,Neighbourhood_3_5,Neighbourhood_10_9,Neighbourhood_3_9,Neighbourhood_8_4,Neighbourhood_5_6,Neighbourhood_10_1,Neighbourhood_7_2,Neighbourhood_4_5,Neighbourhood_2_8,Neighbourhood_10_10,Neighbourhood_4_6,Neighbourhood_7_4,Neighbourhood_8_3,Neighbourhood_1_10,Neighbourhood_2_9,Neighbourhood_5_7,Neighbourhood_3_10)
normalized: place_bound(Neighbourhood_7_3,Neighbourhood_2_10,Neighbourhood_9_1,Neighbourhood_3_8,Neighbourhood_8_2,Neighbourhood_5_5,Neighbourhood_8_9,Neighbourhood_3_4,Neighbourhood_7_7,Neighbourhood_3_6,Neighbourhood_4_8,Neighbourhood_5_10,Neighbourhood_5_1,Neighbourhood_6_5,Neighbourhood_1_9,Neighbourhood_1_7,Neighbourhood_6_3,Neighbourhood_9_2,Neighbourhood_2_2,Neighbourhood_10_4,Neighbourhood_7_5,Neighbourhood_1_2,Neighbourhood_5_8,Neighbourhood_6_1,Neighbourhood_9_9,Neighbourhood_2_7,Neighbourhood_6_7,Neighbourhood_10_2,Neighbourhood_4_4,Neighbourhood_2_6,Neighbourhood_5_3,Neighbourhood_4_10,Neighbourhood_3_1,Neighbourhood_9_4,Neighbourhood_9_7,Neighbourhood_8_5,Neighbourhood_4_3,Neighbourhood_6_8,Neighbourhood_9_6,Neighbourhood_10_8,Neighbourhood_1_6,Neighbourhood_9_8,Neighbourhood_1_4,Neighbourhood_6_9,Neighbourhood_7_10,Neighbourhood_8_7,Neighbourhood_7_8,Neighbourhood_4_1,Neighbourhood_6_10,Neighbourhood_4_2,Neighbourhood_3_3,Neighbourhood_1_5,Neighbourhood_2_4,Neighbourhood_8_8,Neighbourhood_7_9,Neighbourhood_10_6,Neighbourhood_10_5,Neighbourhood_3_2,Neighbourhood_9_3,Neighbourhood_4_7,Neighbourhood_6_4,Neighbourhood_2_3,Neighbourhood_5_2,Neighbourhood_6_6,Neighbourhood_8_1,Neighbourhood_10_3,Neighbourhood_2_5,Neighbourhood_1_1,Neighbourhood_10_7,Neighbourhood_1_3,Neighbourhood_9_5,Neighbourhood_7_1,Neighbourhood_3_7,Neighbourhood_8_6,Neighbourhood_6_2,Neighbourhood_5_4,Neighbourhood_8_10,Neighbourhood_5_9,Neighbourhood_9_10,Neighbourhood_4_9,Neighbourhood_7_6,Neighbourhood_2_1,Neighbourhood_1_8,Neighbourhood_3_5,Neighbourhood_10_9,Neighbourhood_3_9,Neighbourhood_8_4,Neighbourhood_5_6,Neighbourhood_10_1,Neighbourhood_7_2,Neighbourhood_4_5,Neighbourhood_2_8,Neighbourhood_10_10,Neighbourhood_4_6,Neighbourhood_7_4,Neighbourhood_8_3,Neighbourhood_1_10,Neighbourhood_2_9,Neighbourhood_5_7,Neighbourhood_3_10)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-00 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Neighbourhood_7_3,Neighbourhood_2_10,Neighbourhood_9_1,Neighbourhood_3_8,Neighbourhood_8_2,Neighbourhood_5_5,Neighbourhood_8_9,Neighbourhood_3_4,Neighbourhood_7_7,Neighbourhood_3_6,Neighbourhood_4_8,Neighbourhood_5_10,Neighbourhood_5_1,Neighbourhood_6_5,Neighbourhood_1_9,Neighbourhood_1_7,Neighbourhood_6_3,Neighbourhood_9_2,Neighbourhood_2_2,Neighbourhood_10_4,Neighbourhood_7_5,Neighbourhood_1_2,Neighbourhood_5_8,Neighbourhood_6_1,Neighbourhood_9_9,Neighbourhood_2_7,Neighbourhood_6_7,Neighbourhood_10_2,Neighbourhood_4_4,Neighbourhood_2_6,Neighbourhood_5_3,Neighbourhood_4_10,Neighbourhood_3_1,Neighbourhood_9_4,Neighbourhood_9_7,Neighbourhood_8_5,Neighbourhood_4_3,Neighbourhood_6_8,Neighbourhood_9_6,Neighbourhood_10_8,Neighbourhood_1_6,Neighbourhood_9_8,Neighbourhood_1_4,Neighbourhood_6_9,Neighbourhood_7_10,Neighbourhood_8_7,Neighbourhood_7_8,Neighbourhood_4_1,Neighbourhood_6_10,Neighbourhood_4_2,Neighbourhood_3_3,Neighbourhood_1_5,Neighbourhood_2_4,Neighbourhood_8_8,Neighbourhood_7_9,Neighbourhood_10_6,Neighbourhood_10_5,Neighbourhood_3_2,Neighbourhood_9_3,Neighbourhood_4_7,Neighbourhood_6_4,Neighbourhood_2_3,Neighbourhood_5_2,Neighbourhood_6_6,Neighbourhood_8_1,Neighbourhood_10_3,Neighbourhood_2_5,Neighbourhood_1_1,Neighbourhood_10_7,Neighbourhood_1_3,Neighbourhood_9_5,Neighbourhood_7_1,Neighbourhood_3_7,Neighbourhood_8_6,Neighbourhood_6_2,Neighbourhood_5_4,Neighbourhood_8_10,Neighbourhood_5_9,Neighbourhood_9_10,Neighbourhood_4_9,Neighbourhood_7_6,Neighbourhood_2_1,Neighbourhood_1_8,Neighbourhood_3_5,Neighbourhood_10_9,Neighbourhood_3_9,Neighbourhood_8_4,Neighbourhood_5_6,Neighbourhood_10_1,Neighbourhood_7_2,Neighbourhood_4_5,Neighbourhood_2_8,Neighbourhood_10_10,Neighbourhood_4_6,Neighbourhood_7_4,Neighbourhood_8_3,Neighbourhood_1_10,Neighbourhood_2_9,Neighbourhood_5_7,Neighbourhood_3_10)
normalized: place_bound(Neighbourhood_7_3,Neighbourhood_2_10,Neighbourhood_9_1,Neighbourhood_3_8,Neighbourhood_8_2,Neighbourhood_5_5,Neighbourhood_8_9,Neighbourhood_3_4,Neighbourhood_7_7,Neighbourhood_3_6,Neighbourhood_4_8,Neighbourhood_5_10,Neighbourhood_5_1,Neighbourhood_6_5,Neighbourhood_1_9,Neighbourhood_1_7,Neighbourhood_6_3,Neighbourhood_9_2,Neighbourhood_2_2,Neighbourhood_10_4,Neighbourhood_7_5,Neighbourhood_1_2,Neighbourhood_5_8,Neighbourhood_6_1,Neighbourhood_9_9,Neighbourhood_2_7,Neighbourhood_6_7,Neighbourhood_10_2,Neighbourhood_4_4,Neighbourhood_2_6,Neighbourhood_5_3,Neighbourhood_4_10,Neighbourhood_3_1,Neighbourhood_9_4,Neighbourhood_9_7,Neighbourhood_8_5,Neighbourhood_4_3,Neighbourhood_6_8,Neighbourhood_9_6,Neighbourhood_10_8,Neighbourhood_1_6,Neighbourhood_9_8,Neighbourhood_1_4,Neighbourhood_6_9,Neighbourhood_7_10,Neighbourhood_8_7,Neighbourhood_7_8,Neighbourhood_4_1,Neighbourhood_6_10,Neighbourhood_4_2,Neighbourhood_3_3,Neighbourhood_1_5,Neighbourhood_2_4,Neighbourhood_8_8,Neighbourhood_7_9,Neighbourhood_10_6,Neighbourhood_10_5,Neighbourhood_3_2,Neighbourhood_9_3,Neighbourhood_4_7,Neighbourhood_6_4,Neighbourhood_2_3,Neighbourhood_5_2,Neighbourhood_6_6,Neighbourhood_8_1,Neighbourhood_10_3,Neighbourhood_2_5,Neighbourhood_1_1,Neighbourhood_10_7,Neighbourhood_1_3,Neighbourhood_9_5,Neighbourhood_7_1,Neighbourhood_3_7,Neighbourhood_8_6,Neighbourhood_6_2,Neighbourhood_5_4,Neighbourhood_8_10,Neighbourhood_5_9,Neighbourhood_9_10,Neighbourhood_4_9,Neighbourhood_7_6,Neighbourhood_2_1,Neighbourhood_1_8,Neighbourhood_3_5,Neighbourhood_10_9,Neighbourhood_3_9,Neighbourhood_8_4,Neighbourhood_5_6,Neighbourhood_10_1,Neighbourhood_7_2,Neighbourhood_4_5,Neighbourhood_2_8,Neighbourhood_10_10,Neighbourhood_4_6,Neighbourhood_7_4,Neighbourhood_8_3,Neighbourhood_1_10,Neighbourhood_2_9,Neighbourhood_5_7,Neighbourhood_3_10)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 3910117 (3.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 158055354 1969290974 2127346328
used/not used/entry size/cache size: 67108863 1 16 1024MB
basic ops cache: hits/miss/sum: 167659 764204 931863
used/not used/entry size/cache size: 1066423 15710793 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: 62820 1087982 1150802
used/not used/entry size/cache size: 1021643 7366965 32 256MB
max state cache: hits/miss/sum: 376920 6527892 6904812
used/not used/entry size/cache size: 1021643 7366965 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64160555
1 2203496
2 568851
3 141595
4 28581
5 5005
6 688
7 88
8 4
9 1
>= 10 0

Total processing time: 11m 9.441sec


BK_STOP 1678768387173

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

55774 98347 141096 167356 209756 224647 287670 337482 383357 414508 442036 481527 510318 536385 562319 584490 596913 613821 634831 652780 661712 670817 680284 687434 711898 765110 772306 782272 803364 832905 855622 882475 906139 923742 932656 956737 972722 983767 990330 1019573 1028268 1037186 1042561 1070832 1079335 1086032 1089974
iterations count:4743148 (2053), effective:7890 (3)

initing FirstDep: 0m 0.023sec

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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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-167873940200325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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