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_CircularTrains-PT-048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262400079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465118426306


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

net check time: 0m 0.000sec

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

init dd package: 0m16.469sec


RS generation: 0m 0.411sec


-> reachability set: #nodes 3083 (3.1e+03) #states 23,973,456,915 (10)



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

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

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

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

MC time: 0m 0.003sec

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

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

FORMULA CircularTrains-PT-048-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

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

FORMULA CircularTrains-PT-048-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.002sec

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

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

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

MC time: 0m 0.001sec

checking: EF [[2<=F37 | 2<=F15]]
normalized: E [true U [2<=F37 | 2<=F15]]

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

FORMULA CircularTrains-PT-048-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [Section_27<=Section_33] & 2<=F33]]
normalized: E [true U [2<=F33 & ~ [Section_27<=Section_33]]]

abstracting: (Section_27<=Section_33) states: 18,084,235,320 (10)
abstracting: (2<=F33) states: 0
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AG [[[~ [1<=F12] | F30<=F18] | 1<=F1]]
normalized: ~ [E [true U ~ [[1<=F1 | [F30<=F18 | ~ [1<=F12]]]]]]

abstracting: (1<=F12) states: 9,511,333,155 (9)
abstracting: (F30<=F18) states: 18,084,235,320 (10)
abstracting: (1<=F1) states: 9,511,333,155 (9)
-> the formula is FALSE

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

MC time: 0m 0.323sec

checking: EF [[~ [[3<=F48 | 1<=Section_35]] & [[1<=Section_7 & 2<=F38] & ~ [F12<=Section_11]]]]
normalized: E [true U [[~ [F12<=Section_11] & [1<=Section_7 & 2<=F38]] & ~ [[3<=F48 | 1<=Section_35]]]]

abstracting: (1<=Section_35) states: 9,511,333,155 (9)
abstracting: (3<=F48) states: 0
abstracting: (2<=F38) states: 8,572,902,165 (9)
abstracting: (1<=Section_7) states: 4,950,790,605 (9)
abstracting: (F12<=Section_11) states: 18,388,271,490 (10)
-> the formula is TRUE

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

MC time: 0m 0.411sec

checking: AG [~ [[[F28<=F29 & F6<=F21] & [3<=Section_12 & F4<=Section_3]]]]
normalized: ~ [E [true U [[3<=Section_12 & F4<=Section_3] & [F28<=F29 & F6<=F21]]]]

abstracting: (F6<=F21) states: 18,084,235,320 (10)
abstracting: (F28<=F29) states: 23,973,456,915 (10)
abstracting: (F4<=Section_3) states: 19,412,914,365 (10)
abstracting: (3<=Section_12) states: 0
-> the formula is TRUE

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

MC time: 0m 0.020sec

checking: AG [[[[2<=F46 | F11<=Section_9] | [1<=F47 | Section_38<=F3]] | ~ [[2<=F38 & F16<=Section_4]]]]
normalized: ~ [E [true U ~ [[[[2<=F46 | F11<=Section_9] | [1<=F47 | Section_38<=F3]] | ~ [[2<=F38 & F16<=Section_4]]]]]]

abstracting: (F16<=Section_4) states: 16,425,197,625 (10)
abstracting: (2<=F38) states: 8,572,902,165 (9)
abstracting: (Section_38<=F3) states: 18,388,271,490 (10)
abstracting: (1<=F47) states: 20,351,345,355 (10)
abstracting: (F11<=Section_9) states: 8,486,690,280 (9)
abstracting: (2<=F46) states: 0
-> the formula is TRUE

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

MC time: 0m 0.033sec

checking: EF [[[[F34<=F18 | F34<=Section_17] & F12<=F23] & [Section_43<=Section_42 & 3<=F15]]]
normalized: E [true U [[Section_43<=Section_42 & 3<=F15] & [F12<=F23 & [F34<=F18 | F34<=Section_17]]]]

abstracting: (F34<=Section_17) states: 18,388,271,490 (10)
abstracting: (F34<=F18) states: 18,084,235,320 (10)
abstracting: (F12<=F23) states: 22,416,403,980 (10)
abstracting: (3<=F15) states: 0
abstracting: (Section_43<=Section_42) states: 19,022,666,310 (10)
-> the formula is FALSE

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

