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 CircularTrains-PT-024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r008kn-ebro-143214239100353
=====================================================================

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

Model: CircularTrains-PT-024
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: 48 NrTr: 24 NrArc: 96)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


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



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

checking: A [~ [[2<=F13 & Section_7<=F19]] U ~ [~ [2<=F8]]]
normalized: [~ [E [[2<=F13 & Section_7<=F19] U [[2<=F13 & Section_7<=F19] & ~ [2<=F8]]]] & ~ [EG [~ [2<=F8]]]]

abstracting: (2<=F8) states: 30,758 (4)
.
EG iterations: 1
abstracting: (2<=F8) states: 30,758 (4)
abstracting: (Section_7<=F19) states: 75,279 (4)
abstracting: (2<=F13) states: 0
abstracting: (Section_7<=F19) states: 75,279 (4)
abstracting: (2<=F13) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [3<=F12]
normalized: ~ [EG [~ [3<=F12]]]

abstracting: (3<=F12) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [AX [3<=Section_6]]]
normalized: ~ [E [true U ~ [EX [~ [3<=Section_6]]]]]

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

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

MC time: 0m0sec

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

abstracting: (F21<=F3) states: 64,774 (4)
abstracting: (F4<=F23) states: 80,826 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: [EG [Section_7<=F20] & E [[Section_15<=Section_5 | 1<=Section_16] U [1<=F20 | 2<=Section_23]]]
normalized: [E [[Section_15<=Section_5 | 1<=Section_16] U [1<=F20 | 2<=Section_23]] & EG [Section_7<=F20]]

abstracting: (Section_7<=F20) states: 83,942 (4)
..
EG iterations: 2
abstracting: (2<=Section_23) states: 0
abstracting: (1<=F20) states: 74,240 (4)
abstracting: (1<=Section_16) states: 18,483 (4)
abstracting: (Section_15<=Section_5) states: 64,774 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[A [F4<=Section_10 U F22<=Section_18] & [[[2<=Section_2 | F13<=Section_2] | [Section_18<=Section_1 & Section_6<=F7]] | AF [2<=F5]]]]
normalized: ~ [[[~ [EG [~ [2<=F5]]] | [[Section_18<=Section_1 & Section_6<=F7] | [2<=Section_2 | F13<=Section_2]]] & [~ [EG [~ [F22<=Section_18]]] & ~ [E [~ [F4<=Section_10] U [~ [F4<=Section_10] & ~ [F22<=Section_18]]]]]]]

abstracting: (F22<=Section_18) states: 66,993 (4)
abstracting: (F4<=Section_10) states: 59,746 (4)
abstracting: (F4<=Section_10) states: 59,746 (4)
abstracting: (F22<=Section_18) states: 66,993 (4)
.........................................................
EG iterations: 57
abstracting: (F13<=Section_2) states: 66,993 (4)
abstracting: (2<=Section_2) states: 0
abstracting: (Section_6<=F7) states: 70,982 (4)
abstracting: (Section_18<=Section_1) states: 59,746 (4)
abstracting: (2<=F5) states: 30,758 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [AF [AG [1<=F12]]]
normalized: EG [E [true U ~ [1<=F12]]]

abstracting: (1<=F12) states: 34,016 (4)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [E [2<=Section_24 U F16<=Section_11]]
normalized: ~ [EG [~ [E [2<=Section_24 U F16<=Section_11]]]]

abstracting: (F16<=Section_11) states: 66,993 (4)
abstracting: (2<=Section_24) states: 0
...................................................
EG iterations: 51
-> the formula is TRUE

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

MC time: 0m0sec

checking: [~ [1<=F5] | EG [EX [Section_2<=F2]]]
normalized: [~ [1<=F5] | EG [EX [Section_2<=F2]]]

abstracting: (Section_2<=F2) states: 74,240 (4)
..
EG iterations: 1
abstracting: (1<=F5) states: 74,240 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EG [[[1<=F9 | [Section_2<=Section_18 | 1<=Section_19]] | EX [Section_14<=F21]]]
normalized: EG [[EX [Section_14<=F21] | [1<=F9 | [Section_2<=Section_18 | 1<=Section_19]]]]

abstracting: (1<=Section_19) states: 18,483 (4)
abstracting: (Section_2<=Section_18) states: 64,774 (4)
abstracting: (1<=F9) states: 34,016 (4)
abstracting: (Section_14<=F21) states: 66,993 (4)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: EG [~ [AX [Section_9<=F21]]]
normalized: EG [EX [~ [Section_9<=F21]]]

abstracting: (Section_9<=F21) states: 66,993 (4)
.....................................................................................
EG iterations: 84
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [~ [[AX [1<=Section_18] | EG [F19<=F23]]] | [E [3<=F21 U 1<=Section_2] | [[~ [1<=Section_24] | 1<=Section_22] | AF [F10<=F18]]]]
normalized: [[[~ [EG [~ [F10<=F18]]] | [1<=Section_22 | ~ [1<=Section_24]]] | E [3<=F21 U 1<=Section_2]] | ~ [[EG [F19<=F23] | ~ [EX [~ [1<=Section_18]]]]]]

abstracting: (1<=Section_18) states: 34,016 (4)
.abstracting: (F19<=F23) states: 80,826 (4)
.
EG iterations: 1
abstracting: (1<=Section_2) states: 34,016 (4)
abstracting: (3<=F21) states: 0
abstracting: (1<=Section_24) states: 34,016 (4)
abstracting: (1<=Section_22) states: 18,483 (4)
abstracting: (F10<=F18) states: 64,774 (4)
..............................................
EG iterations: 46
-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [EF [[F9<=F11 & 3<=F20]]]
normalized: ~ [EG [~ [E [true U [F9<=F11 & 3<=F20]]]]]

abstracting: (3<=F20) states: 0
abstracting: (F9<=F11) states: 79,268 (4)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [3<=Section_17]
normalized: ~ [EG [~ [3<=Section_17]]]

abstracting: (3<=Section_17) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [[~ [1<=F24] & [Section_10<=F4 | 3<=F11]] U [Section_1<=F24 & [2<=Section_2 & F17<=Section_18]]]
normalized: E [[~ [1<=F24] & [Section_10<=F4 | 3<=F11]] U [Section_1<=F24 & [2<=Section_2 & F17<=Section_18]]]

abstracting: (F17<=Section_18) states: 34,016 (4)
abstracting: (2<=Section_2) states: 0
abstracting: (Section_1<=F24) states: 68,032 (4)
abstracting: (3<=F11) states: 0
abstracting: (Section_10<=F4) states: 75,279 (4)
abstracting: (1<=F24) states: 34,016 (4)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m12sec


BK_STOP 1432335682408

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


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

initing FirstDep: 0m0sec


iterations count:95 (3), effective:11 (0)

iterations count:136 (5), effective:11 (0)

iterations count:98 (4), effective:12 (0)

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

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

iterations count:24 (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="CircularTrains-PT-024"
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/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-2265"
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 r008kn-ebro-143214239100353"
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 ;