fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r101-blw3-149441599100497
Last Updated
June 27, 2017

About the Execution of MARCIE for S_GlobalResAllocation-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8368.960 1552426.00 1553010.00 30.10 20 20 10 10 10 5 20 5 20 10 5 10 5 5 10 10 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 S_GlobalResAllocation-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100497
=====================================================================


--------------------
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 GlobalResAllocation-COL-05-UpperBounds-0
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-1
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-10
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-11
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-12
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-13
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-14
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-15
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-2
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-3
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-4
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-5
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-6
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-7
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-8
FORMULA_NAME GlobalResAllocation-COL-05-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1494883311864

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

Net: GlobalResAllocation_PT_05
(NrP: 75 NrTr: 56105 NrArc: 492760)

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

net check time: 0m 0.094sec

init dd package: 0m 1.081sec

parse successfull
net created successfully

Net: GlobalResAllocation_PT_05
(NrP: 75 NrTr: 56105 NrArc: 492760)

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

net check time: 0m 0.088sec

init dd package: 0m 4.033sec


RS generation: 25m14.133sec


-> reachability set: #nodes 142644 (1.4e+05) #states 106,603,672 (8)



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

checking: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)
normalized: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)

-> the formula is 20

FORMULA GlobalResAllocation-COL-05-UpperBounds-0 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)
normalized: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)

-> the formula is 20

FORMULA GlobalResAllocation-COL-05-UpperBounds-1 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)
normalized: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)

-> the formula is 20

FORMULA GlobalResAllocation-COL-05-UpperBounds-2 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)
normalized: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)

-> the formula is 5

FORMULA GlobalResAllocation-COL-05-UpperBounds-4 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)
normalized: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)

-> the formula is 5

FORMULA GlobalResAllocation-COL-05-UpperBounds-6 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)
normalized: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)

-> the formula is 5

FORMULA GlobalResAllocation-COL-05-UpperBounds-7 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)
normalized: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)
normalized: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)
normalized: place_bound(pr_in_1,pr_in_2,pr_in_3,pr_in_4,pr_in_5)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)
normalized: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)

-> the formula is 5

FORMULA GlobalResAllocation-COL-05-UpperBounds-13 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)
normalized: place_bound(pr_released_4,pr_released_5,pr_released_1,pr_released_2,pr_released_3)

-> the formula is 20

FORMULA GlobalResAllocation-COL-05-UpperBounds-14 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)
normalized: place_bound(Processes_1,Processes_2,Processes_3,Processes_4,Processes_5)

-> the formula is 5

FORMULA GlobalResAllocation-COL-05-UpperBounds-15 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)
normalized: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)
normalized: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)
normalized: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)
normalized: place_bound(Resources_1,Resources_2,Resources_3,Resources_4,Resources_5,Resources_6,Resources_7,Resources_8,Resources_10,Resources_9)

-> the formula is 10

FORMULA GlobalResAllocation-COL-05-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 4251300 (4.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 404080970 1381076522 1785157492
used/not used/entry size/cache size: 67105106 3758 16 1024MB
basic ops cache: hits/miss/sum: 92196 107268 199464
used/not used/entry size/cache size: 196739 16580477 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: 45814 142676 188490
used/not used/entry size/cache size: 141693 8246915 32 256MB
max state cache: hits/miss/sum: 183256 570704 753960
used/not used/entry size/cache size: 141693 8246915 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 63472197
1 3172605
2 386713
3 63499
4 9355
5 2026
6 354
7 166
8 195
9 152
>= 10 1602

Total processing time: 25m52.307sec


BK_STOP 1494884864290

--------------------
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

...

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="S_GlobalResAllocation-PT-05"
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/S_GlobalResAllocation-PT-05.tgz
mv S_GlobalResAllocation-PT-05 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 S_GlobalResAllocation-PT-05, 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 r101-blw3-149441599100497"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;