About the Execution of MARCIE for PhilosophersDyn-COL-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7529.250 | 8873.00 | 8010.00 | 29.70 | 3 2 3 3 2 3 3 3 2 3 3 3 2 3 3 3 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is PhilosophersDyn-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041-smll-149440525600227
=====================================================================
--------------------
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-COL-03-UpperBounds-0
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-1
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-15
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-2
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-3
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-4
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-5
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-6
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-7
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-8
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1494620084194
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6
parse successfull
net created successfully
Unfolding complete |P|=30|T|=84|A|=591
Time for unfolding: 0m 0.807sec
Net: PhilosophersDyn_COL_03
(NrP: 30 NrTr: 84 NrArc: 564)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.116sec
parse successfull
net created successfully
Unfolding complete |P|=30|T|=84|A|=591
Time for unfolding: 0m 0.619sec
Net: PhilosophersDyn_COL_03
(NrP: 30 NrTr: 84 NrArc: 564)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.838sec
RS generation: 0m 0.016sec
-> reachability set: #nodes 448 (4.5e+02) #states 325
starting MCC model checker
--------------------------
checking: place_bound(WaitRight_Philosopher1,WaitRight_Philosopher2,WaitRight_Philosopher3)
normalized: place_bound(WaitRight_Philosopher1,WaitRight_Philosopher2,WaitRight_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(HasLeft_Philosopher1,HasLeft_Philosopher2,HasLeft_Philosopher3)
normalized: place_bound(HasLeft_Philosopher1,HasLeft_Philosopher2,HasLeft_Philosopher3)
-> the formula is 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Forks_Philosopher1,Forks_Philosopher2,Forks_Philosopher3)
normalized: place_bound(Forks_Philosopher1,Forks_Philosopher2,Forks_Philosopher3)
-> the formula is 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-2 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Think_Philosopher1,Think_Philosopher2,Think_Philosopher3)
normalized: place_bound(Think_Philosopher1,Think_Philosopher2,Think_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-3 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
normalized: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-4 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(WaitLeft_Philosopher1,WaitLeft_Philosopher2,WaitLeft_Philosopher3)
normalized: place_bound(WaitLeft_Philosopher1,WaitLeft_Philosopher2,WaitLeft_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(HasLeft_Philosopher1,HasLeft_Philosopher2,HasLeft_Philosopher3)
normalized: place_bound(HasLeft_Philosopher1,HasLeft_Philosopher2,HasLeft_Philosopher3)
-> the formula is 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Think_Philosopher1,Think_Philosopher2,Think_Philosopher3)
normalized: place_bound(Think_Philosopher1,Think_Philosopher2,Think_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
normalized: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Forks_Philosopher1,Forks_Philosopher2,Forks_Philosopher3)
normalized: place_bound(Forks_Philosopher1,Forks_Philosopher2,Forks_Philosopher3)
-> the formula is 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
normalized: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
normalized: place_bound(Outside_Philosopher1,Outside_Philosopher2,Outside_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(WaitLeft_Philosopher1,WaitLeft_Philosopher2,WaitLeft_Philosopher3)
normalized: place_bound(WaitLeft_Philosopher1,WaitLeft_Philosopher2,WaitLeft_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
normalized: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
normalized: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-8 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
normalized: place_bound(Neighbourhood_Philosopher1_Philosopher1,Neighbourhood_Philosopher1_Philosopher2,Neighbourhood_Philosopher1_Philosopher3,Neighbourhood_Philosopher2_Philosopher1,Neighbourhood_Philosopher2_Philosopher2,Neighbourhood_Philosopher2_Philosopher3,Neighbourhood_Philosopher3_Philosopher1,Neighbourhood_Philosopher3_Philosopher2,Neighbourhood_Philosopher3_Philosopher3)
-> the formula is 3
FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 1951 (2.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6737 33935 40672
used/not used/entry size/cache size: 33480 67075384 16 1024MB
basic ops cache: hits/miss/sum: 16 506 522
used/not used/entry size/cache size: 1471 16775745 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: 92 448 540
used/not used/entry size/cache size: 448 8388160 32 256MB
max state cache: hits/miss/sum: 644 3136 3780
used/not used/entry size/cache size: 448 8388160 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67107038
1 1823
2 3
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.761sec
BK_STOP 1494620093067
--------------------
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
ptnet_zbdd.cc:66: Boundedness exception: net maybe not 1-bounded!
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:1660 (19), effective:60 (0)
initing FirstDep: 0m 0.000sec
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-COL-03"
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"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is PhilosophersDyn-COL-03, 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 r041-smll-149440525600227"
echo "====================================================================="
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 '
echo "FORMULA_NAME $x"
done
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 ;