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-2265
Executing tool marcie
Input is Railroad-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779500951
=====================================================================

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

Model: Railroad-PT-010
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 118 NrTr: 156 NrArc: 898)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m24sec


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



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

checking: [EF [3<=pl_P54_1] | [EX [~ [pl_P15_4<=pl_P20_5]] | [[~ [2<=pl_P14_3] & [3<=pl_P16_5 & 1<=pl_P14_7]] | EG [1<=pl_P15_3]]]]
normalized: [E [true U 3<=pl_P54_1] | [EX [~ [pl_P15_4<=pl_P20_5]] | [EG [1<=pl_P15_3] | [~ [2<=pl_P14_3] & [3<=pl_P16_5 & 1<=pl_P14_7]]]]]

abstracting: (1<=pl_P14_7) states: 400,170 (5)
abstracting: (3<=pl_P16_5) states: 0
abstracting: (2<=pl_P14_3) states: 0
abstracting: (1<=pl_P15_3) states: 504,605 (5)
.
EG iterations: 1
abstracting: (pl_P15_4<=pl_P20_5) states: 1,533,561 (6)
.abstracting: (3<=pl_P54_1) states: 0
-> the formula is FALSE

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

MC time: 0m9sec

checking: ~ [A [~ [3<=pl_P29_1] U [pl_P16_8<=pl_P43_1 | 1<=pl_P54_1]]]
normalized: ~ [[~ [EG [~ [[pl_P16_8<=pl_P43_1 | 1<=pl_P54_1]]]] & ~ [E [3<=pl_P29_1 U [3<=pl_P29_1 & ~ [[pl_P16_8<=pl_P43_1 | 1<=pl_P54_1]]]]]]]

abstracting: (1<=pl_P54_1) states: 504,605 (5)
abstracting: (pl_P16_8<=pl_P43_1) states: 1,658,015 (6)
abstracting: (3<=pl_P29_1) states: 0
abstracting: (3<=pl_P29_1) states: 0
abstracting: (1<=pl_P54_1) states: 504,605 (5)
abstracting: (pl_P16_8<=pl_P43_1) states: 1,658,015 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m4sec

checking: EG [EF [[pl_P41_1<=pl_P19_1 & pl_P37_4<=pl_P16_7]]]
normalized: EG [E [true U [pl_P41_1<=pl_P19_1 & pl_P37_4<=pl_P16_7]]]

abstracting: (pl_P37_4<=pl_P16_7) states: 2,038,166 (6)
abstracting: (pl_P41_1<=pl_P19_1) states: 1,782,583 (6)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m17sec

checking: EF [[EX [3<=pl_P14_9] | AG [pl_P15_9<=pl_P66_1]]]
normalized: E [true U [EX [3<=pl_P14_9] | ~ [E [true U ~ [pl_P15_9<=pl_P66_1]]]]]

abstracting: (pl_P15_9<=pl_P66_1) states: 1,658,072 (6)
abstracting: (3<=pl_P14_9) states: 0
.-> the formula is FALSE

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

MC time: 0m44sec

checking: ~ [EG [~ [[pl_P3_1<=pl_P9_1 & 1<=pl_P37_3]]]]
normalized: ~ [EG [~ [[pl_P3_1<=pl_P9_1 & 1<=pl_P37_3]]]]

abstracting: (1<=pl_P37_3) states: 11
abstracting: (pl_P3_1<=pl_P9_1) states: 1,644,944 (6)
...
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m1sec

checking: E [AF [pl_P15_6<=pl_P10_1] U 3<=pl_P14_6]
normalized: E [~ [EG [~ [pl_P15_6<=pl_P10_1]]] U 3<=pl_P14_6]

abstracting: (3<=pl_P14_6) states: 0
abstracting: (pl_P15_6<=pl_P10_1) states: 1,664,633 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m5sec

checking: EG [[EG [pl_P64_1<=pl_P15_5] & [~ [2<=pl_P24_1] & [2<=pl_P20_10 | pl_P61_1<=pl_P61_1]]]]
normalized: EG [[[[2<=pl_P20_10 | pl_P61_1<=pl_P61_1] & ~ [2<=pl_P24_1]] & EG [pl_P64_1<=pl_P15_5]]]

abstracting: (pl_P64_1<=pl_P15_5) states: 2,038,166 (6)

EG iterations: 0
abstracting: (2<=pl_P24_1) states: 0
abstracting: (pl_P61_1<=pl_P61_1) states: 2,038,166 (6)
abstracting: (2<=pl_P20_10) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m2sec

checking: EF [[[1<=pl_P15_11 & 3<=pl_P61_1] & pl_P36_1<=pl_P16_8]]
normalized: E [true U [pl_P36_1<=pl_P16_8 & [1<=pl_P15_11 & 3<=pl_P61_1]]]

abstracting: (3<=pl_P61_1) states: 0
abstracting: (1<=pl_P15_11) states: 0
abstracting: (pl_P36_1<=pl_P16_8) states: 2,038,165 (6)
-> the formula is FALSE

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

MC time: 0m1sec

checking: E [AF [2<=pl_P37_9] U [[1<=pl_P14_6 | 2<=pl_P15_11] & ~ [pl_P15_11<=pl_P37_7]]]
normalized: E [~ [EG [~ [2<=pl_P37_9]]] U [~ [pl_P15_11<=pl_P37_7] & [1<=pl_P14_6 | 2<=pl_P15_11]]]

