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 Railroad-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143800232
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463751275616


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

Net: Railroad_PT_010
(NrP: 118 NrTr: 156 NrArc: 898)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

init dd package: 0m 3.875sec


RS generation: 0m15.453sec


-> reachability set: #nodes 49625 (5.0e+04) #states 2,038,166 (6)



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

checking: EF [3<=pl_P1_1]
normalized: E [true U 3<=pl_P1_1]

abstracting: (3<=pl_P1_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=pl_P7_1]
normalized: E [true U 2<=pl_P7_1]

abstracting: (2<=pl_P7_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [~ [3<=pl_P8_1]]]]
normalized: ~ [E [true U 3<=pl_P8_1]]

abstracting: (3<=pl_P8_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [2<=pl_P66_1]]
normalized: ~ [E [true U 2<=pl_P66_1]]

abstracting: (2<=pl_P66_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [~ [[3<=pl_P37_11 | 2<=pl_P11_1]]]]
normalized: E [true U [3<=pl_P37_11 | 2<=pl_P11_1]]

abstracting: (2<=pl_P11_1) states: 0
abstracting: (3<=pl_P37_11) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [pl_P16_11<=pl_P42_1]
normalized: ~ [E [true U ~ [pl_P16_11<=pl_P42_1]]]

abstracting: (pl_P16_11<=pl_P42_1) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AG [pl_P37_2<=pl_P15_7]
normalized: ~ [E [true U ~ [pl_P37_2<=pl_P15_7]]]

abstracting: (pl_P37_2<=pl_P15_7) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [[pl_P20_4<=pl_P54_1 | 3<=pl_P15_5]]
normalized: ~ [E [true U ~ [[pl_P20_4<=pl_P54_1 | 3<=pl_P15_5]]]]

abstracting: (3<=pl_P15_5) states: 0
abstracting: (pl_P20_4<=pl_P54_1) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [[pl_P63_1<=pl_P32_1 | pl_P47_1<=pl_P35_1]]
normalized: ~ [E [true U ~ [[pl_P63_1<=pl_P32_1 | pl_P47_1<=pl_P35_1]]]]

abstracting: (pl_P47_1<=pl_P35_1) states: 1,533,561 (6)
abstracting: (pl_P63_1<=pl_P32_1) states: 2,038,156 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [[[[pl_P20_1<=pl_P30_1 | pl_P34_1<=pl_P15_5] & 3<=pl_P14_8] & ~ [[1<=pl_P16_1 & 1<=pl_P37_4]]]]
normalized: E [true U [~ [[1<=pl_P16_1 & 1<=pl_P37_4]] & [3<=pl_P14_8 & [pl_P20_1<=pl_P30_1 | pl_P34_1<=pl_P15_5]]]]

abstracting: (pl_P34_1<=pl_P15_5) states: 1,533,504 (6)
abstracting: (pl_P20_1<=pl_P30_1) states: 504,658 (5)
abstracting: (3<=pl_P14_8) states: 0
abstracting: (1<=pl_P37_4) states: 0
abstracting: (1<=pl_P16_1) states: 504,662 (5)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

checking: AG [[[pl_P34_1<=pl_P54_1 | ~ [2<=pl_P37_2]] | [[pl_P20_3<=pl_P37_11 | pl_P22_1<=pl_P37_11] & 2<=pl_P16_3]]]
normalized: ~ [E [true U ~ [[[2<=pl_P16_3 & [pl_P20_3<=pl_P37_11 | pl_P22_1<=pl_P37_11]] | [pl_P34_1<=pl_P54_1 | ~ [2<=pl_P37_2]]]]]]

