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

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

=== Now, execution of the tool begins

BK_START 1463750563908


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_005
(NrP: 68 NrTr: 56 NrArc: 313)

net check time: 0m 0.000sec

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

init dd package: 0m 4.226sec


RS generation: 0m 0.057sec


-> reachability set: #nodes 1250 (1.2e+03) #states 1,838 (3)



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

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA Railroad-PT-005-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [pl_P3_1<=pl_P30_1]
normalized: ~ [E [true U ~ [pl_P3_1<=pl_P30_1]]]

abstracting: (pl_P3_1<=pl_P30_1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [pl_P29_4<=pl_P4_1]]
normalized: E [true U ~ [pl_P29_4<=pl_P4_1]]

abstracting: (pl_P29_4<=pl_P4_1) states: 1,838 (3)
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[pl_P38_1<=pl_P16_1 & 2<=pl_P7_3]]
normalized: E [true U [pl_P38_1<=pl_P16_1 & 2<=pl_P7_3]]

abstracting: (2<=pl_P7_3) states: 0
abstracting: (pl_P38_1<=pl_P16_1) states: 1,838 (3)
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [1<=pl_P7_6] | pl_P17_1<=pl_P16_1]]
normalized: ~ [E [true U ~ [[pl_P17_1<=pl_P16_1 | ~ [1<=pl_P7_6]]]]]

abstracting: (1<=pl_P7_6) states: 0
abstracting: (pl_P17_1<=pl_P16_1) states: 1,320 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=pl_P35_1] | pl_P40_3<=pl_P34_3]]]
normalized: E [true U ~ [[pl_P40_3<=pl_P34_3 | ~ [2<=pl_P35_1]]]]

abstracting: (2<=pl_P35_1) states: 0
abstracting: (pl_P40_3<=pl_P34_3) states: 1,449 (3)
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[pl_P37_1<=pl_P34_5 & ~ [pl_P7_4<=pl_P40_1]]]
normalized: E [true U [pl_P37_1<=pl_P34_5 & ~ [pl_P7_4<=pl_P40_1]]]

abstracting: (pl_P7_4<=pl_P40_1) states: 1,838 (3)
abstracting: (pl_P37_1<=pl_P34_5) states: 1,838 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[3<=pl_P0_3 & [~ [pl_P37_1<=pl_P29_4] | 3<=pl_P18_1]]]
normalized: E [true U [3<=pl_P0_3 & [3<=pl_P18_1 | ~ [pl_P37_1<=pl_P29_4]]]]

abstracting: (pl_P37_1<=pl_P29_4) states: 1,838 (3)
abstracting: (3<=pl_P18_1) states: 0
abstracting: (3<=pl_P0_3) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [pl_P0_1<=pl_P32_1] | 1<=pl_P18_1] & 3<=pl_P3_1]]
normalized: E [true U [3<=pl_P3_1 & [1<=pl_P18_1 | ~ [pl_P0_1<=pl_P32_1]]]]

abstracting: (pl_P0_1<=pl_P32_1) states: 1,603 (3)
abstracting: (1<=pl_P18_1) states: 518
abstracting: (3<=pl_P3_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[[3<=pl_P8_1 & 3<=pl_P26_1] | [3<=pl_P26_1 | 2<=pl_P21_1]] | 3<=pl_P15_1]]
normalized: E [true U [3<=pl_P15_1 | [[3<=pl_P8_1 & 3<=pl_P26_1] | [3<=pl_P26_1 | 2<=pl_P21_1]]]]

abstracting: (2<=pl_P21_1) states: 0
abstracting: (3<=pl_P26_1) states: 0
abstracting: (3<=pl_P26_1) states: 0
abstracting: (3<=pl_P8_1) states: 0
abstracting: (3<=pl_P15_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[3<=pl_P28_1 & [[3<=pl_P20_1 | 3<=pl_P23_1] | pl_P38_1<=pl_P42_1]]]
normalized: E [true U [3<=pl_P28_1 & [pl_P38_1<=pl_P42_1 | [3<=pl_P20_1 | 3<=pl_P23_1]]]]

