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 Philosophers-PT-005000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880800679
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432757232578

Model: Philosophers-PT-005000
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=CTLFireability.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 25000 NrTr: 25000 NrArc: 80000)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:20m51sec

init dd package: 0m2sec


before gc: list nodes free: 3576468

after gc: idd nodes used:11314, unused:63988686; list nodes free:285124424

before gc: list nodes free: 3559214

after gc: idd nodes used:15999, unused:63984001; list nodes free:285087881

before gc: list nodes free: 3546773

after gc: idd nodes used:19594, unused:63980406; list nodes free:285059840

before gc: list nodes free: 3536358

after gc: idd nodes used:22624, unused:63977376; list nodes free:285036206

before gc: list nodes free: 3525220

after gc: idd nodes used:51990, unused:63948010; list nodes free:284896375

before gc: list nodes free: 3496552

after gc: idd nodes used:59709, unused:63940291; list nodes free:284837507

before gc: list nodes free: 3461854

after gc: idd nodes used:70077, unused:63929923; list nodes free:284758451

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

25448 26663 27332 27777 28220 28665 29108 29553 30000 30444 30888 31332 31777 32220 32665 33108 33553 34000 34444 34888 35332 35777 36220 36665 37108 37553 38000 38444 38888 39332 39777 40220 40665 41108 41553 42000 42444 42888 43332 43777 44220 44665 45108 45553 46000 46444 46888 47332 47777 48220 48665 49108 49553 50000 50444 50888 51332 51777 52220 52665 53108 53553 54000 54444 54888 55332 55777 56220 56665 57108 57553 58000 58444 58888 59332 59777 60220 60665 61108 61553 62000 62444 62888 63332 63777 64220 64665 126404

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