fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r246su-smll-143368767200190
Last Updated
August 19, 2015

About the Execution of Marcie for Raft-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4272.170 84725.00 83989.00 40.20 TTTTTTTTTTTTTTTT normal

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 Raft-PT-06, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r246su-smll-143368767200190
=====================================================================


--------------------
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 Raft-PT-06-ReachabilityBounds-0
FORMULA_NAME Raft-PT-06-ReachabilityBounds-1
FORMULA_NAME Raft-PT-06-ReachabilityBounds-10
FORMULA_NAME Raft-PT-06-ReachabilityBounds-11
FORMULA_NAME Raft-PT-06-ReachabilityBounds-12
FORMULA_NAME Raft-PT-06-ReachabilityBounds-13
FORMULA_NAME Raft-PT-06-ReachabilityBounds-14
FORMULA_NAME Raft-PT-06-ReachabilityBounds-15
FORMULA_NAME Raft-PT-06-ReachabilityBounds-2
FORMULA_NAME Raft-PT-06-ReachabilityBounds-3
FORMULA_NAME Raft-PT-06-ReachabilityBounds-4
FORMULA_NAME Raft-PT-06-ReachabilityBounds-5
FORMULA_NAME Raft-PT-06-ReachabilityBounds-6
FORMULA_NAME Raft-PT-06-ReachabilityBounds-7
FORMULA_NAME Raft-PT-06-ReachabilityBounds-8
FORMULA_NAME Raft-PT-06-ReachabilityBounds-9

=== Now, execution of the tool begins

BK_START 1433899474120

Model: Raft-PT-06
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 188 NrTr: 332 NrArc: 1231)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 1m18sec


-> reachability set: #nodes 14709 (1.5e+04) #states 290,943,857,237,679,643,228,538,581 (26)



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

checking: maxVal(p125)<=2
normalized: maxVal(p125)<=2

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p117)<=2
normalized: maxVal(p117)<=2

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p174)<=3 & [[[maxVal(p131)<=2 & [maxVal(p147)<=3 & [maxVal(p33)<=3 & maxVal(p1)<=2]]] & [[[maxVal(p176)<=2 & maxVal(p139)<=3] & [maxVal(p149)<=2 & maxVal(p93)<=1]] & maxVal(p160)<=3]] & [maxVal(p177)<=3 & maxVal(p43)<=1]]]
normalized: [maxVal(p174)<=3 & [[[maxVal(p131)<=2 & [maxVal(p147)<=3 & [maxVal(p33)<=3 & maxVal(p1)<=2]]] & [maxVal(p160)<=3 & [[maxVal(p176)<=2 & maxVal(p139)<=3] & [maxVal(p149)<=2 & maxVal(p93)<=1]]]] & [maxVal(p177)<=3 & maxVal(p43)<=1]]]

abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p71)<=2 & maxVal(p40)<=2]
normalized: [maxVal(p71)<=2 & maxVal(p40)<=2]

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p19)<=2 & [maxVal(p158)<=1 & maxVal(p20)<=2]]
normalized: [maxVal(p19)<=2 & [maxVal(p158)<=1 & maxVal(p20)<=2]]

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(p182)<=2 & maxVal(p186)<=2] & [maxVal(p37)<=3 & maxVal(p182)<=3]] & [maxVal(p130)<=1 & maxVal(p178)<=3]] & maxVal(p136)<=1]
normalized: [maxVal(p136)<=1 & [[maxVal(p130)<=1 & maxVal(p178)<=3] & [[maxVal(p182)<=2 & maxVal(p186)<=2] & [maxVal(p37)<=3 & maxVal(p182)<=3]]]]

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p180)<=1
normalized: maxVal(p180)<=1

abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p15)<=3
normalized: maxVal(p15)<=3

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p159)<=2
normalized: maxVal(p159)<=2

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p105)<=1 & maxVal(p56)<=3] & maxVal(p26)<=3] & maxVal(p68)<=3]
normalized: [maxVal(p68)<=3 & [maxVal(p26)<=3 & [maxVal(p105)<=1 & maxVal(p56)<=3]]]

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p143)<=3
normalized: maxVal(p143)<=3

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p103)<=2
normalized: maxVal(p103)<=2

abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p173)<=3
normalized: maxVal(p173)<=3

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p89)<=3
normalized: maxVal(p89)<=3

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p124)<=3 & maxVal(p140)<=1]
normalized: [maxVal(p124)<=3 & maxVal(p140)<=1]

