Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r065-smll-167814393000145.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r065-smll-167814393000145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 04:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

--------------------
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-00
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-012-CTLCardinality-09
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

=== Now, execution of the tool begins

BK_START 1678270098672

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-012
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

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


RS generation: 0m 0.000sec


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



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

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

abstracting: (F10<=1)
states: 195
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [~ [1<=F11]]
normalized: E [true U ~ [1<=F11]]

abstracting: (1<=F11)
states: 171
-> 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: ~ [EX [EF [Section_9<=F3]]]
normalized: ~ [EX [E [true U Section_9<=F3]]]

abstracting: (Section_9<=F3)
states: 154
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EG [[1<=F3 | 1<=Section_8]]
normalized: EG [[1<=F3 | 1<=Section_8]]

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

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

MC time: 0m 0.001sec

checking: AX [~ [[Section_11<=0 | EG [~ [EX [F6<=F1]]]]]]
normalized: ~ [EX [[EG [~ [EX [F6<=F1]]] | Section_11<=0]]]

abstracting: (Section_11<=0)
states: 120
abstracting: (F6<=F1)
states: 144
...........
EG iterations: 10
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: ~ [[[~ [AF [Section_6<=1]] & EG [Section_4<=1]] | ~ [EX [EG [EF [Section_1<=F3]]]]]]
normalized: ~ [[~ [EX [EG [E [true U Section_1<=F3]]]] | [EG [Section_4<=1] & EG [~ [Section_6<=1]]]]]

abstracting: (Section_6<=1)
states: 195
.
EG iterations: 1
abstracting: (Section_4<=1)
states: 195

EG iterations: 0
abstracting: (Section_1<=F3)
states: 167

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: ~ [[AX [F10<=Section_9] | ~ [AG [EF [[[Section_2<=0 | F6<=F7] & [1<=Section_9 | F1<=Section_11]]]]]]]
normalized: ~ [[E [true U ~ [E [true U [[1<=Section_9 | F1<=Section_11] & [Section_2<=0 | F6<=F7]]]]] | ~ [EX [~ [F10<=Section_9]]]]]

abstracting: (F10<=Section_9)
states: 165
.abstracting: (F6<=F7)
states: 150
abstracting: (Section_2<=0)
states: 120
abstracting: (F1<=Section_11)
states: 154
abstracting: (1<=Section_9)
states: 75
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [EX [[E [[EX [Section_3<=0] | Section_8<=1] U [~ [[1<=F4 | Section_4<=0]] | EX [1<=Section_5]]] | ~ [E [EF [1<=Section_10] U [1<=F5 | 1<=F9]]]]]]
normalized: ~ [EX [[~ [E [E [true U 1<=Section_10] U [1<=F5 | 1<=F9]]] | E [[EX [Section_3<=0] | Section_8<=1] U [EX [1<=Section_5] | ~ [[1<=F4 | Section_4<=0]]]]]]]

abstracting: (Section_4<=0)
states: 150
abstracting: (1<=F4)
states: 75
abstracting: (1<=Section_5)
states: 75
.abstracting: (Section_8<=1)
states: 195
abstracting: (Section_3<=0)
states: 120
.abstracting: (1<=F9)
states: 75
abstracting: (1<=F5)
states: 171
abstracting: (1<=Section_10)
states: 45
.-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: AF [E [[1<=Section_2 & E [1<=F10 U 1<=Section_1]] U EG [E [[Section_7<=1 & 1<=Section_7] U [1<=Section_10 & F12<=F3]]]]]
normalized: ~ [EG [~ [E [[E [1<=F10 U 1<=Section_1] & 1<=Section_2] U EG [E [[Section_7<=1 & 1<=Section_7] U [1<=Section_10 & F12<=F3]]]]]]]

abstracting: (F12<=F3)
states: 144
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=Section_7)
states: 45
abstracting: (Section_7<=1)
states: 195
.............
EG iterations: 13
abstracting: (1<=Section_2)
states: 75
abstracting: (1<=Section_1)
states: 45
abstracting: (1<=F10)
states: 75

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: AX [[EF [[E [Section_3<=Section_8 U ~ [1<=F8]] | F10<=F5]] | [~ [F7<=Section_3] & Section_3<=F11]]]
normalized: ~ [EX [~ [[[~ [F7<=Section_3] & Section_3<=F11] | E [true U [E [Section_3<=Section_8 U ~ [1<=F8]] | F10<=F5]]]]]]

