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-3254
Executing tool marcie
Input is CircularTrains-PT-012, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-csrt-149436061700615
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: CircularTrains_PT_012
(NrP: 24 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 1.276sec


RS generation: 0m 0.026sec


-> last computed set: #nodes 12 (1.2e+01) #states 1


parse successfull
net created successfully

Net: CircularTrains_PT_012
(NrP: 24 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 4.286sec


RS generation: 0m 0.001sec


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



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

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

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

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

MC time: 0m 0.001sec

checking: AF [AX [1<=F12]]
normalized: ~ [EG [EX [~ [1<=F12]]]]

abstracting: (1<=F12)
states: 75
...
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: Section_9<=F9
normalized: Section_9<=F9

abstracting: (Section_9<=F9)
states: 120
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [AF [~ [Section_7<=F5]]]
normalized: ~ [E [true U EG [Section_7<=F5]]]

abstracting: (Section_7<=F5)
states: 195

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: F9<=F11
normalized: F9<=F11

abstracting: (F9<=F11)
states: 178
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [~ [EG [[3<=F7 & Section_4<=Section_7]]]]
normalized: EG [[3<=F7 & Section_4<=Section_7]]

abstracting: (Section_4<=Section_7)
states: 161
abstracting: (3<=F7)
states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [[1<=Section_8 | ~ [~ [F7<=Section_4]]]]
normalized: ~ [EX [~ [[1<=Section_8 | F7<=Section_4]]]]

abstracting: (F7<=Section_4)
states: 137
abstracting: (1<=Section_8)
states: 75
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[~ [Section_7<=Section_10] & Section_5<=F7] & EX [2<=Section_2]]]
normalized: ~ [E [true U ~ [[EX [2<=Section_2] & [~ [Section_7<=Section_10] & Section_5<=F7]]]]]

abstracting: (Section_5<=F7)
states: 154
abstracting: (Section_7<=Section_10)
states: 161
abstracting: (2<=Section_2)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[EF [[F9<=Section_6 | F5<=Section_1]] & F1<=Section_10]]
normalized: ~ [[E [true U [F9<=Section_6 | F5<=Section_1]] & F1<=Section_10]]

abstracting: (F1<=Section_10)
states: 137
abstracting: (F5<=Section_1)
states: 48
abstracting: (F9<=Section_6)
states: 154
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EG [[EX [F5<=F8] & ~ [[Section_5<=F12 | F4<=F5]]]]
normalized: EG [[~ [[Section_5<=F12 | F4<=F5]] & EX [F5<=F8]]]

abstracting: (F5<=F8)
states: 135
.abstracting: (F4<=F5)
states: 195
abstracting: (Section_5<=F12)
states: 154
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: E [[3<=F5 & [F3<=Section_6 | F4<=F8]] U EX [F4<=F3]]
normalized: E [[[F3<=Section_6 | F4<=F8] & 3<=F5] U EX [F4<=F3]]

abstracting: (F4<=F3)
states: 150
.abstracting: (3<=F5)
states: 0
abstracting: (F4<=F8)
states: 182
abstracting: (F3<=Section_6)
states: 154
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: [~ [AG [2<=Section_3]] | ~ [~ [[F9<=Section_2 & [F9<=Section_11 | F12<=F8]]]]]
normalized: [[[F9<=Section_11 | F12<=F8] & F9<=Section_2] | E [true U ~ [2<=Section_3]]]

abstracting: (2<=Section_3)
states: 0
abstracting: (F9<=Section_2)
states: 154
abstracting: (F12<=F8)
states: 182
abstracting: (F9<=Section_11)
states: 165
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EG [[~ [Section_9<=Section_2] & [~ [2<=F12] & [F2<=Section_2 & Section_10<=F7]]]]
normalized: EG [[[[F2<=Section_2 & Section_10<=F7] & ~ [2<=F12]] & ~ [Section_9<=Section_2]]]

