fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r204st-blw3-143341204800492
Last Updated
August 19, 2015

About the Execution of Marcie for S_Philosophers-COL-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8277.390 3600000.00 3600029.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-001000, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204800492
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1433653146404

Model: S_Philosophers-COL-001000
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

Unfolding complete |P|=5000|T|=5000|A|=16000
Time for unfolding: 0m0sec

(NrP: 5000 NrTr: 5000 NrArc: 16000)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 1m36sec


-> reachability set: #nodes 25980 (2.6e+04) #states 1,322,070,819,480,806,636,890,455,259,752,144,365,965,422,032,752,148,167,664,920,368,226,828,597,346,704,899,540,778,313,850,608,061,963,909,777,696,872,582,355,950,954,582,100,618,911,865,342,725,257,953,674,027,620,225,198,320,803,878,014,774,228,964,841,274,390,400,117,588,618,041,128,947,815,623,094,438,061,566,173,054,086,674,490,506,178,125,480,344,405,547,054,397,038,895,817,465,368,254,916,136,220,830,268,563,778,582,290,228,416,398,307,887,896,918,556,404,084,898,937,609,373,242,171,846,359,938,695,516,765,018,940,588,109,060,426,089,671,438,864,102,814,350,385,648,747,165,832,010,614,366,132,173,102,768,902,855,220,001 (477)



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

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


before gc: list nodes free: 6342722

after gc: idd nodes used:50574, unused:63949426; list nodes free:284946482

before gc: list nodes free: 16319173

after gc: idd nodes used:50239, unused:63949761; list nodes free:284946774

before gc: list nodes free: 16302474

after gc: idd nodes used:49269, unused:63950731; list nodes free:284950402

before gc: list nodes free: 16284264

after gc: idd nodes used:49039, unused:63950961; list nodes free:284950606

before gc: list nodes free: 16266239

after gc: idd nodes used:49124, unused:63950876; list nodes free:284949798

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

5452 5896 6341 6784 7229 7672 8117 8564 9008 9452 9896 10341 10784 11229 11672 12117 12564 25971 25971 25971 25971 25971 25980 25980 25980 25980 25980
iterations count:27983 (5), effective:3000 (0)

initing FirstDep: 0m0sec

10178 10266 10330 10483 10442 10614 10557 10745 10602 10654 10716 10747 10736 10762 10794 10970 10842 10874 10975 10922 11037 10970 11011 11266 11034 11130 11346 11098 11114 11284 11451 11178 11194 11210 11326 11442 11548 11644 11306 11322 11338 11354 11370 11386 11402 11418 11434 11450 11466 11482 11498 11514 11984 11934 11871 11802 11727 11639 11610 11626 11642 12156 12032 11899 11755 11706 11722 12279 12108 11929 11770 11786 11802 12167 11953 11834 11850 12329 12086 11882 11898 12403 12134 11930 11946 12396 12101 11978 11994 12309 12010 12026 12481 12137 12058 12618 12254 12090 12719 12336 12122 12782 12383 12154 12808 12390 12186 12796 12362 12218 12748 12294 12250 12665 12266 12282 12546 12298 12888 12389 12330 12710 12346 13026 12501 12378 12798 12394 13084 12530 12426 12800 12442 13057 12478 12474 12719 12490 12950 12506 13176 12557 12538 12762 12554 12958 12570 13145 12586 13321 12657 12618 12817 12634 12964 12650 13105 12666 13240 12682 13362 12698 13473 12744 13581 12840 12746 12926 12762 13002 12778 13073 12794 13129 12810 13180 12826 13221 12842 13252 12858 13273 12874 13284 12890 13290 12906 13281 12922 13267 12938 13243 12954 13209 12970 13170 12986 13116 13002 13057 13891 13018 13818 13034 13739 13050 13654 13066 13556 13082 13447 13098 13333 13114 13209 14043 13130 13909 13146 13766 13162 13612 13178 13452 13194 13279 14114 13210 13935 13226 13746 13242 13547 13258 13338 14173 13274 13954 13290 13730 13306 13496 14330 13322 14086 13338 13833 13354 13569 14404 13370 14130 13386 13851 13402 13562 14392 13418 14093 13434 13788 13450 13470 14304 13466 13976 13482 13642 14472 13498 14128 13514 13774 14609 13530 14245 13546 13871 13562 13562 14326 13578 13933 13594 13594 14369 13610 13960 13626 13626 14375 13642 13947 14781 13658 14343 13674 13899 14729 13690 14275 13706 13811 14646 13722 14172 13738 13738 14523 13754 14033 14864 13770 14365 13786 13856 14686 13802 14167 15002 13818 14473 13834 13938 14769 13850 14225 15055 13866 14501 13882 13937 14771 13898 14197 15028 13914 14444 13930 13930 14685 13946 14086 14920 13962 14307 15142 13978 14523 13994 13994 14724 14010 14089 14920 14026 14275 15106 14042 14452 15282 14058 14618

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-001000"
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-COL-001000.tgz
mv S_Philosophers-COL-001000 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-001000, 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-143341204800492"
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 ;