abstracting: (F10<=F5)
states: 182
abstracting: (1<=F8)
states: 171
abstracting: (Section_3<=Section_8)
states: 144
abstracting: (Section_3<=F11)
states: 189
abstracting: (F7<=Section_3)
states: 154
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EX [[A [1<=F2 U AF [F10<=F4]] | AG [[AF [[Section_1<=1 | Section_4<=0]] | ~ [[AF [1<=F9] | [1<=F3 & F7<=F11]]]]]]]
normalized: EX [[~ [E [true U ~ [[~ [[[1<=F3 & F7<=F11] | ~ [EG [~ [1<=F9]]]]] | ~ [EG [~ [[Section_1<=1 | Section_4<=0]]]]]]]] | [~ [EG [EG [~ [F10<=F4]]]] & ~ [E [EG [~ [F10<=F4]] U [~ [1<=F2] & EG [~ [F10<=F4]]]]]]]]

abstracting: (F10<=F4)
states: 144
.........
EG iterations: 9
abstracting: (1<=F2)
states: 171
abstracting: (F10<=F4)
states: 144
.........
EG iterations: 9
abstracting: (F10<=F4)
states: 144
.........
EG iterations: 9
.
EG iterations: 1
abstracting: (Section_4<=0)
states: 150
abstracting: (Section_1<=1)
states: 195
.
EG iterations: 1
abstracting: (1<=F9)
states: 75
.....................
EG iterations: 21
abstracting: (F7<=F11)
states: 182
abstracting: (1<=F3)
states: 75
.-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: E [~ [[[Section_3<=Section_4 | E [[EG [1<=Section_3] | [F1<=F2 & 1<=Section_10]] U E [1<=Section_12 U 1<=F10]]] | 1<=Section_9]] U 1<=Section_8]
normalized: E [~ [[[E [[[F1<=F2 & 1<=Section_10] | EG [1<=Section_3]] U E [1<=Section_12 U 1<=F10]] | Section_3<=Section_4] | 1<=Section_9]] U 1<=Section_8]

abstracting: (1<=Section_8)
states: 75
abstracting: (1<=Section_9)
states: 75
abstracting: (Section_3<=Section_4)
states: 120
abstracting: (1<=F10)
states: 75
abstracting: (1<=Section_12)
states: 75
abstracting: (1<=Section_3)
states: 75
....................
EG iterations: 20
abstracting: (1<=Section_10)
states: 45
abstracting: (F1<=F2)
states: 195
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: AF [[~ [[~ [AG [[1<=F6 & Section_5<=0]]] | AF [~ [1<=Section_11]]]] & [~ [EX [Section_4<=1]] & [AX [[E [F8<=F2 U 1<=F12] | EX [1<=Section_6]]] & A [EX [F10<=1] U A [1<=F8 U 1<=F10]]]]]]
normalized: ~ [EG [~ [[[[[~ [EG [~ [[~ [EG [~ [1<=F10]]] & ~ [E [~ [1<=F10] U [~ [1<=F8] & ~ [1<=F10]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=F10]]] & ~ [E [~ [1<=F10] U [~ [1<=F8] & ~ [1<=F10]]]]]] U [~ [EX [F10<=1]] & ~ [[~ [EG [~ [1<=F10]]] & ~ [E [~ [1<=F10] U [~ [1<=F8] & ~ [1<=F10]]]]]]]]]] & ~ [EX [~ [[EX [1<=Section_6] | E [F8<=F2 U 1<=F12]]]]]] & ~ [EX [Section_4<=1]]] & ~ [[~ [EG [1<=Section_11]] | E [true U ~ [[1<=F6 & Section_5<=0]]]]]]]]]

abstracting: (Section_5<=0)
states: 120
abstracting: (1<=F6)
states: 75
abstracting: (1<=Section_11)
states: 75
....................
EG iterations: 20
abstracting: (Section_4<=1)
states: 195
.abstracting: (1<=F12)
states: 75
abstracting: (F8<=F2)
states: 132
abstracting: (1<=Section_6)
states: 75
..abstracting: (1<=F10)
states: 75
abstracting: (1<=F8)
states: 171
abstracting: (1<=F10)
states: 75
abstracting: (1<=F10)
states: 75
.....................
EG iterations: 21
abstracting: (F10<=1)
states: 195
.abstracting: (1<=F10)
states: 75
abstracting: (1<=F8)
states: 171
abstracting: (1<=F10)
states: 75
abstracting: (1<=F10)
states: 75
.....................
EG iterations: 21
abstracting: (1<=F10)
states: 75
abstracting: (1<=F8)
states: 171
abstracting: (1<=F10)
states: 75
abstracting: (1<=F10)
states: 75
.....................
EG iterations: 21
.....................
EG iterations: 21

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.009sec