abstracting: (2<=pl_P37_2) states: 0
abstracting: (pl_P34_1<=pl_P54_1) states: 1,028,899 (6)
abstracting: (pl_P22_1<=pl_P37_11) states: 2,038,155 (6)
abstracting: (pl_P20_3<=pl_P37_11) states: 2,038,134 (6)
abstracting: (2<=pl_P16_3) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: AG [[[[pl_P53_1<=pl_P14_8 | 2<=pl_P61_1] | [pl_P38_1<=pl_P20_10 & 3<=pl_P1_1]] | ~ [[2<=pl_P20_3 & 1<=pl_P37_4]]]]
normalized: ~ [E [true U ~ [[~ [[2<=pl_P20_3 & 1<=pl_P37_4]] | [[pl_P38_1<=pl_P20_10 & 3<=pl_P1_1] | [pl_P53_1<=pl_P14_8 | 2<=pl_P61_1]]]]]]

abstracting: (2<=pl_P61_1) states: 0
abstracting: (pl_P53_1<=pl_P14_8) states: 1,299,736 (6)
abstracting: (3<=pl_P1_1) states: 0
abstracting: (pl_P38_1<=pl_P20_10) states: 1,533,561 (6)
abstracting: (1<=pl_P37_4) states: 0
abstracting: (2<=pl_P20_3) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.130sec

checking: AG [[[~ [1<=pl_P14_8] | [2<=pl_P20_5 | pl_P14_3<=pl_P15_6]] | [[pl_P46_1<=pl_P14_1 & pl_P14_11<=pl_P16_1] | ~ [3<=pl_P60_1]]]]
normalized: ~ [E [true U ~ [[[[2<=pl_P20_5 | pl_P14_3<=pl_P15_6] | ~ [1<=pl_P14_8]] | [~ [3<=pl_P60_1] | [pl_P46_1<=pl_P14_1 & pl_P14_11<=pl_P16_1]]]]]]

abstracting: (pl_P14_11<=pl_P16_1) states: 1,979,117 (6)
abstracting: (pl_P46_1<=pl_P14_1) states: 1,513,876 (6)
abstracting: (3<=pl_P60_1) states: 0
abstracting: (1<=pl_P14_8) states: 546,165 (5)
abstracting: (pl_P14_3<=pl_P15_6) states: 2,035,688 (6)
abstracting: (2<=pl_P20_5) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.300sec

checking: EF [[[[pl_P20_7<=pl_P26_1 & pl_P37_6<=pl_P44_1] & ~ [pl_P16_3<=pl_P14_7]] & [2<=pl_P54_1 & pl_P0_1<=pl_P39_1]]]
normalized: E [true U [[[pl_P20_7<=pl_P26_1 & pl_P37_6<=pl_P44_1] & ~ [pl_P16_3<=pl_P14_7]] & [2<=pl_P54_1 & pl_P0_1<=pl_P39_1]]]

abstracting: (pl_P0_1<=pl_P39_1) states: 1,533,561 (6)
abstracting: (2<=pl_P54_1) states: 0
abstracting: (pl_P16_3<=pl_P14_7) states: 1,668,864 (6)
abstracting: (pl_P37_6<=pl_P44_1) states: 2,038,166 (6)
abstracting: (pl_P20_7<=pl_P26_1) states: 2,038,166 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.147sec

checking: AG [[pl_P51_1<=pl_P0_1 | [[pl_P59_1<=pl_P32_1 & pl_P20_7<=pl_P16_9] | [1<=pl_P37_10 | pl_P15_5<=pl_P14_10]]]]
normalized: ~ [E [true U ~ [[pl_P51_1<=pl_P0_1 | [[1<=pl_P37_10 | pl_P15_5<=pl_P14_10] | [pl_P59_1<=pl_P32_1 & pl_P20_7<=pl_P16_9]]]]]]

abstracting: (pl_P20_7<=pl_P16_9) states: 2,038,166 (6)
abstracting: (pl_P59_1<=pl_P32_1) states: 1,513,875 (6)
abstracting: (pl_P15_5<=pl_P14_10) states: 1,611,781 (6)
abstracting: (1<=pl_P37_10) states: 0
abstracting: (pl_P51_1<=pl_P0_1) states: 1,644,944 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.048sec

