About the Execution of Marcie for S_Peterson-COL-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5858.150 | 3600000.00 | 3600373.00 | 30.20 | ????F??????????? | 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-2979
Executing tool marcie
Input is S_Peterson-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146000556
=====================================================================
--------------------
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 Peterson-COL-3-ReachabilityCardinality-0
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-1
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-15
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-2
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-3
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-4
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-5
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-6
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-7
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-8
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464802379042
Marcie rev. 8535M (built: crohr on 2016-04-27)
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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Unfolding complete |P|=256|T|=356|A|=1112
Time for unfolding: 0m 3.595sec
Net: Peterson_COL_3
(NrP: 256 NrTr: 356 NrArc: 1112)
net check time: 0m 0.002sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.024sec
init dd package: 0m 7.350sec
RS generation: 1m40.561sec
-> reachability set: #nodes 86255 (8.6e+04) #states 3,407,946 (6)
starting MCC model checker
--------------------------
checking: EF [~ [[2<=sum(wantSection_process3_true, wantSection_process3_false, wantSection_process2_true, wantSection_process2_false, wantSection_process1_true, wantSection_process1_false, wantSection_process0_true, wantSection_process0_false) | ~ [sum(CS_process3, CS_process2, CS_process1, CS_process0)<=sum(turn_tour2_process3, turn_tour2_process2, turn_tour2_process1, turn_tour2_process0, turn_tour1_process3, turn_tour1_process2, turn_tour1_process1, turn_tour1_process0, turn_tour0_process3, turn_tour0_process2, turn_tour0_process1, turn_tour0_process0)]]]]
normalized: E [true U ~ [[2<=sum(wantSection_process3_true, wantSection_process3_false, wantSection_process2_true, wantSection_process2_false, wantSection_process1_true, wantSection_process1_false, wantSection_process0_true, wantSection_process0_false) | ~ [sum(CS_process3, CS_process2, CS_process1, CS_process0)<=sum(turn_tour2_process3, turn_tour2_process2, turn_tour2_process1, turn_tour2_process0, turn_tour1_process3, turn_tour1_process2, turn_tour1_process1, turn_tour1_process0, turn_tour0_process3, turn_tour0_process2, turn_tour0_process1, turn_tour0_process0)]]]]
abstracting: (sum(CS_process3, CS_process2, CS_process1, CS_process0)<=sum(turn_tour2_process3, turn_tour2_process2, turn_tour2_process1, turn_tour2_process0, turn_tour1_process3, turn_tour1_process2, turn_tour1_process1, turn_tour1_process0, turn_tour0_process3, turn_tour0_process2, turn_tour0_process1, turn_tour0_process0)) states: 3,407,946 (6)
abstracting: (2<=sum(wantSection_process3_true, wantSection_process3_false, wantSection_process2_true, wantSection_process2_false, wantSection_process1_true, wantSection_process1_false, wantSection_process0_true, wantSection_process0_false)) states: 3,407,946 (6)
-> the formula is FALSE
FORMULA Peterson-COL-3-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.457sec
checking: AG [sum(testIdentity_process3_tour2_process3, testIdentity_process3_tour2_process2, testIdentity_process3_tour2_process1, testIdentity_process3_tour2_process0, testIdentity_process3_tour1_process3, testIdentity_process3_tour1_process2, testIdentity_process3_tour1_process1, testIdentity_process3_tour1_process0, testIdentity_process3_tour0_process3, testIdentity_process3_tour0_process2, testIdentity_process3_tour0_process1, testIdentity_process3_tour0_process0, testIdentity_process2_tour2_process3, testIdentity_process2_tour2_process2, testIdentity_process2_tour2_process1, testIdentity_process2_tour2_process0, testIdentity_process2_tour1_process3, testIdentity_process2_tour1_process2, testIdentity_process2_tour1_process1, testIdentity_process2_tour1_process0, testIdentity_process2_tour0_process3, testIdentity_process2_tour0_process2, testIdentity_process2_tour0_process1, testIdentity_process2_tour0_process0, testIdentity_process1_tour2_process3, testIdentity_process1_tour2_process2, testIdentity_process1_tour2_process1, testIdentity_process1_tour2_process0, testIdentity_process1_tour1_process3, testIdentity_process1_tour1_process2, testIdentity_process1_tour1_process1, testIdentity_process1_tour1_process0, testIdentity_process1_tour0_process3, testIdentity_process1_tour0_process2, testIdentity_process1_tour0_process1, testIdentity_process1_tour0_process0, testIdentity_process0_tour2_process3, testIdentity_process0_tour2_process2, testIdentity_process0_tour2_process1, testIdentity_process0_tour2_process0, testIdentity_process0_tour1_process3, testIdentity_process0_tour1_process2, testIdentity_process0_tour1_process1, testIdentity_process0_tour1_process0, testIdentity_process0_tour0_process3, testIdentity_process0_tour0_process2, testIdentity_process0_tour0_process1, testIdentity_process0_tour0_process0)<=sum(wantSection_process3_true, wantSection_process3_false, wantSection_process2_true, wantSection_process2_false, wantSection_process1_true, wantSection_process1_false, wantSection_process0_true, wantSection_process0_false)]
normalized: ~ [E [true U ~ [sum(testIdentity_process3_tour2_process3, testIdentity_process3_tou
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
testAlone_process0_tour1_process0
testAlone_process2_tour0_process2
testAlone_process2_tour1_process2
testAlone_process2_tour2_process2
testAlone_process3_tour0_process3
testAlone_process0_tour2_process0
testAlone_process1_tour0_process1
testAlone_process1_tour1_process1
testAlone_process1_tour2_process1
testAlone_process0_tour0_process0
testAlone_process3_tour1_process3
testAlone_process3_tour2_process3
The net has transition(s) that can never fire:
notAlone_1_2_1
notAlone_1_1_1
notAlone_2_1_2
alone1_3_0_3
notAlone_0_0_0
notAlone_0_1_0
notAlone_1_0_1
notAlone_2_0_2
notAlone_0_2_0
alone1_2_2_2
notAlone_2_2_2
notAlone_3_0_3
notAlone_3_1_3
notAlone_3_2_3
alone1_0_0_0
alone1_1_0_1
alone1_0_1_0
alone1_1_1_1
alone1_0_2_0
alone1_1_2_1
alone1_2_0_2
alone1_2_1_2
alone1_3_1_3
alone1_3_2_3
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: 0m 0.004sec
980 1400 1631 1883 2452 2342 2534 2710 2375 2375 3425 4164 4547 4747 4958 6125 6336 6567 6449 6508 6504 6574 6668 6441 6572 6281 6289 6618 6559 8800 10039 12464 12861 13738 13653 13822 13919 13819 13392 16249 16275 16483 16981 17301 17317 17382 17693 19152 19440 19486 19639 19629 19746 20045 19781 19851 19654 20109 20129 19938 19840 19799 19892 19861 20176 22448 23018 22984 23709 24061 24555 24179 24892 24828 25006 24973 24752 24462 28860 29235 30225 30529 30738 31372 33079 36996 37710 38545 38495 38249 38887 38821 38676 38458 40513 40619 41184 41088 40514 40893 40984 40863 40559 40982 42256 42329 42409 42552 42034 42124 42260 42216 42113 42198 42264 42371 42169 42106 42096 41987 42229 42017 44001 44534 43982 43802 44835 45226 46214 47780 47934 48292 48165 48243 48371 48322 48192 47831 47643 49031 50112 50656 50762 50558 50189 50867 50724 50588 50370 50832 50852 51147 51519 50890 51750 51513 51839 51918 51863 51809 51712 51634 51189 51279 51236 50737 57124 57424 58178 58528 59290 59566 59644 59849 59845 60579 62672 63008 63984 68847 70057 70099 70955 71188 70898 71155 71001 71737 71697 71400 71200 71795 71724 71570 72762 74086 74406 74111 74025 73974 74177 75081 76052 76561 76138 76978 76910 79126 79419 79252 79577 79782 79374 79388 79265 79849 79743 79661 79348 80399 80524 80596 80865 81841 81907 81616 82284 83013 81453 81938 81592 82264 82074 82133 82235 82242 82002 81886 82049 82087 81997 81817 81547 81649 81892 81767 81964 81196 80620 80546 80253 80520 80962 80982 81381 81447 81324 81188 80968 81329 81401 81499 81638 82475 82994 82823 83016 82790 82439 82343 82200 82257 81983 82309 82291 82215 81963 81993 82212 84256 84456 84222 85148 86481 87076 87236 87516 87396 87921 87796 87873 88001 87952 87822 87111 87788 88329 87545 87256 87013 87071 87054 86772 87271 86975 87061 86726 86404 86564 86196 85886 87469 88128 88395 88808 89516 89399 89850 89224 89620 89495 89520 90158 90193 89806 89386 89332 90000 89887 89720 89421 89298 89635 90141 90014 89655 88898 88266 87393
iterations count:339183 (952), effective:9637 (27)
initing FirstDep: 0m 0.001sec
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_Peterson-COL-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_Peterson-COL-3.tgz
mv S_Peterson-COL-3 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Peterson-COL-3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r173kn-ebro-146433146000556"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;