checking: EG [EG [E [A [[F3<=F10 | Section_12<=Section_1] U [F5<=F7 | F6<=1]] U [[F9<=F6 & 1<=F7] & EG [Section_10<=0]]]]]
normalized: EG [EG [E [[~ [EG [~ [[F5<=F7 | F6<=1]]]] & ~ [E [~ [[F5<=F7 | F6<=1]] U [~ [[F3<=F10 | Section_12<=Section_1]] & ~ [[F5<=F7 | F6<=1]]]]]] U [EG [Section_10<=0] & [F9<=F6 & 1<=F7]]]]]

abstracting: (1<=F7)
states: 75
abstracting: (F9<=F6)
states: 144
abstracting: (Section_10<=0)
states: 150
..........................
EG iterations: 26
abstracting: (F6<=1)
states: 195
abstracting: (F5<=F7)
states: 69
abstracting: (Section_12<=Section_1)
states: 120
abstracting: (F3<=F10)
states: 144
abstracting: (F6<=1)
states: 195
abstracting: (F5<=F7)
states: 69
abstracting: (F6<=1)
states: 195
abstracting: (F5<=F7)
states: 69
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [[[[[F5<=F4 & ~ [[~ [Section_8<=0] | [F8<=Section_2 | F2<=0]]]] & [[1<=Section_6 | E [F7<=F11 U F4<=Section_8]] & F8<=0]] & [AG [[[Section_9<=F8 & F7<=F6] & A [F1<=1 U 1<=Section_11]]] | Section_7<=F6]] & 1<=F10]]
normalized: E [true U [[[~ [E [true U ~ [[[~ [EG [~ [1<=Section_11]]] & ~ [E [~ [1<=Section_11] U [~ [F1<=1] & ~ [1<=Section_11]]]]] & [Section_9<=F8 & F7<=F6]]]]] | Section_7<=F6] & [[[E [F7<=F11 U F4<=Section_8] | 1<=Section_6] & F8<=0] & [~ [[[F8<=Section_2 | F2<=0] | ~ [Section_8<=0]]] & F5<=F4]]] & 1<=F10]]

abstracting: (1<=F10)
states: 75
abstracting: (F5<=F4)
states: 58
abstracting: (Section_8<=0)
states: 120
abstracting: (F2<=0)
states: 24
abstracting: (F8<=Section_2)
states: 60
abstracting: (F8<=0)
states: 24
abstracting: (1<=Section_6)
states: 75
abstracting: (F4<=Section_8)
states: 154
abstracting: (F7<=F11)
states: 182
abstracting: (Section_7<=F6)
states: 150
abstracting: (F7<=F6)
states: 150
abstracting: (Section_9<=F8)
states: 171
abstracting: (1<=Section_11)
states: 75
abstracting: (F1<=1)
states: 195
abstracting: (1<=Section_11)
states: 75
abstracting: (1<=Section_11)
states: 75
.....................
EG iterations: 21
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: E [[A [A [~ [[Section_7<=0 & F4<=1]] U EG [Section_6<=1]] U ~ [EG [Section_9<=Section_3]]] & ~ [[[[[[Section_12<=0 | 1<=Section_9] | AX [F8<=1]] | [[F2<=Section_2 & Section_9<=1] & E [Section_8<=0 U Section_11<=Section_4]]] & F7<=0] | [~ [1<=F5] & Section_3<=0]]]] U [1<=Section_7 & [[AX [[AG [Section_1<=0] & Section_9<=Section_1]] | [[[EG [1<=F10] | [F8<=F8 | 1<=Section_8]] | E [Section_8<=0 U Section_4<=1]] | [EF [1<=Section_4] | Section_5<=1]]] & [[AG [Section_7<=1] & AF [E [F5<=1 U 1<=Section_7]]] & AG [A [Section_4<=Section_4 U F10<=1]]]]]]
normalized: E [[~ [[[Section_3<=0 & ~ [1<=F5]] | [F7<=0 & [[E [Section_8<=0 U Section_11<=Section_4] & [F2<=Section_2 & Section_9<=1]] | [~ [EX [~ [F8<=1]]] | [Section_12<=0 | 1<=Section_9]]]]]] & [~ [EG [EG [Section_9<=Section_3]]] & ~ [E [EG [Section_9<=Section_3] U [~ [[~ [EG [~ [EG [Section_6<=1]]]] & ~ [E [~ [EG [Section_6<=1]] U [[Section_7<=0 & F4<=1] & ~ [EG [Section_6<=1]]]]]]] & EG [Section_9<=Section_3]]]]]] U [1<=Section_7 & [[~ [E [true U ~ [[~ [EG [~ [F10<=1]]] & ~ [E [~ [F10<=1] U [~ [Section_4<=Section_4] & ~ [F10<=1]]]]]]]] & [~ [EG [~ [E [F5<=1 U 1<=Section_7]]]] & ~ [E [true U ~ [Section_7<=1]]]]] & [[[Section_5<=1 | E [true U 1<=Section_4]] | [E [Section_8<=0 U Section_4<=1] | [[F8<=F8 | 1<=Section_8] | EG [1<=F10]]]] | ~ [EX [~ [[Section_9<=Section_1 & ~ [E [true U ~ [Section_1<=0]]]]]]]]]]]