MC time: 0m 0.023sec

checking: AG [[[1<=Section_34 | ~ [1<=Section_11]] | [[2<=F12 | F34<=F14] & [Section_2<=F41 & Section_41<=Section_29]]]]
normalized: ~ [E [true U ~ [[[[Section_2<=F41 & Section_41<=Section_29] & [2<=F12 | F34<=F14]] | [1<=Section_34 | ~ [1<=Section_11]]]]]]

abstracting: (1<=Section_11) states: 9,511,333,155 (9)
abstracting: (1<=Section_34) states: 4,950,790,605 (9)
abstracting: (F34<=F14) states: 22,416,403,980 (10)
abstracting: (2<=F12) states: 0
abstracting: (Section_41<=Section_29) states: 18,084,235,320 (10)
abstracting: (Section_2<=F41) states: 22,653,409,365 (10)
-> the formula is FALSE

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

MC time: 0m 0.447sec

checking: EF [[[[2<=Section_35 & Section_17<=Section_13] & [Section_36<=F46 & Section_24<=F26]] & [F5<=F35 & 3<=Section_37]]]
normalized: E [true U [[F5<=F35 & 3<=Section_37] & [[Section_36<=F46 & Section_24<=F26] & [2<=Section_35 & Section_17<=Section_13]]]]

abstracting: (Section_17<=Section_13) states: 16,425,197,625 (10)
abstracting: (2<=Section_35) states: 0
abstracting: (Section_24<=F26) states: 22,314,419,220 (10)
abstracting: (Section_36<=F46) states: 18,388,271,490 (10)
abstracting: (3<=Section_37) states: 0
abstracting: (F5<=F35) states: 16,517,550,258 (10)
-> the formula is FALSE

FORMULA CircularTrains-PT-048-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [[[~ [Section_40<=Section_14] | [3<=F15 & Section_8<=Section_46]] & [[F16<=F12 & Section_48<=Section_3] & [2<=F31 & 3<=F31]]]]
normalized: E [true U [[[2<=F31 & 3<=F31] & [F16<=F12 & Section_48<=Section_3]] & [[3<=F15 & Section_8<=Section_46] | ~ [Section_40<=Section_14]]]]

abstracting: (Section_40<=Section_14) states: 20,985,740,175 (10)
abstracting: (Section_8<=Section_46) states: 16,425,197,625 (10)
abstracting: (3<=F15) states: 0
abstracting: (Section_48<=Section_3) states: 18,084,235,320 (10)
abstracting: (F16<=F12) states: 18,084,235,320 (10)
abstracting: (3<=F31) states: 0
abstracting: (2<=F31) states: 0
-> the formula is FALSE

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

MC time: 0m 0.035sec

checking: AG [[[[3<=Section_33 | F19<=F18] | [2<=Section_13 | Section_21<=Section_30]] | [[F21<=Section_24 | 2<=F43] | [3<=Section_9 | F38<=F31]]]]
normalized: ~ [E [true U ~ [[[[3<=Section_33 | F19<=F18] | [2<=Section_13 | Section_21<=Section_30]] | [[F21<=Section_24 | 2<=F43] | [3<=Section_9 | F38<=F31]]]]]]

abstracting: (F38<=F31) states: 8,360,301,150 (9)
abstracting: (3<=Section_9) states: 0
abstracting: (2<=F43) states: 0
abstracting: (F21<=Section_24) states: 18,388,271,490 (10)
abstracting: (Section_21<=Section_30) states: 18,084,235,320 (10)
abstracting: (2<=Section_13) states: 0
abstracting: (F19<=F18) states: 19,022,666,310 (10)
abstracting: (3<=Section_33) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec


Total processing time: 0m22.746sec


BK_STOP 1465118449097

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

2861
iterations count:1888 (39), effective:384 (8)

initing FirstDep: 0m 0.000sec


iterations count:450 (9), effective:91 (1)

iterations count:866 (18), effective:159 (3)

iterations count:452 (9), effective:77 (1)

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_CircularTrains-PT-048"
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/S_CircularTrains-PT-048.tgz
mv S_CircularTrains-PT-048 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_CircularTrains-PT-048, 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 r197kn-qhx2-146444262400079"
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 ;