checking: AG [[[~ [3<=pl_P51_1] | [3<=pl_P33_1 | 3<=pl_P14_11]] | [[pl_P21_1<=pl_P37_3 | pl_P43_1<=pl_P15_6] | [pl_P20_10<=pl_P3_1 & pl_P26_1<=pl_P13_1]]]]
normalized: ~ [E [true U ~ [[[[pl_P20_10<=pl_P3_1 & pl_P26_1<=pl_P13_1] | [pl_P21_1<=pl_P37_3 | pl_P43_1<=pl_P15_6]] | [[3<=pl_P33_1 | 3<=pl_P14_11] | ~ [3<=pl_P51_1]]]]]]

abstracting: (3<=pl_P51_1) states: 0
abstracting: (3<=pl_P14_11) states: 0
abstracting: (3<=pl_P33_1) states: 0
abstracting: (pl_P43_1<=pl_P15_6) states: 1,658,072 (6)
abstracting: (pl_P21_1<=pl_P37_3) states: 53
abstracting: (pl_P26_1<=pl_P13_1) states: 63
abstracting: (pl_P20_10<=pl_P3_1) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.161sec


Total processing time: 1m17.732sec


BK_STOP 1463751353400

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
pl_P13_1
pl_P15_11
pl_P16_11
pl_P18_1
pl_P1_1
pl_P20_10
pl_P20_11
pl_P20_4
pl_P20_5
pl_P20_6
pl_P20_7
pl_P20_8
pl_P20_9
pl_P24_1
pl_P33_1
pl_P35_1
pl_P37_10
pl_P37_11
pl_P37_2
pl_P37_4
pl_P37_5
pl_P37_6
pl_P37_7
pl_P37_8
pl_P37_9
pl_P39_1
pl_P49_1
pl_P57_1
pl_P64_1
pl_P65_1
pl_P7_1

The net has transition(s) that can never fire:
tr_T14_22
tr_T33_121
tr_T33_110
tr_T33_99
tr_T33_33
tr_T33_44
tr_T33_55
tr_T33_66
tr_T33_77
tr_T33_88

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.000sec

426 696 1122 1854 3276 5666 6597 12236 19161 24144 38079 48527 48783 48950 49333 49769 49559
iterations count:17534 (112), effective:250 (1)

initing FirstDep: 0m 0.000sec

9512 9534 9753 9868 9496 9553 9566 9564 9569 9556 9569 9865 9875 9882 9914 9882 9879 10646 10589 10628 10606 10585 10452 10542 13066 13024 12835 12809 12765 12611 13094 12971 12774 12699 12809 12490 12329 12174 23732 23743 23738 23743 23730 23713 23931 23928 23921 23945 23919 23912 24426 24318 24313 24256 24322 24241 24212 23820 27938 27973 27758 27694 27479 26889 27004 26573 26309 25659 25261 24629 23596 24226 24243 24251 24250 24246 24352 24360 24386 24386 24325 24388 24648 24663 24734 24723 24692 24598 24438 25227 25127 24913 25036 24730 24615 25428 25185 24981 24756 24819 24484 24975 24557 24412 24234 24271 23907 23772 36657 36703 37233 37220 37261 37272 37230 37285 37280 37271 37272 37264 37306 37309 37314 37276 37302 37298 37303 37290 37263 37282 37268 38683 38753 38801 38739 38757 38761 38679 38712 38777 38775 38726 38801 38814 38763 38800 38736 38653 38716 38673 38618 38574 38622 38414 41734 41690 41764 41661 41577 41707 41612 41550 41605 41536 41412 41619 41542 41423 41471 41365 41158 41245 41068 41058 41063 40838 45607 45558 45398 45338 45041 44931 45036 45083 44742 44862 44582 44874 44857 44579 44428 44077 44341 44079 43886 51232 51081 50702 50626 50226 50373 50069 49949 50053 49758 49540 49395 49168 50183 49819 49497 49433 49140 49047 48802 48891 48685 48417 48248
iterations count:219461 (1406), effective:7131 (45)

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="Railroad-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
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/Railroad-PT-010.tgz
mv Railroad-PT-010 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 Railroad-PT-010, 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 r101kn-smll-146369143800232"
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 '' ReachabilityCardinality.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 ;