abstracting: (3<=pl_P23_1) states: 0
abstracting: (3<=pl_P20_1) states: 0
abstracting: (pl_P38_1<=pl_P42_1) states: 1,838 (3)
abstracting: (3<=pl_P28_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[pl_P14_1<=pl_P34_2 | pl_P1_1<=pl_P32_1] & [2<=pl_P29_6 | pl_P7_4<=pl_P36_1]] | 3<=pl_P35_1]]
normalized: ~ [E [true U ~ [[3<=pl_P35_1 | [[pl_P14_1<=pl_P34_2 | pl_P1_1<=pl_P32_1] & [2<=pl_P29_6 | pl_P7_4<=pl_P36_1]]]]]]

abstracting: (pl_P7_4<=pl_P36_1) states: 1,838 (3)
abstracting: (2<=pl_P29_6) states: 0
abstracting: (pl_P1_1<=pl_P32_1) states: 1,838 (3)
abstracting: (pl_P14_1<=pl_P34_2) states: 1,838 (3)
abstracting: (3<=pl_P35_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[pl_P24_1<=pl_P37_1 | pl_P7_4<=pl_P6_1] | pl_P34_4<=pl_P13_1] | ~ [[pl_P36_1<=pl_P5_1 | 3<=pl_P26_1]]]]
normalized: ~ [E [true U ~ [[~ [[pl_P36_1<=pl_P5_1 | 3<=pl_P26_1]] | [pl_P34_4<=pl_P13_1 | [pl_P24_1<=pl_P37_1 | pl_P7_4<=pl_P6_1]]]]]]

abstracting: (pl_P7_4<=pl_P6_1) states: 1,838 (3)
abstracting: (pl_P24_1<=pl_P37_1) states: 1,838 (3)
abstracting: (pl_P34_4<=pl_P13_1) states: 1,405 (3)
abstracting: (3<=pl_P26_1) states: 0
abstracting: (pl_P36_1<=pl_P5_1) states: 1,835 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [[[[3<=pl_P29_5 | pl_P40_6<=pl_P2_1] | [2<=pl_P38_1 & 3<=pl_P33_1]] & [[pl_P36_1<=pl_P23_1 | pl_P11_1<=pl_P29_1] | [3<=pl_P25_1 | pl_P34_1<=pl_P2_1]]]]
normalized: ~ [E [true U ~ [[[[pl_P36_1<=pl_P23_1 | pl_P11_1<=pl_P29_1] | [3<=pl_P25_1 | pl_P34_1<=pl_P2_1]] & [[2<=pl_P38_1 & 3<=pl_P33_1] | [3<=pl_P29_5 | pl_P40_6<=pl_P2_1]]]]]]

abstracting: (pl_P40_6<=pl_P2_1) states: 1,838 (3)
abstracting: (3<=pl_P29_5) states: 0
abstracting: (3<=pl_P33_1) states: 0
abstracting: (2<=pl_P38_1) states: 0
abstracting: (pl_P34_1<=pl_P2_1) states: 1,818 (3)
abstracting: (3<=pl_P25_1) states: 0
abstracting: (pl_P11_1<=pl_P29_1) states: 1,838 (3)
abstracting: (pl_P36_1<=pl_P23_1) states: 1,820 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec


Total processing time: 0m 5.725sec


BK_STOP 1463750569669

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
pl_P7_2
pl_P7_4
pl_P7_5
pl_P14_1
pl_P0_6
pl_P1_1
pl_P24_1
pl_P7_6
pl_P9_1
pl_P29_4
pl_P29_5
pl_P29_6
pl_P37_1
pl_P38_1
pl_P3_1
pl_P40_6

The net has transition(s) that can never fire:
tr_T23_24
tr_T23_18
tr_T23_30
tr_T23_36
tr_T9_12

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

720
iterations count:1488 (26), effective:59 (1)

initing FirstDep: 0m 0.000sec

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-005"
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-005.tgz
mv Railroad-PT-005 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-005, 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-146369143800223"
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 ;