abstracting: (1<=1) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p28)<=3 & maxVal(p97)<=3] & maxVal(p109)<=3] & maxVal(p29)<=2]
normalized: [maxVal(p29)<=2 & [maxVal(p109)<=3 & [maxVal(p28)<=3 & maxVal(p97)<=3]]]

abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=3) states: 290,943,857,237,679,643,228,538,581 (26)
abstracting: (1<=2) states: 290,943,857,237,679,643,228,538,581 (26)
-> the formula is TRUE

FORMULA Raft-PT-06-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 1m24sec


BK_STOP 1433899558845

--------------------
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

388 443 697 701 702 703 704 717 799 813 782 800 847 861 831 861 943 926 928 848 1118 1705 1992 1932 1860 1931 2383 2292 2390 2249 1923 2110 2168 2082 2380 2038 2084 2084 2388 1962 2037 2177 2437 2069 2081 2049 2433 2169 1826 2091 2349 2095 2089 1947 2306 2097 2186 2270 2204 2190 2200 2434 2084 2062 2204 2424 1851 1961 2110 2362 2186 2097 2066 2457 2109 1833 2109 2371 2171 1930 1794 2080 3456 3953 3651 3959 3834 4603 4977 5247 4931 4939 4445 5419 5195 6016 5785 5601 4898 5439 5177 5498 5272 4754 4050 4588 4326 5167 4938 4768 4063 4311 4349 5022 5054 4806 4567 4416 4628 4748 5394 4903 4903 4383 3575 4327 5524 4637 4958 4772 3868 4257 4383 5056 4723 4841 4275 3576 4344 4432 3967 4343 4471 5061 4929 4681 4892 4301 4431 4169 4171 4313 4263 5600 4881 4913 5001 4329 3635 4209 4169 3847 4395 4961 4977 4945 4683 4857 4177 4207 4171 4059 4425 4177 5264 4555 4723 5005 4335 4197 4267 4280 3679 4414 5611 4724 4726 4980 4750 4043 4220 4502 3830 4446 4184 5145 4804 4792 4971 3959 4354 4472 4158 3637 4224 5615 4896 4886 5016 4558 3650 4414 4506 4041 4222 4476 5136 4948 4986 4911 4320 4450 4490 4146 3703 3887 3647 3733 3749 6905 7007 7911 7027 7843 8451 8695 8559 8521 7823 9239 8987 10387 10320 10395 9296 10167 10099 10303 10139 9555 8143 9463 9051 13551 12884 12523 11192 11483 12019 12231 12007 11421 10075 11119 10767 13603 12936 12581 11514 11927 12007 12239 12071 11619 10139 10807 11231 12331 11401 10977 10872 10623 10379 9557 9544 9695 8408 7841 8815 8191 11123 10471 10095 9113 9493 9661 9861 9621 9251 8287 7129 8669 8749 9851 9799 10537 9287 9623 10159 10303 9707 9334 8368 7201 8651 8819 9921 9869 10901 9919 10379 10523 10667 9812 10055 8299 8703 9443 9567 11927 11275 11079 9905 10357 10481 9897 9798 9364 7993 7905 8686 8434 11186 9826 11117 10532 9695 9263 9841 9107 9677 9064 8360 8697 8889 8885 10723 9925 9950 8922 9683 10219 10363 9936 9624 8053 8058 8707 8455 11207 9777 11138 10553 10376 10448 9964 10720 10466 9977 9145 8743 9414 9582 10684 10632 10663 10599 10393 10041 10619 9885 10455 9278 8378 7152 8345 8881 8679 8631 8231 7433 8831 9055 9051 10889 10091 10116 9088 9986 9582 10044 9730 9959 9705 8528 7294 9039 8419 8821 8773 8373 7709 7293 8889 8997 10891 10815 10340 9358 9820 9468 10046 9312 9961 9707 8142 8128 8873 8997 8413 8339 8471 8025 7318 8491 9027 10965 10817 10342 9360 9438 9854 10048 9754 9967 9775 8144 8130 8483 8427 8415 8399 8339 8027 7394 8805 8973 10075 10023 10054 9990 9560 9872 9388 10144 9969 9843 8556 8210 8781 8609 9079 8765 8994 8392 7580 7744 7136 7911 8807 7455 13899 14087 15937 15937 16684 15877 17317 15165 14909 15917 17617 17029 17655 16607 17400 18089 15855 16729 17625 17689 17285 17189 17065 16437 17478 16433 15335 16169 16169 20153 18681 22801 24629 25459 25973 24236 22717 24373 21431 22289 22473 21489 23045 22915 23781 22292 21485 22741 20547 22569 22465 21153 21989 22347 22499 21698 20813 20965 19155 20479 23225 23961 23681 29637 28285 26971 29961 29164 27397 28155 24841 26841 25401 26701 26081 25451 26907 26628 26109 25523 24977 25489 24369 24341 23689 22841 23609 23948 22125 22443 21335 20465 23833 23561 23681 26085 24465 25919 24091 26604 25709 24087 24233 23673 24081 23029 21665 23031 21435 22772 22453 19531 21721 21961 21761 20117 19025 19789 18881 20148 19041 17187 17527 16577 19865 18585 24461 23109 24323 24761 21558 22197 23049 19839 21393 20625 21581 20953 20315 21763 21492 20449 20379 20129 20369 20393 19225 19193 19073 19833 20180 18349 18675 17583 16681 14627 17983 17879 16887 21927 21759 23153 21789 23792 21561 23025 21305 22089 20433 20409 20377 20903 21773 19460 20471 20217 17847 20697 19601 20569 19517 20215 20359 19566 18669 18947 17125 18611 18129 19287 20183 19903 24779 21823 24593 25015 23331 22713 23475 20253 21869 21749 22125 22309 19913 21385 19777 21108 20797 17839 20141 20221 20341 19885 19789 18925 18297 19288 18253 17119 17919 16849 15091 17407 18231 18551 22535 20559 22829 21013 23592 22751 21209 21561 21545 21345 21585 20793 20479 19431 20192 19889 17619 18421 19317 19381 18149 18117 17817 18581 18936 17093 17525 17579 17029 14751 18343 17919 16927 21967 21799 21769 20513 22516 21691 20149 19557 20021 20173 20597 18849 20385 19265 20024 18973 18903 18881 19665 18009 17985 17953 17833 18597 18952 17109 17543 17599 17053 14771 18410 17146 18202 22018 21850 22882 23304 20084 20736 21760 18532 20052 19460 20420 19820 18904 20368 18760 20045 19720 16756 19152 19552 19352 18896 18800 17908 18672 19075 17226 17666 17776 17260 14864 19198 18942 18806 24834 23462 24726 25116 23438 21904 23572 20648 22296 21872 20880 22400 20868 20716 22180 21841 20784 20708 20788 20036 20996 21236 20584 21084 21222 20452 19574 19870 18042 19588 18520 14819 18244 17500 20444 22156 22052 21980 20724 22723 21898 20350 20078 20718 20430 19198 19050 20390 21244 18919 19626 19118 16742 19754 18666 18202 19034 18226 18810 17902 19229 18196 17056 17914 16882 14860 18394 17970 18330 22034 20394 20330 21858 22585 20228 21692 19636 20212 20252 20436 19784 20284 21122 19635 18732 18996 16772 18880 19064 19424 19024 17928 18760 18688 19099 17242 17682 17792 17276 14880 18097 17993 18337 22041 20401 20337 21865 22592 20235 21699 19995 19931 20259 20443 19791 20291 21129 19642 18739 19003 16779 19511 19087 18095 18919 18083 17931 18695 19098 17249 17689 17799 17283 14887 14698 19685 18917 19973 23789 23621 24653 25075 24340 22507 23447 20303 22303 20863 22191 20687 20675 22139 20531 21816 21491 18527 21275 21003 21123 20667 19831 19679 20443 20846 18997 19437 19547 19031 16635 16585 18147 17203 18259 22075 21907 22939 23361 22626 20793 21817 18589 20429 19149 20477 18973 18961 20425 18817 20102 19777 16813 19561 19289 19409 18953 18857 17965 18729 19132 17283 17723 17833 17317 14921 14871 18415 17991 18351 22055 20415 20351 21879 22606 20249 21713 19657 20233 20273 20457 19805 20305 21143 19656 18753 19017 16793 18901 19085 19445 19045 17949 18781 18709 19120 17263 17703 17813 17297 14901 14709
iterations count:1057083 (3183), effective:21277 (64)

initing FirstDep: 0m0sec

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