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 S_CircularTrains-PT-012, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419600340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433163108124

Model: S_CircularTrains-PT-012
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: 24 NrTr: 12 NrArc: 48)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 202 (2.0e+02) #states 195



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

checking: ~ [[~ [AF [F4<=Section_6]] & ~ [3<=F2]]]
normalized: ~ [[EG [~ [F4<=Section_6]] & ~ [3<=F2]]]

abstracting: (3<=F2) states: 0
abstracting: (F4<=Section_6) states: 154
...............
EG iterations: 15
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [E [3<=Section_7 U 3<=F8]]
normalized: ~ [EX [~ [E [3<=Section_7 U 3<=F8]]]]

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

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

MC time: 0m0sec

checking: A [~ [[Section_9<=F12 | F4<=Section_3]] U ~ [[F11<=Section_8 | F5<=Section_6]]]
normalized: [~ [EG [[F11<=Section_8 | F5<=Section_6]]] & ~ [E [[Section_9<=F12 | F4<=Section_3] U [[F11<=Section_8 | F5<=Section_6] & [Section_9<=F12 | F4<=Section_3]]]]]

abstracting: (F4<=Section_3) states: 165
abstracting: (Section_9<=F12) states: 154
abstracting: (F5<=Section_6) states: 75
abstracting: (F11<=Section_8) states: 60
abstracting: (F4<=Section_3) states: 165
abstracting: (Section_9<=F12) states: 154
abstracting: (F5<=Section_6) states: 75
abstracting: (F11<=Section_8) states: 60
............
EG iterations: 12
-> the formula is FALSE

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

MC time: 0m0sec

checking: [1<=F3 | EX [~ [Section_11<=F7]]]
normalized: [1<=F3 | EX [~ [Section_11<=F7]]]

abstracting: (Section_11<=F7) states: 154
.abstracting: (1<=F3) states: 75
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 2<=Section_6
normalized: 2<=Section_6

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

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

MC time: 0m0sec

checking: ~ [AX [AG [2<=F1]]]
normalized: EX [E [true U ~ [2<=F1]]]

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

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

MC time: 0m0sec

checking: AX [[1<=F11 & [Section_9<=F8 | [1<=Section_5 | Section_5<=Section_9]]]]
normalized: ~ [EX [~ [[1<=F11 & [Section_9<=F8 | [1<=Section_5 | Section_5<=Section_9]]]]]]

abstracting: (Section_5<=Section_9) states: 144
abstracting: (1<=Section_5) states: 75
abstracting: (Section_9<=F8) states: 171
abstracting: (1<=F11) states: 171
.-> the formula is TRUE

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

MC time: 0m0sec

checking: [EF [AG [3<=F1]] & EF [AF [Section_12<=Section_9]]]
normalized: [E [true U ~ [EG [~ [Section_12<=Section_9]]]] & E [true U ~ [E [true U ~ [3<=F1]]]]]

abstracting: (3<=F1) states: 0
abstracting: (Section_12<=Section_9) states: 144
............
EG iterations: 12
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: Section_11<=F4
normalized: Section_11<=F4

abstracting: (Section_11<=F4) states: 154
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[[~ [1<=F12] | 3<=F7] & EF [[1<=F9 | 1<=Section_8]]]]
normalized: ~ [[E [true U [1<=F9 | 1<=Section_8]] & [3<=F7 | ~ [1<=F12]]]]

abstracting: (1<=F12) states: 75
abstracting: (3<=F7) states: 0
abstracting: (1<=Section_8) states: 75
abstracting: (1<=F9) states: 75
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: Section_8<=F4
normalized: Section_8<=F4

abstracting: (Section_8<=F4) states: 154
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: F10<=Section_5
normalized: F10<=Section_5

abstracting: (F10<=Section_5) states: 154
-> the formula is FALSE

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

MC time: 0m0sec

checking: EX [Section_3<=F10]
normalized: EX [Section_3<=F10]

abstracting: (Section_3<=F10) states: 154
.-> the formula is TRUE

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

MC time: 0m0sec

checking: EX [[EX [F2<=F11] & [[3<=F2 & Section_2<=F5] | Section_7<=F7]]]
normalized: EX [[[Section_7<=F7 | [3<=F2 & Section_2<=F5]] & EX [F2<=F11]]]

abstracting: (F2<=F11) states: 135
.abstracting: (Section_2<=F5) states: 189
abstracting: (3<=F2) states: 0
abstracting: (Section_7<=F7) states: 150
.-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[Section_2<=F2 | E [F12<=Section_6 U 1<=Section_4]]]
normalized: ~ [[Section_2<=F2 | E [F12<=Section_6 U 1<=Section_4]]]

abstracting: (1<=Section_4) states: 45
abstracting: (F12<=Section_6) states: 154
abstracting: (Section_2<=F2) states: 171
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [2<=F1]
normalized: ~ [2<=F1]

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

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

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1433163116803

--------------------
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:112 (9), effective:24 (2)

initing FirstDep: 0m0sec


iterations count:39 (3), effective:7 (0)

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

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

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

iterations count:28 (2), effective:6 (0)

iterations count:75 (6), effective:16 (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-012"
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/S_CircularTrains-PT-012.tgz
mv S_CircularTrains-PT-012 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 S_CircularTrains-PT-012, 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 r120st-ebro-143297419600340"
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 ;