abstracting: (Section_1<=0)
states: 150
abstracting: (Section_9<=Section_1)
states: 137
.abstracting: (1<=F10)
states: 75
....................
EG iterations: 20
abstracting: (1<=Section_8)
states: 75
abstracting: (F8<=F8)
states: 195
abstracting: (Section_4<=1)
states: 195
abstracting: (Section_8<=0)
states: 120
abstracting: (1<=Section_4)
states: 45
abstracting: (Section_5<=1)
states: 195
abstracting: (Section_7<=1)
states: 195
abstracting: (1<=Section_7)
states: 45
abstracting: (F5<=1)
states: 126
...............
EG iterations: 15
abstracting: (F10<=1)
states: 195
abstracting: (Section_4<=Section_4)
states: 195
abstracting: (F10<=1)
states: 195
abstracting: (F10<=1)
states: 195
.
EG iterations: 1
abstracting: (1<=Section_7)
states: 45
abstracting: (Section_9<=Section_3)
states: 144
.
EG iterations: 1
abstracting: (Section_6<=1)
states: 195

EG iterations: 0
abstracting: (F4<=1)
states: 195
abstracting: (Section_7<=0)
states: 150
abstracting: (Section_6<=1)
states: 195

EG iterations: 0
abstracting: (Section_6<=1)
states: 195

EG iterations: 0
.
EG iterations: 1
abstracting: (Section_9<=Section_3)
states: 144
.
EG iterations: 1
abstracting: (Section_9<=Section_3)
states: 144
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Section_9)
states: 75
abstracting: (Section_12<=0)
states: 120
abstracting: (F8<=1)
states: 126
.abstracting: (Section_9<=1)
states: 195
abstracting: (F2<=Section_2)
states: 75
abstracting: (Section_11<=Section_4)
states: 137
abstracting: (Section_8<=0)
states: 120
abstracting: (F7<=0)
states: 120
abstracting: (1<=F5)
states: 171
abstracting: (Section_3<=0)
states: 120
-> the formula is FALSE

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

MC time: 0m 0.009sec

totally nodes used: 19397 (1.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16693 53482 70175
used/not used/entry size/cache size: 70261 67038603 16 1024MB
basic ops cache: hits/miss/sum: 7113 27156 34269
used/not used/entry size/cache size: 49483 16727733 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: 1116 3143 4259
used/not used/entry size/cache size: 3143 8385465 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 67090589
1 17849
2 247
3 74
4 28
5 10
6 18
7 11
8 4
9 11
>= 10 23

Total processing time: 0m 5.211sec


BK_STOP 1678270105645

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


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

initing FirstDep: 0m 0.000sec


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

iterations count:58 (4), effective:13 (1)

iterations count:24 (2), effective:5 (0)

iterations count:24 (2), effective:5 (0)

iterations count:37 (3), effective:9 (0)

iterations count:45 (3), effective:6 (0)

iterations count:59 (4), effective:11 (0)

iterations count:21 (1), effective:3 (0)

iterations count:36 (3), effective:6 (0)

iterations count:34 (2), effective:5 (0)

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

iterations count:18 (1), effective:2 (0)

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

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

iterations count:21 (1), effective:3 (0)

iterations count:40 (3), effective:5 (0)

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

iterations count:53 (4), effective:13 (1)

iterations count:53 (4), effective:13 (1)

iterations count:53 (4), effective:13 (1)

iterations count:19 (1), effective:3 (0)

iterations count:41 (3), effective:8 (0)

iterations count:53 (4), effective:11 (0)

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

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

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

iterations count:45 (3), effective:6 (0)

iterations count:20 (1), effective:3 (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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
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 r065-smll-167814393000145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;