fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r050kn-ebro-143236504100868
Last Updated
August 19, 2015

About the Execution of Marcie for NeoElection-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4208.610 3600000.00 3600019.00 20.20 [undef] Time out reached

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-2265
Executing tool marcie
Input is NeoElection-COL-6, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236504100868
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1432552048536

Model: NeoElection-COL-6
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityComputeBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=1575|T|=8533|A|=49518
Time for unfolding: 0m1sec

(NrP: 1575 NrTr: 8533 NrArc: 49518)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m35sec

init dd package: 0m5sec


BK_TIME_CONFINEMENT_REACHED

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

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: 0m2sec

7058 8429 8429 16216 32680 32680 33482 33529 33963 42815 48258 48258 48382 48382 48766 48944 49052 48476 48620 50890 53705 55968 55968 58239 58239 77042 77042 77042 85721 82508 87350 87350 90551 82994 87243 87869 87869 89033 84159 88129 88884 89600 89817 89817 90949 86001 87851 88585 91487 91041 93070 95314 95574 99836 99565 101325 103457 103457 103457 103457 103457 110245 116589 116589 116589 119731 119732 116691 116691 126318 135499 135499 135499 138593 138594 138594 135553 148034 148034 160052 160052 160052 163120 163121 160080 160080 175986 190841 190841 190841 194031 194032 190991 190991 209378 227070 227070 227070 230136 230137 230137 227096 405271 405271 405271 405271 590359 590359 590359 596749 596749 596749 594844 594844 594844

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="NeoElection-COL-6"
export BK_EXAMINATION="ReachabilityComputeBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/NeoElection-COL-6.tgz
mv NeoElection-COL-6 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is NeoElection-COL-6, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r050kn-ebro-143236504100868"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 '' ReachabilityComputeBounds.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 ;