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 CircularTrains-PT-024, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347851000070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463596491981


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: CircularTrains_PT_024
(NrP: 48 NrTr: 24 NrArc: 96)

net check time: 0m 0.000sec

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

init dd package: 0m16.178sec


RS generation: 0m 0.039sec


-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)



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

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=F22] | 3<=F9]]]
normalized: E [true U ~ [[3<=F9 | ~ [2<=F22]]]]

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=Section_17 & ~ [3<=F14]]]
normalized: E [true U [3<=Section_17 & ~ [3<=F14]]]

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[1<=F20 & [3<=Section_2 & 1<=Section_4]]]]
normalized: ~ [E [true U [1<=F20 & [3<=Section_2 & 1<=Section_4]]]]

abstracting: (1<=Section_4) states: 18,483 (4)
abstracting: (3<=Section_2) states: 0
abstracting: (1<=F20) states: 74,240 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[2<=F19 & Section_2<=Section_10]] | 1<=F18]]
normalized: ~ [E [true U ~ [[1<=F18 | ~ [[2<=F19 & Section_2<=Section_10]]]]]]

abstracting: (Section_2<=Section_10) states: 59,746 (4)
abstracting: (2<=F19) states: 0
abstracting: (1<=F18) states: 34,016 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[2<=F22 | 3<=F8]] | ~ [[2<=F7 & 2<=F20]]]]
normalized: ~ [E [true U ~ [[~ [[2<=F22 | 3<=F8]] | ~ [[2<=F7 & 2<=F20]]]]]]

abstracting: (2<=F20) states: 30,758 (4)
abstracting: (2<=F7) states: 0
abstracting: (3<=F8) states: 0
abstracting: (2<=F22) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [Section_17<=Section_8] & [3<=Section_16 | 2<=Section_1]] | 3<=F9]]
normalized: E [true U [3<=F9 | [~ [Section_17<=Section_8] & [3<=Section_16 | 2<=Section_1]]]]

abstracting: (2<=Section_1) states: 0
abstracting: (3<=Section_16) states: 0
abstracting: (Section_17<=Section_8) states: 64,774 (4)
abstracting: (3<=F9) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[[3<=Section_20 & F5<=Section_18] & [Section_24<=Section_24 & 2<=Section_20]]]]
normalized: ~ [E [true U [[Section_24<=Section_24 & 2<=Section_20] & [3<=Section_20 & F5<=Section_18]]]]

abstracting: (F5<=Section_18) states: 28,799 (4)
abstracting: (3<=Section_20) states: 0
abstracting: (2<=Section_20) states: 0
abstracting: (Section_24<=Section_24) states: 86,515 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[[Section_24<=F5 | 1<=F18] & [Section_3<=Section_17 & 3<=F22]]]]
normalized: ~ [E [true U [[Section_24<=F5 | 1<=F18] & [Section_3<=Section_17 & 3<=F22]]]]

abstracting: (3<=F22) states: 0
abstracting: (Section_3<=Section_17) states: 64,774 (4)
abstracting: (1<=F18) states: 34,016 (4)
abstracting: (Section_24<=F5) states: 82,502 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[~ [[2<=Section_17 & F18<=F13]] | [~ [F9<=F24] & [2<=F21 | F10<=F9]]]]
normalized: ~ [E [true U ~ [[[[2<=F21 | F10<=F9] & ~ [F9<=F24]] | ~ [[2<=Section_17 & F18<=F13]]]]]]

abstracting: (F18<=F13) states: 64,774 (4)
abstracting: (2<=Section_17) states: 0
abstracting: (F9<=F24) states: 64,774 (4)
abstracting: (F10<=F9) states: 68,032 (4)
abstracting: (2<=F21) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[[Section_5<=F14 & 1<=F23] & [2<=F14 & 2<=F6]] & [~ [F18<=Section_10] | 1<=Section_23]]]
normalized: E [true U [[[2<=F14 & 2<=F6] & [Section_5<=F14 & 1<=F23]] & [1<=Section_23 | ~ [F18<=Section_10]]]]

abstracting: (F18<=Section_10) states: 59,746 (4)
abstracting: (1<=Section_23) states: 34,016 (4)
abstracting: (1<=F23) states: 74,240 (4)
abstracting: (Section_5<=F14) states: 82,502 (4)
abstracting: (2<=F6) states: 0
abstracting: (2<=F14) states: 30,758 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[[Section_2<=Section_10 | 2<=F10] & [2<=Section_1 | 1<=Section_5]] & [3<=F13 & [Section_7<=Section_7 | 2<=F3]]]]
normalized: E [true U [[3<=F13 & [Section_7<=Section_7 | 2<=F3]] & [[2<=Section_1 | 1<=Section_5] & [Section_2<=Section_10 | 2<=F10]]]]

abstracting: (2<=F10) states: 0
abstracting: (Section_2<=Section_10) states: 59,746 (4)
abstracting: (1<=Section_5) states: 34,016 (4)
abstracting: (2<=Section_1) states: 0
abstracting: (2<=F3) states: 0
abstracting: (Section_7<=Section_7) states: 86,515 (4)
abstracting: (3<=F13) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[Section_6<=F24 & Section_1<=Section_7] & [2<=F20 & F2<=Section_4]] | Section_1<=F23]]
normalized: ~ [E [true U ~ [[Section_1<=F23 | [[2<=F20 & F2<=Section_4] & [Section_6<=F24 & Section_1<=Section_7]]]]]]

abstracting: (Section_1<=Section_7) states: 72,021 (4)
abstracting: (Section_6<=F24) states: 66,993 (4)
abstracting: (F2<=Section_4) states: 19,522 (4)
abstracting: (2<=F20) states: 30,758 (4)
abstracting: (Section_1<=F23) states: 86,515 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[F16<=Section_8 | Section_16<=F1] & [F24<=Section_23 & Section_16<=F15]] | [~ [2<=Section_8] | [2<=Section_11 & F15<=Section_23]]]]
normalized: ~ [E [true U ~ [[[[2<=Section_11 & F15<=Section_23] | ~ [2<=Section_8]] | [[F16<=Section_8 | Section_16<=F1] & [F24<=Section_23 & Section_16<=F15]]]]]]

abstracting: (Section_16<=F15) states: 68,032 (4)
abstracting: (F24<=Section_23) states: 66,993 (4)
abstracting: (Section_16<=F1) states: 75,279 (4)
abstracting: (F16<=Section_8) states: 66,993 (4)
abstracting: (2<=Section_8) states: 0
abstracting: (F15<=Section_23) states: 66,993 (4)
abstracting: (2<=Section_11) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec


Total processing time: 0m20.539sec


BK_STOP 1463596512572

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

check for maximal unmarked siphon
ok
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


iterations count:464 (19), effective:96 (4)

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="CircularTrains-PT-024"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/CircularTrains-PT-024.tgz
mv CircularTrains-PT-024 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 CircularTrains-PT-024, 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 r017kn-qhx2-146347851000070"
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 ;