abstracting: (Section_9<=Section_2)
states: 144
abstracting: (2<=F12)
states: 0
abstracting: (Section_10<=F7)
states: 167
abstracting: (F2<=Section_2)
states: 75
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [[~ [2<=Section_10] | AF [[F11<=Section_2 | 2<=F9]]] | [EF [[3<=Section_11 | F11<=Section_4]] | ~ [AF [F4<=Section_4]]]]
normalized: [[EG [~ [F4<=Section_4]] | E [true U [3<=Section_11 | F11<=Section_4]]] | [~ [EG [~ [[F11<=Section_2 | 2<=F9]]]] | ~ [2<=Section_10]]]

abstracting: (2<=Section_10)
states: 0
abstracting: (2<=F9)
states: 0
abstracting: (F11<=Section_2)
states: 64
...........
EG iterations: 11
abstracting: (F11<=Section_4)
states: 48
abstracting: (3<=Section_11)
states: 0
abstracting: (F4<=Section_4)
states: 120
....................
EG iterations: 20
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: [[[~ [[2<=Section_2 & Section_12<=Section_3]] & ~ [~ [Section_12<=F10]]] & Section_7<=Section_8] & [~ [EF [1<=F8]] | ~ [~ [[3<=Section_5 & Section_7<=Section_4]]]]]
normalized: [[[3<=Section_5 & Section_7<=Section_4] | ~ [E [true U 1<=F8]]] & [Section_7<=Section_8 & [Section_12<=F10 & ~ [[2<=Section_2 & Section_12<=Section_3]]]]]

abstracting: (Section_12<=Section_3)
states: 144
abstracting: (2<=Section_2)
states: 0
abstracting: (Section_12<=F10)
states: 154
abstracting: (Section_7<=Section_8)
states: 150
abstracting: (1<=F8)
states: 171
abstracting: (Section_7<=Section_4)
states: 161
abstracting: (3<=Section_5)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: ~ [[[[[3<=F5 & F5<=F10] | [3<=F3 | F9<=Section_10]] | AX [Section_10<=F12]] | [[[F6<=Section_7 | 1<=F3] | [F6<=F3 & 3<=F6]] & F10<=Section_1]]]
normalized: ~ [[[[[F6<=Section_7 | 1<=F3] | [F6<=F3 & 3<=F6]] & F10<=Section_1] | [~ [EX [~ [Section_10<=F12]]] | [[3<=F5 & F5<=F10] | [3<=F3 | F9<=Section_10]]]]]

abstracting: (F9<=Section_10)
states: 120
abstracting: (3<=F3)
states: 0
abstracting: (F5<=F10)
states: 66
abstracting: (3<=F5)
states: 0
abstracting: (Section_10<=F12)
states: 167
.abstracting: (F10<=Section_1)
states: 137
abstracting: (3<=F6)
states: 0
abstracting: (F6<=F3)
states: 144
abstracting: (1<=F3)
states: 75
abstracting: (F6<=Section_7)
states: 120
-> the formula is FALSE

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

MC time: 0m 0.002sec

totally nodes used: 7720 (7.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4361 16952 21313
used/not used/entry size/cache size: 21720 67087144 16 1024MB
basic ops cache: hits/miss/sum: 2533 12063 14596
used/not used/entry size/cache size: 20995 16756221 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 681 2039 2720
used/not used/entry size/cache size: 2039 8386569 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67101496
1 7221
2 47
3 59
4 18
5 8
6 7
7 2
8 3
9 0
>= 10 3

Total processing time: 0m 7.759sec


BK_STOP 1494466253440

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

check for maximal unmarked siphon
ok
check for constant places
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.000sec

zbdd.cc:1122: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
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.000sec


iterations count:112 (9), effective:24 (2)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:30 (2), effective:8 (0)

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

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

iterations count:59 (4), effective:14 (1)

iterations count:33 (2), effective:4 (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-012"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-012.tgz
mv CircularTrains-PT-012 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is 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 r001-csrt-149436061700615"
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 ;