fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r113kn-smll-146373293200236
Last Updated
June 30, 2016

About the Execution of Marcie for SharedMemory-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5437.980 6114.00 6010.00 30.30 10 10 1 10 10 1 10 1 10 10 1 10 10 10 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-2979
Executing tool marcie
Input is SharedMemory-COL-000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r113kn-smll-146373293200236
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463823976101


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=141|T|=220|A|=840
Time for unfolding: 0m 0.626sec

Net: SharedMemory_COL_000010
(NrP: 141 NrTr: 220 NrArc: 840)

net check time: 0m 0.000sec

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

init dd package: 0m 3.513sec


RS generation: 0m 0.163sec


-> reachability set: #nodes 2728 (2.7e+03) #states 1,830,519 (6)



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

checking: place_bound(extBus_dot)
normalized: place_bound(extBus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(extBus_dot)
normalized: place_bound(extBus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(extBus_dot)
normalized: place_bound(extBus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)
normalized: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(active_pId1,active_pId10,active_pId2,active_pId3,active_pId4,active_pId5,active_pId6,active_pId7,active_pId8,active_pId9)
normalized: place_bound(active_pId1,active_pId10,active_pId2,active_pId3,active_pId4,active_pId5,active_pId6,active_pId7,active_pId8,active_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(active_pId1,active_pId10,active_pId2,active_pId3,active_pId4,active_pId5,active_pId6,active_pId7,active_pId8,active_pId9)
normalized: place_bound(active_pId1,active_pId10,active_pId2,active_pId3,active_pId4,active_pId5,active_pId6,active_pId7,active_pId8,active_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)
normalized: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)
normalized: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)
normalized: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)
normalized: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)
normalized: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)
normalized: place_bound(memory_pId1,memory_pId10,memory_pId2,memory_pId3,memory_pId4,memory_pId5,memory_pId6,memory_pId7,memory_pId8,memory_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)
normalized: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)
normalized: place_bound(queue_pId1,queue_pId10,queue_pId2,queue_pId3,queue_pId4,queue_pId5,queue_pId6,queue_pId7,queue_pId8,queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)
normalized: place_bound(ownMemAcc_pId1,ownMemAcc_pId10,ownMemAcc_pId2,ownMemAcc_pId3,ownMemAcc_pId4,ownMemAcc_pId5,ownMemAcc_pId6,ownMemAcc_pId7,ownMemAcc_pId8,ownMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(extMemAcc_pId10_pId1,extMemAcc_pId10_pId10,extMemAcc_pId10_pId2,extMemAcc_pId10_pId3,extMemAcc_pId10_pId4,extMemAcc_pId10_pId5,extMemAcc_pId10_pId6,extMemAcc_pId10_pId7,extMemAcc_pId10_pId8,extMemAcc_pId10_pId9,extMemAcc_pId1_pId1,extMemAcc_pId1_pId10,extMemAcc_pId1_pId2,extMemAcc_pId1_pId3,extMemAcc_pId1_pId4,extMemAcc_pId1_pId5,extMemAcc_pId1_pId6,extMemAcc_pId1_pId7,extMemAcc_pId1_pId8,extMemAcc_pId1_pId9,extMemAcc_pId2_pId1,extMemAcc_pId2_pId10,extMemAcc_pId2_pId2,extMemAcc_pId2_pId3,extMemAcc_pId2_pId4,extMemAcc_pId2_pId5,extMemAcc_pId2_pId6,extMemAcc_pId2_pId7,extMemAcc_pId2_pId8,extMemAcc_pId2_pId9,extMemAcc_pId3_pId1,extMemAcc_pId3_pId10,extMemAcc_pId3_pId2,extMemAcc_pId3_pId3,extMemAcc_pId3_pId4,extMemAcc_pId3_pId5,extMemAcc_pId3_pId6,extMemAcc_pId3_pId7,extMemAcc_pId3_pId8,extMemAcc_pId3_pId9,extMemAcc_pId4_pId1,extMemAcc_pId4_pId10,extMemAcc_pId4_pId2,extMemAcc_pId4_pId3,extMemAcc_pId4_pId4,extMemAcc_pId4_pId5,extMemAcc_pId4_pId6,extMemAcc_pId4_pId7,extMemAcc_pId4_pId8,extMemAcc_pId4_pId9,extMemAcc_pId5_pId1,extMemAcc_pId5_pId10,extMemAcc_pId5_pId2,extMemAcc_pId5_pId3,extMemAcc_pId5_pId4,extMemAcc_pId5_pId5,extMemAcc_pId5_pId6,extMemAcc_pId5_pId7,extMemAcc_pId5_pId8,extMemAcc_pId5_pId9,extMemAcc_pId6_pId1,extMemAcc_pId6_pId10,extMemAcc_pId6_pId2,extMemAcc_pId6_pId3,extMemAcc_pId6_pId4,extMemAcc_pId6_pId5,extMemAcc_pId6_pId6,extMemAcc_pId6_pId7,extMemAcc_pId6_pId8,extMemAcc_pId6_pId9,extMemAcc_pId7_pId1,extMemAcc_pId7_pId10,extMemAcc_pId7_pId2,extMemAcc_pId7_pId3,extMemAcc_pId7_pId4,extMemAcc_pId7_pId5,extMemAcc_pId7_pId6,extMemAcc_pId7_pId7,extMemAcc_pId7_pId8,extMemAcc_pId7_pId9,extMemAcc_pId8_pId1,extMemAcc_pId8_pId10,extMemAcc_pId8_pId2,extMemAcc_pId8_pId3,extMemAcc_pId8_pId4,extMemAcc_pId8_pId5,extMemAcc_pId8_pId6,extMemAcc_pId8_pId7,extMemAcc_pId8_pId8,extMemAcc_pId8_pId9,extMemAcc_pId9_pId1,extMemAcc_pId9_pId10,extMemAcc_pId9_pId2,extMemAcc_pId9_pId3,extMemAcc_pId9_pId4,extMemAcc_pId9_pId5,extMemAcc_pId9_pId6,extMemAcc_pId9_pId7,extMemAcc_pId9_pId8,extMemAcc_pId9_pId9)
normalized: place_bound(extMemAcc_pId10_pId1,extMemAcc_pId10_pId10,extMemAcc_pId10_pId2,extMemAcc_pId10_pId3,extMemAcc_pId10_pId4,extMemAcc_pId10_pId5,extMemAcc_pId10_pId6,extMemAcc_pId10_pId7,extMemAcc_pId10_pId8,extMemAcc_pId10_pId9,extMemAcc_pId1_pId1,extMemAcc_pId1_pId10,extMemAcc_pId1_pId2,extMemAcc_pId1_pId3,extMemAcc_pId1_pId4,extMemAcc_pId1_pId5,extMemAcc_pId1_pId6,extMemAcc_pId1_pId7,extMemAcc_pId1_pId8,extMemAcc_pId1_pId9,extMemAcc_pId2_pId1,extMemAcc_pId2_pId10,extMemAcc_pId2_pId2,extMemAcc_pId2_pId3,extMemAcc_pId2_pId4,extMemAcc_pId2_pId5,extMemAcc_pId2_pId6,extMemAcc_pId2_pId7,extMemAcc_pId2_pId8,extMemAcc_pId2_pId9,extMemAcc_pId3_pId1,extMemAcc_pId3_pId10,extMemAcc_pId3_pId2,extMemAcc_pId3_pId3,extMemAcc_pId3_pId4,extMemAcc_pId3_pId5,extMemAcc_pId3_pId6,extMemAcc_pId3_pId7,extMemAcc_pId3_pId8,extMemAcc_pId3_pId9,extMemAcc_pId4_pId1,extMemAcc_pId4_pId10,extMemAcc_pId4_pId2,extMemAcc_pId4_pId3,extMemAcc_pId4_pId4,extMemAcc_pId4_pId5,extMemAcc_pId4_pId6,extMemAcc_pId4_pId7,extMemAcc_pId4_pId8,extMemAcc_pId4_pId9,extMemAcc_pId5_pId1,extMemAcc_pId5_pId10,extMemAcc_pId5_pId2,extMemAcc_pId5_pId3,extMemAcc_pId5_pId4,extMemAcc_pId5_pId5,extMemAcc_pId5_pId6,extMemAcc_pId5_pId7,extMemAcc_pId5_pId8,extMemAcc_pId5_pId9,extMemAcc_pId6_pId1,extMemAcc_pId6_pId10,extMemAcc_pId6_pId2,extMemAcc_pId6_pId3,extMemAcc_pId6_pId4,extMemAcc_pId6_pId5,extMemAcc_pId6_pId6,extMemAcc_pId6_pId7,extMemAcc_pId6_pId8,extMemAcc_pId6_pId9,extMemAcc_pId7_pId1,extMemAcc_pId7_pId10,extMemAcc_pId7_pId2,extMemAcc_pId7_pId3,extMemAcc_pId7_pId4,extMemAcc_pId7_pId5,extMemAcc_pId7_pId6,extMemAcc_pId7_pId7,extMemAcc_pId7_pId8,extMemAcc_pId7_pId9,extMemAcc_pId8_pId1,extMemAcc_pId8_pId10,extMemAcc_pId8_pId2,extMemAcc_pId8_pId3,extMemAcc_pId8_pId4,extMemAcc_pId8_pId5,extMemAcc_pId8_pId6,extMemAcc_pId8_pId7,extMemAcc_pId8_pId8,extMemAcc_pId8_pId9,extMemAcc_pId9_pId1,extMemAcc_pId9_pId10,extMemAcc_pId9_pId2,extMemAcc_pId9_pId3,extMemAcc_pId9_pId4,extMemAcc_pId9_pId5,extMemAcc_pId9_pId6,extMemAcc_pId9_pId7,extMemAcc_pId9_pId8,extMemAcc_pId9_pId9)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 6.076sec


BK_STOP 1463823982215

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
extMemAcc_pId1_pId1
extMemAcc_pId4_pId4
extMemAcc_pId2_pId2
extMemAcc_pId3_pId3
extMemAcc_pId5_pId5
extMemAcc_pId7_pId7
extMemAcc_pId8_pId8
extMemAcc_pId6_pId6
extMemAcc_pId9_pId9
extMemAcc_pId10_pId10

The net has transition(s) that can never fire:
endExtAcc_0_0
endExtAcc_1_1
endExtAcc_2_2
endExtAcc_3_3
endExtAcc_4_4
endExtAcc_5_5
endExtAcc_6_6
endExtAcc_7_7
endExtAcc_8_8
endExtAcc_9_9

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="SharedMemory-COL-000010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is SharedMemory-COL-000010, 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 r113kn-smll-146373293200236"
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 ;