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-PT-000200, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341205000635
=====================================================================

--------------------
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-000200-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1433660209413

Model: S_Philosophers-PT-000200
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=ReachabilityDeadlock.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 1000 NrTr: 1000 NrArc: 3200)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m2sec


-> reachability set: #nodes 5180 (5.2e+03) #states 265,613,988,875,874,769,338,781,322,035,779,626,829,233,452,653,394,495,974,574,961,739,092,490,901,302,182,994,384,699,044,001 (95)



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

checking: EF [DEADLOCK]
normalized: E [true U DEADLOCK]

-> the formula is TRUE

FORMULA Philosophers-COL-000200-ReachabilityDeadlock-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m49sec


Total processing time: 2m6sec


BK_STOP 1433660336078

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

1496 1940 4292 4465
iterations count:4593 (4), effective:600 (0)

initing FirstDep: 0m0sec

2199 2234 2304 2494 2535 2572 2505 2696 2570 2602 2634 2666 2698 2730 2941 2828 2810 3011 2858 3109 2906 3127 2954 3064 3315 3018 3124 3325 3082 3098 3204 3360 3515 3178 3194 3210 3266 3357 3438 3509 3575 3630 3672 3708 3738 3755 3761 3762 3753 3734 3705 3666 3622 3567 3514 3530 3546 3562 4072 3983 3874 3754 3626 3642 3658 4168 4014 3850 3706 3722 3738 4132 3929 3770 3786 4331 4101 3862 3834 4429 4190 3921 3882 4491 4193 3914 3930 4430 4120 3962 4593 4298 3994 4010 4445 4086 4042 4552 4177 4074 4624 4230 4106 4656 4246 4138 4657 4224 4170 4615 4186 4202 4542 4218 4903 4429 4250 4775 4281 4282 4607 4298 4928 4404 4330 4705 4346 4996 4447 4378 4722 4394 4984 4410 4426 4651 4442 4891 4458 5118 4504 4490 6401 5869 5337 4521 6377 5845 5309 6482 5950 5418 6545 6063 5531 4584 6180 5648 4605 6305 5773 4626 6434 5902 4632 6571 6035 5503 4668 6180 5644 4689 6325 5793 4710 6478 5946 4731 6639 6103 5571 4752 6268 5736 4773 6441 5909 4794 6618 6086 4730 6799 6267 5735 4836 6456 5920 4857 6649 6117 4786 6850 6318 5782 4899 6523 5991 4920 6736 6200 4826 6950 6417 5885 4962 6642 6110 4983 6871 6339 5807 5004 6576 6040 5025 6817 6281 4906 7059 6530 5994 5067 6783 6247 5023 7040 6508 5976 5109 6773 6241 5130 7042 6510 5978 5151 6787 6251 5172 7068 6536 6000 5193 6825 6289 5214 7118 6586 6050 6678 6294 6194 6002 6318 6314 5603 6339 6335 6067 6844 6360 6232 5519 7183 6651 6124 5543 7107 6571 5334 7552 7020 6488 5869 6485 6481 6177
iterations count:287057 (287), effective:40596 (40)

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-PT-000200"
export BK_EXAMINATION="ReachabilityDeadlock"
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-PT-000200.tgz
mv S_Philosophers-PT-000200 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-PT-000200, examination is ReachabilityDeadlock"
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-143341205000635"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.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 ;