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

About the Execution of Marcie for S_NeoElection-PT-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7557.970 3600000.00 3600009.00 20.40 [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 S_NeoElection-PT-8, examination is CTLFireabilitySimple
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441500979
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-0
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-1
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-10
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-11
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-12
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-13
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-14
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-15
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-2
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-3
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-4
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-5
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-6
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-7
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-8
FORMULA_NAME NeoElection-COL-8-CTLFireabilitySimple-9

=== Now, execution of the tool begins

BK_START 1433389588515

Model: S_NeoElection-PT-8
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=CTLFireabilitySimple.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 10062 NrTr: 22266 NrArc: 129195)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:4m32sec

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

20345 20345 20345 32272 32272 32409 56982 56982 57247 109447 109447 109447 112868 112939 112939 113076 113443 113775 124408 124408 124408 129550 130470 130574 130750 131102 131262 131262 131262 128932 130608 131221 131221 142402 142402 155692 155692 155692 166502 166502 166502 166502 166502 177684 177684 177684 177684 177684 190481 190481 201658 201658 201658 201658 201658 212622 212622 212622 223586 223586 223586 223586 223586 234527 234527 245468 245468 245468 245468 245468 256386 256386 256386 267304 267304 267304 267304 267304 278201 278201 289098 289098 289098 289098 289098 299976 299976 299976 310854 310854 310854 310854 310854 321686 321686 332518 332518 332518 332518 332518 339794 339794 346681 351286 351286 361860 361860 350368 350368 350368 380070 380070 404264 404264 404264 399296 399296 424384 424384 424384 444514 444514 439556 439556 439556 460575 460575 476650 476650 476650 471706 471706 488688 488688 488688 500739 500739 495808 495808 495808 508756 508756 516791 516791 516791 511878 511878 520793 520793 520793 524814 524814 519920 519920 519920 524812 524812 524830 524830 524830 519956 519956 519956 722063

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_NeoElection-PT-8"
export BK_EXAMINATION="CTLFireabilitySimple"
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/S_NeoElection-PT-8.tgz
mv S_NeoElection-PT-8 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 S_NeoElection-PT-8, examination is CTLFireabilitySimple"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r162st-ebro-143319441500979"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireabilitySimple" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireabilitySimple" != "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 "CTLFireabilitySimple.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireabilitySimple.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireabilitySimple.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 '' CTLFireabilitySimple.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 ;