abstracting: (2<=pl_P15_11) states: 0
abstracting: (1<=pl_P14_6) states: 200,886 (5)
abstracting: (pl_P15_11<=pl_P37_7) states: 2,038,166 (6)
abstracting: (2<=pl_P37_9) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m15sec

checking: ~ [AF [EF [2<=pl_P57_1]]]
normalized: EG [~ [E [true U 2<=pl_P57_1]]]

abstracting: (2<=pl_P57_1) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: [EF [[[pl_P39_1<=pl_P16_11 & pl_P14_8<=pl_P16_9] & ~ [pl_P15_11<=pl_P53_1]]] & EF [EG [pl_P37_9<=pl_P14_4]]]
normalized: [E [true U EG [pl_P37_9<=pl_P14_4]] & E [true U [~ [pl_P15_11<=pl_P53_1] & [pl_P39_1<=pl_P16_11 & pl_P14_8<=pl_P16_9]]]]

abstracting: (pl_P14_8<=pl_P16_9) states: 1,627,478 (6)
abstracting: (pl_P39_1<=pl_P16_11) states: 2,038,166 (6)
abstracting: (pl_P15_11<=pl_P53_1) states: 2,038,166 (6)
abstracting: (pl_P37_9<=pl_P14_4) states: 2,038,166 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m47sec

checking: [EF [[[2<=pl_P20_10 & 1<=pl_P16_8] & [pl_P37_7<=pl_P64_1 & pl_P16_11<=pl_P22_1]]] & AG [[~ [3<=pl_P15_11] | [pl_P15_11<=pl_P56_1 | 3<=pl_P37_3]]]]
normalized: [~ [E [true U ~ [[[pl_P15_11<=pl_P56_1 | 3<=pl_P37_3] | ~ [3<=pl_P15_11]]]]] & E [true U [[pl_P37_7<=pl_P64_1 & pl_P16_11<=pl_P22_1] & [2<=pl_P20_10 & 1<=pl_P16_8]]]]

abstracting: (1<=pl_P16_8) states: 504,662 (5)
abstracting: (2<=pl_P20_10) states: 0
abstracting: (pl_P16_11<=pl_P22_1) states: 2,038,166 (6)
abstracting: (pl_P37_7<=pl_P64_1) states: 2,038,166 (6)
abstracting: (3<=pl_P15_11) states: 0
abstracting: (3<=pl_P37_3) states: 0
abstracting: (pl_P15_11<=pl_P56_1) states: 2,038,166 (6)
-> the formula is FALSE

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

MC time: 0m32sec

checking: EF [[EX [3<=pl_P14_5] & [pl_P30_1<=pl_P12_1 & ~ [1<=pl_P65_1]]]]
normalized: E [true U [EX [3<=pl_P14_5] & [pl_P30_1<=pl_P12_1 & ~ [1<=pl_P65_1]]]]

abstracting: (1<=pl_P65_1) states: 0
abstracting: (pl_P30_1<=pl_P12_1) states: 1,658,072 (6)
abstracting: (3<=pl_P14_5) states: 0
.-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [[EG [pl_P20_11<=pl_P15_7] | AX [pl_P60_1<=pl_P37_2]]]
normalized: EG [[~ [EX [~ [pl_P60_1<=pl_P37_2]]] | EG [pl_P20_11<=pl_P15_7]]]

abstracting: (pl_P20_11<=pl_P15_7) states: 2,038,166 (6)

EG iterations: 0
abstracting: (pl_P60_1<=pl_P37_2) states: 1,028,899 (6)
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m3sec

checking: E [~ [[1<=pl_P37_9 | 1<=pl_P59_1]] U 2<=pl_P14_2]
normalized: E [~ [[1<=pl_P37_9 | 1<=pl_P59_1]] U 2<=pl_P14_2]

abstracting: (2<=pl_P14_2) states: 0
abstracting: (1<=pl_P59_1) states: 524,294 (5)
abstracting: (1<=pl_P37_9) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [E [~ [3<=pl_P28_1] U [pl_P16_11<=pl_P37_5 & 2<=pl_P15_10]]]
normalized: ~ [E [~ [3<=pl_P28_1] U [pl_P16_11<=pl_P37_5 & 2<=pl_P15_10]]]

abstracting: (2<=pl_P15_10) states: 0
abstracting: (pl_P16_11<=pl_P37_5) states: 2,038,166 (6)
abstracting: (3<=pl_P28_1) states: 0
-> the formula is TRUE

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

MC time: 0m15sec


Total processing time: 4m11sec


BK_STOP 1432915311151

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

389 724 1909 3994 5283 6471 10293 15063 16171 23002 23562 24670 33373 34753 33741 35579 44164 44398 44260 45048 44636 46433 46437
iterations count:23394 (149), effective:612 (3)

initing FirstDep: 0m0sec

51088 51125 51129 51126 51113 51090 51075 51083 51081 51057 51023 51020 50925 50554 49541
iterations count:15330 (98), effective:309 (1)
50324 50422 50538 50549 50679 50635 50670 50594 50599 50534 50125 50094 50113 49999 49330 48324 40202 46913 47174 47343 47434 47668 47539 47800 47552 47554 47548 47074 47094 46989 47190 46932 46728 46095
iterations count:34524 (221), effective:905 (5)

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="Railroad-PT-010"
export BK_EXAMINATION="CTLCardinality"
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/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-2265"
echo " Executing tool marcie"
echo " Input is 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 r078kn-ebro-143262779500951"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;