About the Execution of Marcie for S_Philosophers-COL-005000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8399.430 | 3600000.00 | 3600038.00 | 10.10 | [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-2270
Executing tool marcie
Input is S_Philosophers-COL-005000, examination is CTLFireabilitySimple
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204900511
=====================================================================
--------------------
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-CTLFireabilitySimple-0
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-1
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-10
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-11
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-12
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-13
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-14
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-15
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-2
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-3
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-4
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-5
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-6
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-7
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-8
FORMULA_NAME Philosophers-COL-005000-CTLFireabilitySimple-9
=== Now, execution of the tool begins
BK_START 1433653969403
Model: S_Philosophers-COL-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=CTLFireabilitySimple.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
Unfolding complete |P|=25000|T|=25000|A|=80000
Time for unfolding: 0m0sec
(NrP: 25000 NrTr: 25000 NrArc: 80000)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:13m56sec
init dd package: 0m3sec
before gc: list nodes free: 3577488
after gc: idd nodes used:11314, unused:63988686; list nodes free:285125444
before gc: list nodes free: 3560234
after gc: idd nodes used:15999, unused:63984001; list nodes free:285088901
before gc: list nodes free: 3547793
after gc: idd nodes used:19594, unused:63980406; list nodes free:285060860
before gc: list nodes free: 3537378
after gc: idd nodes used:22624, unused:63977376; list nodes free:285037226
before gc: list nodes free: 3526222
after gc: idd nodes used:50846, unused:63949154; list nodes free:284902411
before gc: list nodes free: 3497554
after gc: idd nodes used:58565, unused:63941435; list nodes free:284843543
before gc: list nodes free: 3462856
after gc: idd nodes used:68933, unused:63931067; list nodes free:284764487
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: 0m9sec
25496 25940 26384 26828 27273 27716 28161 28604 29049 29496 29940 30384 30828 31273 31716 32161 32604 33049 33496 33940 34384 34828 35273 35716 36161 36604 37049 37496 37940 38384 38828 39273 39716 40161 40604 41049 41496 41940 42384 42828 43273 43716 44161 44604 45049 45496 45940 46384 46828 47273 47716 48161 48604 49049 49496 49940 50384 50828 51273 51716 52161 52604 53049 53496 53940 54384 54828 55273 55716 56161 56604 57049 109100 109100 109100 109100
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_Philosophers-COL-005000"
export BK_EXAMINATION="CTLFireabilitySimple"
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/S_Philosophers-COL-005000.tgz
mv S_Philosophers-COL-005000 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_Philosophers-COL-005000, 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 r204st-blw3-143341204900511"
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 '
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 ;