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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347851000066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463596447825


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: 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: 0m17.032sec


RS generation: 0m 0.037sec


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



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

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

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

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

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.007sec

checking: ~ [EG [EF [F6<=Section_23]]]
normalized: ~ [EG [E [true U F6<=Section_23]]]

abstracting: (F6<=Section_23) states: 66,993 (4)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: AF [Section_12<=Section_11]
normalized: ~ [EG [~ [Section_12<=Section_11]]]

abstracting: (Section_12<=Section_11) states: 64,774 (4)
............................................................................
EG iterations: 76
-> the formula is TRUE

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

MC time: 0m 0.324sec

checking: AF [~ [F3<=F4]]
normalized: ~ [EG [F3<=F4]]

abstracting: (F3<=F4) states: 68,032 (4)
.......................................................................................
EG iterations: 87
-> the formula is TRUE

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

MC time: 0m 0.329sec

checking: AX [[EG [Section_3<=F23] & EF [1<=F6]]]
normalized: ~ [EX [~ [[E [true U 1<=F6] & EG [Section_3<=F23]]]]]

abstracting: (Section_3<=F23) states: 82,502 (4)
.......................................................
EG iterations: 55
abstracting: (1<=F6) states: 34,016 (4)
.-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: ~ [[Section_24<=F7 & EF [2<=Section_13]]]
normalized: ~ [[Section_24<=F7 & E [true U 2<=Section_13]]]

abstracting: (2<=Section_13) states: 0
abstracting: (Section_24<=F7) states: 66,993 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [E [F24<=Section_15 U 2<=Section_18]]
normalized: EG [E [F24<=Section_15 U 2<=Section_18]]

abstracting: (2<=Section_18) states: 0
abstracting: (F24<=Section_15) states: 66,993 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EG [EG [[Section_13<=F11 | 1<=Section_2]]]
normalized: EG [EG [[Section_13<=F11 | 1<=Section_2]]]

abstracting: (1<=Section_2) states: 34,016 (4)
abstracting: (Section_13<=F11) states: 86,515 (4)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [AF [EG [1<=F3]] | [~ [F23<=F1] & 1<=F23]]
normalized: [[1<=F23 & ~ [F23<=F1]] | ~ [EG [~ [EG [1<=F3]]]]]

abstracting: (1<=F3) states: 34,016 (4)
......................................................................................
EG iterations: 86

EG iterations: 0
abstracting: (F23<=F1) states: 30,758 (4)
abstracting: (1<=F23) states: 74,240 (4)
-> the formula is FALSE

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

MC time: 0m 0.214sec

checking: [EX [~ [~ [F5<=F15]]] | EG [~ [F16<=Section_11]]]
normalized: [EG [~ [F16<=Section_11]] | EX [F5<=F15]]

abstracting: (F5<=F15) states: 29,885 (4)
.abstracting: (F16<=Section_11) states: 66,993 (4)
...................................................
EG iterations: 51
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

checking: AF [[AF [3<=F8] & [[F14<=Section_16 & 2<=Section_21] | 1<=F24]]]
normalized: ~ [EG [~ [[~ [EG [~ [3<=F8]]] & [1<=F24 | [F14<=Section_16 & 2<=Section_21]]]]]]

abstracting: (2<=Section_21) states: 0
abstracting: (F14<=Section_16) states: 19,522 (4)
abstracting: (1<=F24) states: 34,016 (4)
abstracting: (3<=F8) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[~ [F11<=F15] & [Section_6<=F13 | 3<=F15]] U ~ [~ [3<=Section_6]]]
normalized: E [[~ [F11<=F15] & [Section_6<=F13 | 3<=F15]] U 3<=Section_6]

abstracting: (3<=Section_6) states: 0
abstracting: (3<=F15) states: 0
abstracting: (Section_6<=F13) states: 66,993 (4)
abstracting: (F11<=F15) states: 29,885 (4)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [EF [2<=Section_17] | [[2<=Section_12 | AX [F3<=Section_3]] & AG [[2<=Section_8 | 2<=Section_21]]]]
normalized: [[~ [E [true U ~ [[2<=Section_8 | 2<=Section_21]]]] & [2<=Section_12 | ~ [EX [~ [F3<=Section_3]]]]] | E [true U 2<=Section_17]]

abstracting: (2<=Section_17) states: 0
abstracting: (F3<=Section_3) states: 52,499 (4)
.abstracting: (2<=Section_12) states: 0
abstracting: (2<=Section_21) states: 0
abstracting: (2<=Section_8) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [[[3<=F6 & [[F5<=Section_4 | 2<=F12] | ~ [1<=Section_4]]] & E [F1<=Section_2 U F13<=Section_10]] | AF [[[Section_4<=F15 & 1<=Section_16] & ~ [Section_22<=F7]]]]
normalized: [~ [EG [~ [[[Section_4<=F15 & 1<=Section_16] & ~ [Section_22<=F7]]]]] | [E [F1<=Section_2 U F13<=Section_10] & [3<=F6 & [~ [1<=Section_4] | [F5<=Section_4 | 2<=F12]]]]]

abstracting: (2<=F12) states: 0
abstracting: (F5<=Section_4) states: 19,522 (4)
abstracting: (1<=Section_4) states: 18,483 (4)
abstracting: (3<=F6) states: 0
abstracting: (F13<=Section_10) states: 59,746 (4)
abstracting: (F1<=Section_2) states: 52,499 (4)
abstracting: (Section_22<=F7) states: 75,279 (4)
abstracting: (1<=Section_16) states: 18,483 (4)
abstracting: (Section_4<=F15) states: 75,279 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: [~ [[[F11<=Section_15 | F11<=F14] & [F18<=F10 | [Section_7<=Section_22 & 2<=F12]]]] | E [[F16<=Section_17 | F5<=F19] U 2<=F16]]
normalized: [E [[F16<=Section_17 | F5<=F19] U 2<=F16] | ~ [[[F11<=Section_15 | F11<=F14] & [F18<=F10 | [Section_7<=Section_22 & 2<=F12]]]]]

abstracting: (2<=F12) states: 0
abstracting: (Section_7<=Section_22) states: 72,021 (4)
abstracting: (F18<=F10) states: 64,774 (4)
abstracting: (F11<=F14) states: 60,313 (4)
abstracting: (F11<=Section_15) states: 28,799 (4)
abstracting: (2<=F16) states: 0
abstracting: (F5<=F19) states: 29,885 (4)
abstracting: (F16<=Section_17) states: 52,499 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec


Total processing time: 0m22.387sec


BK_STOP 1463596470266

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


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

iterations count:54 (2), effective:11 (0)

iterations count:60 (2), effective:12 (0)

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

iterations count:51 (2), effective:10 (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="CircularTrains-PT-024"
export BK_EXAMINATION="CTLCardinality"
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 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 r017kn-qhx2-146347851000066"
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 ;