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_Railroad-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128200228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464571295888


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=CTLCardinality.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.001sec

init dd package: 0m 3.717sec


RS generation: 0m15.107sec


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



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

checking: ~ [~ [EG [~ [1<=pl_P37_6]]]]
normalized: EG [~ [1<=pl_P37_6]]

abstracting: (1<=pl_P37_6) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AF [EF [3<=pl_P11_1]]
normalized: ~ [EG [~ [E [true U 3<=pl_P11_1]]]]

abstracting: (3<=pl_P11_1) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

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

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

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

MC time: 0m 4.596sec

checking: EF [AG [[2<=pl_P53_1 & 3<=pl_P20_1]]]
normalized: E [true U ~ [E [true U ~ [[2<=pl_P53_1 & 3<=pl_P20_1]]]]]

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

FORMULA Railroad-PT-010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AG [EF [[pl_P37_7<=pl_P37_6 | pl_P20_7<=pl_P47_1]]]
normalized: ~ [E [true U ~ [E [true U [pl_P37_7<=pl_P37_6 | pl_P20_7<=pl_P47_1]]]]]

abstracting: (pl_P20_7<=pl_P47_1) states: 2,038,166 (6)
abstracting: (pl_P37_7<=pl_P37_6) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [~ [[3<=pl_P14_11 & 1<=pl_P19_1]] U pl_P58_1<=pl_P37_9]
normalized: [~ [E [~ [pl_P58_1<=pl_P37_9] U [~ [pl_P58_1<=pl_P37_9] & [3<=pl_P14_11 & 1<=pl_P19_1]]]] & ~ [EG [~ [pl_P58_1<=pl_P37_9]]]]

abstracting: (pl_P58_1<=pl_P37_9) states: 1,028,899 (6)
.
EG iterations: 1
abstracting: (1<=pl_P19_1) states: 1,009,267 (6)
abstracting: (3<=pl_P14_11) states: 0
abstracting: (pl_P58_1<=pl_P37_9) states: 1,028,899 (6)
abstracting: (pl_P58_1<=pl_P37_9) states: 1,028,899 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.179sec

checking: AG [AG [[pl_P14_11<=pl_P14_6 & pl_P20_5<=pl_P34_1]]]
normalized: ~ [E [true U E [true U ~ [[pl_P14_11<=pl_P14_6 & pl_P20_5<=pl_P34_1]]]]]

abstracting: (pl_P20_5<=pl_P34_1) states: 2,038,166 (6)
abstracting: (pl_P14_11<=pl_P14_6) states: 1,979,117 (6)
-> the formula is FALSE

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

MC time: 1m19.528sec

checking: [[AF [2<=pl_P3_1] | AX [1<=pl_P44_1]] | EG [EG [pl_P14_3<=pl_P15_9]]]
normalized: [EG [EG [pl_P14_3<=pl_P15_9]] | [~ [EX [~ [1<=pl_P44_1]]] | ~ [EG [~ [2<=pl_P3_1]]]]]

abstracting: (2<=pl_P3_1) states: 0

EG iterations: 0
abstracting: (1<=pl_P44_1) states: 504,605 (5)
.abstracting: (pl_P14_3<=pl_P15_9) states: 2,035,688 (6)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 3.306sec

checking: [AX [EF [3<=pl_P15_3]] | ~ [~ [~ [[2<=pl_P13_1 | pl_P5_1<=pl_P15_3]]]]]
normalized: [~ [[2<=pl_P13_1 | pl_P5_1<=pl_P15_3]] | ~ [EX [~ [E [true U 3<=pl_P15_3]]]]]

abstracting: (3<=pl_P15_3) states: 0
.abstracting: (pl_P5_1<=pl_P15_3) states: 1,644,944 (6)
abstracting: (2<=pl_P13_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: [[AG [pl_P37_5<=pl_P14_1] | [AF [2<=pl_P62_1] & EF [1<=pl_P16_9]]] | EG [3<=pl_P20_8]]
normalized: [EG [3<=pl_P20_8] | [~ [E [true U ~ [pl_P37_5<=pl_P14_1]]] | [E [true U 1<=pl_P16_9] & ~ [EG [~ [2<=pl_P62_1]]]]]]

abstracting: (2<=pl_P62_1) states: 0

EG iterations: 0
abstracting: (1<=pl_P16_9) states: 504,662 (5)
abstracting: (pl_P37_5<=pl_P14_1) states: 2,038,166 (6)
abstracting: (3<=pl_P20_8) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.935sec

checking: ~ [E [[pl_P42_1<=pl_P15_3 & pl_P15_4<=pl_P16_6] U [2<=pl_P20_1 | 2<=pl_P9_1]]]
normalized: ~ [E [[pl_P42_1<=pl_P15_3 & pl_P15_4<=pl_P16_6] U [2<=pl_P20_1 | 2<=pl_P9_1]]]

abstracting: (2<=pl_P9_1) states: 0
abstracting: (2<=pl_P20_1) states: 0
abstracting: (pl_P15_4<=pl_P16_6) states: 1,658,072 (6)
abstracting: (pl_P42_1<=pl_P15_3) states: 1,658,072 (6)
-> the formula is TRUE

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

MC time: 0m 0.147sec

checking: [AX [EG [pl_P59_1<=pl_P53_1]] | [~ [AG [pl_P19_1<=pl_P15_11]] & pl_P11_1<=pl_P61_1]]
normalized: [[pl_P11_1<=pl_P61_1 & E [true U ~ [pl_P19_1<=pl_P15_11]]] | ~ [EX [~ [EG [pl_P59_1<=pl_P53_1]]]]]

abstracting: (pl_P59_1<=pl_P53_1) states: 1,776,022 (6)
.
EG iterations: 1
.abstracting: (pl_P19_1<=pl_P15_11) states: 1,028,899 (6)
abstracting: (pl_P11_1<=pl_P61_1) states: 2,038,154 (6)
-> the formula is TRUE

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

MC time: 0m19.994sec

checking: EX [[EG [pl_P51_1<=pl_P45_1] & [~ [3<=pl_P16_3] | [pl_P26_1<=pl_P3_1 & 1<=pl_P37_10]]]]
normalized: EX [[[[pl_P26_1<=pl_P3_1 & 1<=pl_P37_10] | ~ [3<=pl_P16_3]] & EG [pl_P51_1<=pl_P45_1]]]

abstracting: (pl_P51_1<=pl_P45_1) states: 1,513,872 (6)
.
EG iterations: 1
abstracting: (3<=pl_P16_3) states: 0
abstracting: (1<=pl_P37_10) states: 0
abstracting: (pl_P26_1<=pl_P3_1) states: 524,351 (5)
.-> the formula is TRUE

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

MC time: 0m 0.244sec

checking: EG [[[[1<=pl_P21_1 | 3<=pl_P15_4] | [pl_P20_4<=pl_P14_1 | pl_P3_1<=pl_P16_9]] | AF [2<=pl_P16_10]]]
normalized: EG [[~ [EG [~ [2<=pl_P16_10]]] | [[pl_P20_4<=pl_P14_1 | pl_P3_1<=pl_P16_9] | [1<=pl_P21_1 | 3<=pl_P15_4]]]]

abstracting: (3<=pl_P15_4) states: 0
abstracting: (1<=pl_P21_1) states: 2,038,113 (6)
abstracting: (pl_P3_1<=pl_P16_9) states: 1,513,872 (6)
abstracting: (pl_P20_4<=pl_P14_1) states: 2,038,166 (6)
abstracting: (2<=pl_P16_10) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.182sec

checking: [~ [~ [[[3<=pl_P16_3 | 2<=pl_P45_1] & [2<=pl_P53_1 | 1<=pl_P32_1]]]] | [EF [[2<=pl_P54_1 & 2<=pl_P16_8]] | [2<=pl_P0_1 | ~ [~ [1<=pl_P48_1]]]]]
normalized: [[[2<=pl_P0_1 | 1<=pl_P48_1] | E [true U [2<=pl_P54_1 & 2<=pl_P16_8]]] | [[2<=pl_P53_1 | 1<=pl_P32_1] & [3<=pl_P16_3 | 2<=pl_P45_1]]]

abstracting: (2<=pl_P45_1) states: 0
abstracting: (3<=pl_P16_3) states: 0
abstracting: (1<=pl_P32_1) states: 33
abstracting: (2<=pl_P53_1) states: 0
abstracting: (2<=pl_P16_8) states: 0
abstracting: (2<=pl_P54_1) states: 0
abstracting: (1<=pl_P48_1) states: 11
abstracting: (2<=pl_P0_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.134sec

checking: [AG [[[pl_P16_5<=pl_P37_5 & 2<=pl_P37_7] & pl_P54_1<=pl_P59_1]] | [E [pl_P2_1<=pl_P14_3 U pl_P24_1<=pl_P29_1] & [EG [pl_P15_8<=pl_P15_6] & ~ [1<=pl_P54_1]]]]
normalized: [~ [E [true U ~ [[pl_P54_1<=pl_P59_1 & [pl_P16_5<=pl_P37_5 & 2<=pl_P37_7]]]]] | [[EG [pl_P15_8<=pl_P15_6] & ~ [1<=pl_P54_1]] & E [pl_P2_1<=pl_P14_3 U pl_P24_1<=pl_P29_1]]]

abstracting: (pl_P24_1<=pl_P29_1) states: 2,038,166 (6)
abstracting: (pl_P2_1<=pl_P14_3) states: 1,533,768 (6)
abstracting: (1<=pl_P54_1) states: 504,605 (5)
abstracting: (pl_P15_8<=pl_P15_6) states: 1,658,072 (6)
.
EG iterations: 1
abstracting: (2<=pl_P37_7) states: 0
abstracting: (pl_P16_5<=pl_P37_5) states: 1,533,504 (6)
abstracting: (pl_P54_1<=pl_P59_1) states: 1,664,633 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.788sec


Total processing time: 3m 5.747sec


BK_STOP 1464571481704

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

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


iterations count:156 (1), effective:0 (0)

iterations count:156 (1), effective:0 (0)

iterations count:156 (1), effective:0 (0)
44513 44715 49234 46067 47879 48712 49767 49849 50954 50145 52050 51667 49779 50812 50850 50855 51227 51053 51194 52189 51997 51662 52595 51755 50787 50571 49531 50535 50553 50582 50575 50937 50828 50778 50820 51829 51613 51765 51234 52778 52370 52334 51358 52953 51710 51678 50506 50370 49690 49170 51466 51466 51454 51453 51457 51466 51545 51551 51541 51521 51695 51620 51620 52107 52053 52175 52107 52207 52087 51886 51822 52974 52862 52726 52648 52772 52306 51970 51960 51602 52946 52514 52438 52036 52036 51514 51284 52022 51428 51208 50834 50448 50258 49874 49482 51824 51864 51834 51882 51873 51822 51888 51898 51919 51858 51871 51865 52269 52184 52137 52251 52192 52189 52239 52284 52197 52123 52137 52097 51955 52776 52847 52697 52815 52659 52590 52400 52768 52664 52449 52369 52252 52139 51924 53280 53326 53053 53049 52858 52699 52437 52661 52383 52268 52123 51884 51709 52927 52552 52409 52290 52014 51785 51833 51580 51367 51114 51578 51276 51038 50773 50610 50376 50215 49975 49768
iterations count:166873 (1069), effective:4654 (29)

iterations count:156 (1), effective:0 (0)
27518 27520 27510 27514 27481 27524 27518 27442 27506 27503 27507 27777 27736 27830 27776 27696 27863 27733 27760 27587 27796 27840 27635 28331 28303 28022 28377 28333 27875 28415 28403 28406 28542 28233 29170 29089 28919 29247 28929 29786 29682 29323 32053 32563 32004 32190 32361 31886 31855 31456 31208 50329 50337 50321 50340 50339 50325 50340 50335 50332 50339 50602 50529 50581 50589 50577 50480 50576 50520 50562 50537 50489 51367 51244 51297 51237 51176 51097 51110 51079 50998 50994 50947 50778 52536 52281 52405 52352 52092 51920 51845 51643 51445 51506 50918 58844 58701 58116 57943 57195 57296 56726 56393 55995 55455 54830 54218 53444 52739 51734 50285
iterations count:111547 (715), effective:3777 (24)
49750 49764 49768 49766 49771 49765 49765 49758 49762 49756 49768 49765 49990 50011 49953 50016 49963 49996 49986 49986 49995 49966 49955 49963 49946 49925 50678 50639 50628 50543 50551 50507 50526 50369 50554 50537 50404 50425 50308 50261 50198 51751 51645 51619 51549 51519 51445 51390 51055 51238 51089 51056 51004 50806 50409 57529 57311 57259 56675 56866 56517 56466 56100 55656 55363 55174 54764 54178 53869 53766 53089 52487 51788 50894 49858
iterations count:75217 (482), effective:2291 (14)

iterations count:156 (1), effective:0 (0)

iterations count:156 (1), effective:0 (0)

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