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-167814393000150.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000150
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-01
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-02
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-03
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-04
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-05
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-06
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-07
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-08
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-09
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-10
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-11
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-12
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-13
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-14
FORMULA_NAME CircularTrains-PT-012-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678270151229

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-012
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.815sec


RS generation: 0m 0.001sec


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



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

checking: AG [1<=Section_7]
normalized: ~ [E [true U ~ [1<=Section_7]]]

abstracting: (1<=Section_7)
states: 45
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [Section_3<=1]
normalized: ~ [E [true U ~ [Section_3<=1]]]

abstracting: (Section_3<=1)
states: 195
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [1<=Section_8]]
normalized: ~ [E [true U 1<=Section_8]]

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

FORMULA CircularTrains-PT-012-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=F5)
states: 171
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [Section_6<=F5]
normalized: ~ [E [true U ~ [Section_6<=F5]]]

abstracting: (Section_6<=F5)
states: 171
-> the formula is FALSE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[Section_12<=1 | F6<=0]]
normalized: E [true U [Section_12<=1 | F6<=0]]

abstracting: (F6<=0)
states: 120
abstracting: (Section_12<=1)
states: 195
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [Section_2<=F3]
normalized: ~ [E [true U ~ [Section_2<=F3]]]

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

FORMULA CircularTrains-PT-012-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (Section_8<=F11)
states: 189
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [~ [[F4<=0 & F1<=Section_3]]]
normalized: E [true U ~ [[F4<=0 & F1<=Section_3]]]

abstracting: (F1<=Section_3)
states: 154
abstracting: (F4<=0)
states: 120
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[[Section_7<=1 | ~ [[F11<=Section_1 & ~ [F8<=1]]]] & F7<=F1]] | ~ [Section_1<=Section_6]]]
normalized: E [true U [~ [[[~ [[~ [F8<=1] & F11<=Section_1]] | Section_7<=1] & F7<=F1]] | ~ [Section_1<=Section_6]]]

abstracting: (Section_1<=Section_6)
states: 167
abstracting: (F7<=F1)
states: 144
abstracting: (Section_7<=1)
states: 195
abstracting: (F11<=Section_1)
states: 41
abstracting: (F8<=1)
states: 126
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[~ [1<=Section_11] | [~ [[Section_2<=0 | [[[1<=Section_6 | 1<=Section_4] | [Section_1<=1 | F12<=Section_9]] | Section_4<=0]]] & F1<=F7]]] | [Section_9<=0 & ~ [[~ [[1<=F8 | ~ [[1<=Section_10 | ~ [1<=F6]]]]] | [[~ [[[1<=F11 | Section_9<=Section_10] | F8<=F9]] & Section_6<=F10] & [[~ [Section_4<=F11] & [~ [F1<=Section_7] & ~ [Section_9<=Section_5]]] | F6<=0]]]]]]]
normalized: E [true U [[~ [[[[[[~ [Section_9<=Section_5] & ~ [F1<=Section_7]] & ~ [Section_4<=F11]] | F6<=0] & [~ [[[1<=F11 | Section_9<=Section_10] | F8<=F9]] & Section_6<=F10]] | ~ [[~ [[~ [1<=F6] | 1<=Section_10]] | 1<=F8]]]] & Section_9<=0] | ~ [[[~ [[[[[Section_1<=1 | F12<=Section_9] | [1<=Section_6 | 1<=Section_4]] | Section_4<=0] | Section_2<=0]] & F1<=F7] | ~ [1<=Section_11]]]]]

abstracting: (1<=Section_11)
states: 75
abstracting: (F1<=F7)
states: 144
abstracting: (Section_2<=0)
states: 120
abstracting: (Section_4<=0)
states: 150
abstracting: (1<=Section_4)
states: 45
abstracting: (1<=Section_6)
states: 75
abstracting: (F12<=Section_9)
states: 154
abstracting: (Section_1<=1)
states: 195
abstracting: (Section_9<=0)
states: 120
abstracting: (1<=F8)
states: 171
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=F6)
states: 75
abstracting: (Section_6<=F10)
states: 154
abstracting: (F8<=F9)
states: 58
abstracting: (Section_9<=Section_10)
states: 120
abstracting: (1<=F11)
states: 171
abstracting: (F6<=0)
states: 120
abstracting: (Section_4<=F11)
states: 190
abstracting: (F1<=Section_7)
states: 137
abstracting: (Section_9<=Section_5)
states: 144
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[[Section_11<=0 | ~ [Section_9<=1]] | [~ [1<=Section_12] | [[[[[[Section_8<=0 & F6<=Section_7] & [1<=F7 | 1<=Section_10]] | [~ [Section_2<=1] | [Section_5<=0 & 1<=F4]]] | [[[Section_7<=0 | F9<=F1] | [F1<=1 | Section_8<=0]] | F10<=1]] | [~ [[F1<=F8 | F9<=Section_4]] & F10<=1]] & [[~ [[~ [Section_12<=1] & [Section_5<=1 | Section_11<=1]]] & F2<=F1] & ~ [1<=F7]]]]] & Section_3<=1]]
normalized: ~ [E [true U ~ [[[[[[[[[[F1<=1 | Section_8<=0] | [Section_7<=0 | F9<=F1]] | F10<=1] | [[[Section_5<=0 & 1<=F4] | ~ [Section_2<=1]] | [[1<=F7 | 1<=Section_10] & [Section_8<=0 & F6<=Section_7]]]] | [~ [[F1<=F8 | F9<=Section_4]] & F10<=1]] & [~ [1<=F7] & [~ [[[Section_5<=1 | Section_11<=1] & ~ [Section_12<=1]]] & F2<=F1]]] | ~ [1<=Section_12]] | [~ [Section_9<=1] | Section_11<=0]] & Section_3<=1]]]]

abstracting: (Section_3<=1)
states: 195
abstracting: (Section_11<=0)
states: 120
abstracting: (Section_9<=1)
states: 195
abstracting: (1<=Section_12)
states: 75
abstracting: (F2<=F1)
states: 58
abstracting: (Section_12<=1)
states: 195
abstracting: (Section_11<=1)
states: 195
abstracting: (Section_5<=1)
states: 195
abstracting: (1<=F7)
states: 75
abstracting: (F10<=1)
states: 195
abstracting: (F9<=Section_4)
states: 137
abstracting: (F1<=F8)
states: 182
abstracting: (F6<=Section_7)
states: 120
abstracting: (Section_8<=0)
states: 120
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=F7)
states: 75
abstracting: (Section_2<=1)
states: 195
abstracting: (1<=F4)
states: 75
abstracting: (Section_5<=0)
states: 120
abstracting: (F10<=1)
states: 195
abstracting: (F9<=F1)
states: 144
abstracting: (Section_7<=0)
states: 150
abstracting: (Section_8<=0)
states: 120
abstracting: (F1<=1)
states: 195
-> the formula is FALSE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[[[~ [Section_7<=1] | ~ [[[1<=F9 & F3<=Section_11] | ~ [1<=F3]]]] & [1<=Section_2 & ~ [[1<=Section_10 & 1<=F10]]]] | ~ [1<=Section_3]]] | ~ [[~ [[F8<=F8 & [[[1<=F12 | [F4<=Section_3 & F7<=1]] | ~ [1<=Section_12]] | ~ [[Section_9<=0 & [F3<=Section_10 & F3<=0]]]]]] | [~ [[~ [[~ [Section_10<=0] | ~ [F2<=Section_10]]] | [F1<=1 & Section_2<=Section_9]]] | [[[Section_8<=1 | [F9<=1 & [1<=F3 | 1<=F3]]] | ~ [[[1<=Section_10 | F1<=F1] | F2<=F6]]] | 1<=F8]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[~ [[~ [1<=F3] | [1<=F9 & F3<=Section_11]]] | ~ [Section_7<=1]] & [1<=Section_2 & ~ [[1<=Section_10 & 1<=F10]]]] | ~ [1<=Section_3]]] | ~ [[[[[~ [[[1<=Section_10 | F1<=F1] | F2<=F6]] | [[[1<=F3 | 1<=F3] & F9<=1] | Section_8<=1]] | 1<=F8] | ~ [[[F1<=1 & Section_2<=Section_9] | ~ [[~ [F2<=Section_10] | ~ [Section_10<=0]]]]]] | ~ [[[~ [[[F3<=Section_10 & F3<=0] & Section_9<=0]] | [~ [1<=Section_12] | [[F4<=Section_3 & F7<=1] | 1<=F12]]] & F8<=F8]]]]]]]]

abstracting: (F8<=F8)
states: 195
abstracting: (1<=F12)
states: 75
abstracting: (F7<=1)
states: 195
abstracting: (F4<=Section_3)
states: 165
abstracting: (1<=Section_12)
states: 75
abstracting: (Section_9<=0)
states: 120
abstracting: (F3<=0)
states: 120
abstracting: (F3<=Section_10)
states: 137
abstracting: (Section_10<=0)
states: 150
abstracting: (F2<=Section_10)
states: 48
abstracting: (Section_2<=Section_9)
states: 144
abstracting: (F1<=1)
states: 195
abstracting: (1<=F8)
states: 171
abstracting: (Section_8<=1)
states: 195
abstracting: (F9<=1)
states: 195
abstracting: (1<=F3)
states: 75
abstracting: (1<=F3)
states: 75
abstracting: (F2<=F6)
states: 66
abstracting: (F1<=F1)
states: 195
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=Section_3)
states: 75
abstracting: (1<=F10)
states: 75
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=Section_2)
states: 75
abstracting: (Section_7<=1)
states: 195
abstracting: (F3<=Section_11)
states: 154
abstracting: (1<=F9)
states: 75
abstracting: (1<=F3)
states: 75
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [~ [[[[[[~ [Section_7<=Section_6] | F2<=F3] | [[[[Section_10<=Section_10 | Section_2<=Section_9] | ~ [1<=Section_1]] & [Section_12<=Section_7 & ~ [1<=Section_7]]] & ~ [[[1<=F10 | F6<=1] | ~ [1<=Section_6]]]]] | [[Section_3<=Section_11 & 1<=Section_12] | Section_10<=Section_9]] | [[F11<=F5 | [[1<=Section_3 & [[1<=F10 | F3<=0] | ~ [1<=F3]]] | [[[1<=Section_1 | F9<=Section_11] & F4<=1] | ~ [[1<=Section_4 | 1<=Section_5]]]]] | [1<=F12 | ~ [[[[Section_1<=1 & Section_11<=0] | ~ [Section_9<=F11]] & [[Section_11<=1 | 1<=F5] & ~ [1<=Section_10]]]]]]] | 1<=Section_9]]]
normalized: ~ [E [true U [[[[~ [[[~ [1<=Section_10] & [Section_11<=1 | 1<=F5]] & [~ [Section_9<=F11] | [Section_1<=1 & Section_11<=0]]]] | 1<=F12] | [[[~ [[1<=Section_4 | 1<=Section_5]] | [[1<=Section_1 | F9<=Section_11] & F4<=1]] | [[~ [1<=F3] | [1<=F10 | F3<=0]] & 1<=Section_3]] | F11<=F5]] | [[[Section_3<=Section_11 & 1<=Section_12] | Section_10<=Section_9] | [[~ [[~ [1<=Section_6] | [1<=F10 | F6<=1]]] & [[~ [1<=Section_7] & Section_12<=Section_7] & [~ [1<=Section_1] | [Section_10<=Section_10 | Section_2<=Section_9]]]] | [~ [Section_7<=Section_6] | F2<=F3]]]] | 1<=Section_9]]]

abstracting: (1<=Section_9)
states: 75
abstracting: (F2<=F3)
states: 58
abstracting: (Section_7<=Section_6)
states: 150
abstracting: (Section_2<=Section_9)
states: 144
abstracting: (Section_10<=Section_10)
states: 195
abstracting: (1<=Section_1)
states: 45
abstracting: (Section_12<=Section_7)
states: 137
abstracting: (1<=Section_7)
states: 45
abstracting: (F6<=1)
states: 195
abstracting: (1<=F10)
states: 75
abstracting: (1<=Section_6)
states: 75
abstracting: (Section_10<=Section_9)
states: 150
abstracting: (1<=Section_12)
states: 75
abstracting: (Section_3<=Section_11)
states: 144
abstracting: (F11<=F5)
states: 132
abstracting: (1<=Section_3)
states: 75
abstracting: (F3<=0)
states: 120
abstracting: (1<=F10)
states: 75
abstracting: (1<=F3)
states: 75
abstracting: (F4<=1)
states: 195
abstracting: (F9<=Section_11)
states: 165
abstracting: (1<=Section_1)
states: 45
abstracting: (1<=Section_5)
states: 75
abstracting: (1<=Section_4)
states: 45
abstracting: (1<=F12)
states: 75
abstracting: (Section_11<=0)
states: 120
abstracting: (Section_1<=1)
states: 195
abstracting: (Section_9<=F11)
states: 188
abstracting: (1<=F5)
states: 171
abstracting: (Section_11<=1)
states: 195
abstracting: (1<=Section_10)
states: 45
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[[[Section_12<=1 | [[[[1<=Section_10 & F1<=1] & ~ [F10<=0]] & [[Section_2<=F11 | 1<=Section_3] | F2<=0]] | 1<=Section_9]] & [[[[[F10<=0 | Section_7<=1] | ~ [1<=Section_5]] | Section_2<=Section_12] | [~ [[Section_1<=Section_9 | Section_10<=F1]] | [[Section_4<=1 | 1<=Section_4] | [1<=Section_2 & 1<=Section_10]]]] | ~ [[[F9<=Section_7 & Section_9<=1] & [F4<=1 & Section_11<=Section_10]]]]] | [[[[[[Section_9<=0 & F12<=Section_3] | [F4<=0 | F1<=1]] | [[Section_12<=F9 & F12<=F7] & ~ [1<=F3]]] & [~ [Section_9<=1] & ~ [[Section_3<=F12 & Section_2<=1]]]] & ~ [[~ [F6<=F9] | F10<=0]]] | ~ [[F10<=Section_2 & [1<=Section_7 | [[1<=Section_8 & 1<=Section_2] & 1<=Section_2]]]]]] | ~ [[~ [[~ [[[F5<=0 & F9<=0] & [Section_6<=F10 | 1<=Section_10]]] | [[[F11<=F6 & Section_6<=0] | [Section_2<=1 & 1<=Section_6]] | [1<=F4 & [1<=Section_11 & Section_8<=F7]]]]] & [F9<=F12 | ~ [F3<=1]]]]] | Section_4<=F9]]
normalized: ~ [E [true U ~ [[[~ [[[~ [F3<=1] | F9<=F12] & ~ [[[[[1<=Section_11 & Section_8<=F7] & 1<=F4] | [[Section_2<=1 & 1<=Section_6] | [F11<=F6 & Section_6<=0]]] | ~ [[[Section_6<=F10 | 1<=Section_10] & [F5<=0 & F9<=0]]]]]]] | [[~ [[[[[1<=Section_8 & 1<=Section_2] & 1<=Section_2] | 1<=Section_7] & F10<=Section_2]] | [~ [[~ [F6<=F9] | F10<=0]] & [[~ [[Section_3<=F12 & Section_2<=1]] & ~ [Section_9<=1]] & [[~ [1<=F3] & [Section_12<=F9 & F12<=F7]] | [[F4<=0 | F1<=1] | [Section_9<=0 & F12<=Section_3]]]]]] | [[~ [[[F4<=1 & Section_11<=Section_10] & [F9<=Section_7 & Section_9<=1]]] | [[[[1<=Section_2 & 1<=Section_10] | [Section_4<=1 | 1<=Section_4]] | ~ [[Section_1<=Section_9 | Section_10<=F1]]] | [[~ [1<=Section_5] | [F10<=0 | Section_7<=1]] | Section_2<=Section_12]]] & [[[[[Section_2<=F11 | 1<=Section_3] | F2<=0] & [~ [F10<=0] & [1<=Section_10 & F1<=1]]] | 1<=Section_9] | Section_12<=1]]]] | Section_4<=F9]]]]

abstracting: (Section_4<=F9)
states: 167
abstracting: (Section_12<=1)
states: 195
abstracting: (1<=Section_9)
states: 75
abstracting: (F1<=1)
states: 195
abstracting: (1<=Section_10)
states: 45
abstracting: (F10<=0)
states: 120
abstracting: (F2<=0)
states: 24
abstracting: (1<=Section_3)
states: 75
abstracting: (Section_2<=F11)
states: 188
abstracting: (Section_2<=Section_12)
states: 150
abstracting: (Section_7<=1)
states: 195
abstracting: (F10<=0)
states: 120
abstracting: (1<=Section_5)
states: 75
abstracting: (Section_10<=F1)
states: 167
abstracting: (Section_1<=Section_9)
states: 167
abstracting: (1<=Section_4)
states: 45
abstracting: (Section_4<=1)
states: 195
abstracting: (1<=Section_10)
states: 45
abstracting: (1<=Section_2)
states: 75
abstracting: (Section_9<=1)
states: 195
abstracting: (F9<=Section_7)
states: 137
abstracting: (Section_11<=Section_10)
states: 120
abstracting: (F4<=1)
states: 195
abstracting: (F12<=Section_3)
states: 154
abstracting: (Section_9<=0)
states: 120
abstracting: (F1<=1)
states: 195
abstracting: (F4<=0)
states: 120
abstracting: (F12<=F7)
states: 144
abstracting: (Section_12<=F9)
states: 154
abstracting: (1<=F3)
states: 75
abstracting: (Section_9<=1)
states: 195
abstracting: (Section_2<=1)
states: 195
abstracting: (Section_3<=F12)
states: 154
abstracting: (F10<=0)
states: 120
abstracting: (F6<=F9)
states: 144
abstracting: (F10<=Section_2)
states: 154
abstracting: (1<=Section_7)
states: 45
abstracting: (1<=Section_2)
states: 75
abstracting: (1<=Section_2)
states: 75
abstracting: (1<=Section_8)
states: 75
abstracting: (F9<=0)
states: 120
abstracting: (F5<=0)
states: 24
abstracting: (1<=Section_10)
states: 45
abstracting: (Section_6<=F10)
states: 154
abstracting: (Section_6<=0)
states: 120
abstracting: (F11<=F6)
states: 66
abstracting: (1<=Section_6)
states: 75
abstracting: (Section_2<=1)
states: 195
abstracting: (1<=F4)
states: 75
abstracting: (Section_8<=F7)
states: 120
abstracting: (1<=Section_11)
states: 75
abstracting: (F9<=F12)
states: 144
abstracting: (F3<=1)
states: 195
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EF [[[[[~ [F6<=1] | [[[~ [[F8<=F11 & F9<=F2]] | Section_6<=Section_8] & Section_6<=Section_6] & ~ [1<=F6]]] & ~ [[[~ [[[F2<=F6 | F1<=Section_4] | [F5<=Section_4 & F7<=Section_4]]] | [[~ [1<=Section_1] & ~ [Section_9<=Section_7]] & ~ [[F6<=F2 & F1<=1]]]] | [[~ [[F4<=F6 | 1<=F9]] | 1<=F2] & [F10<=Section_8 | [~ [Section_3<=Section_8] | ~ [Section_6<=F3]]]]]]] | [[~ [[[Section_10<=Section_4 & [Section_6<=F2 & Section_6<=F6]] & Section_8<=F8]] | [Section_4<=F5 & [Section_11<=Section_6 | [~ [1<=F6] | ~ [Section_6<=F4]]]]] | [[[[[[F11<=F2 & F5<=1] | ~ [1<=Section_2]] | F5<=F6] & [[Section_11<=0 | Section_1<=1] & Section_4<=0]] & ~ [1<=Section_1]] | F9<=F2]]] | ~ [[~ [[F4<=F10 | ~ [[Section_1<=1 & Section_9<=F12]]]] | ~ [[~ [[[Section_6<=Section_9 & Section_3<=0] & [Section_10<=Section_2 & Section_4<=F10]]] | [~ [[[1<=Section_3 & Section_4<=0] & [F9<=1 | F1<=1]]] | [[~ [1<=Section_3] & ~ [1<=Section_4]] & [[F9<=1 & 1<=F2] & [1<=Section_7 | Section_7<=F6]]]]]]]]]]
normalized: E [true U [~ [[~ [[[[[[1<=Section_7 | Section_7<=F6] & [F9<=1 & 1<=F2]] & [~ [1<=Section_4] & ~ [1<=Section_3]]] | ~ [[[F9<=1 | F1<=1] & [1<=Section_3 & Section_4<=0]]]] | ~ [[[Section_10<=Section_2 & Section_4<=F10] & [Section_6<=Section_9 & Section_3<=0]]]]] | ~ [[~ [[Section_1<=1 & Section_9<=F12]] | F4<=F10]]]] | [[[[~ [1<=Section_1] & [[[Section_11<=0 | Section_1<=1] & Section_4<=0] & [[~ [1<=Section_2] | [F11<=F2 & F5<=1]] | F5<=F6]]] | F9<=F2] | [[[[~ [Section_6<=F4] | ~ [1<=F6]] | Section_11<=Section_6] & Section_4<=F5] | ~ [[[[Section_6<=F2 & Section_6<=F6] & Section_10<=Section_4] & Section_8<=F8]]]] | [~ [[[[[~ [Section_6<=F3] | ~ [Section_3<=Section_8]] | F10<=Section_8] & [~ [[F4<=F6 | 1<=F9]] | 1<=F2]] | [[~ [[F6<=F2 & F1<=1]] & [~ [Section_9<=Section_7] & ~ [1<=Section_1]]] | ~ [[[F5<=Section_4 & F7<=Section_4] | [F2<=F6 | F1<=Section_4]]]]]] & [[~ [1<=F6] & [[~ [[F8<=F11 & F9<=F2]] | Section_6<=Section_8] & Section_6<=Section_6]] | ~ [F6<=1]]]]]]

abstracting: (F6<=1)
states: 195
abstracting: (Section_6<=Section_6)
states: 195
abstracting: (Section_6<=Section_8)
states: 150
abstracting: (F9<=F2)
states: 182
abstracting: (F8<=F11)
states: 135
abstracting: (1<=F6)
states: 75
abstracting: (F1<=Section_4)
states: 137
abstracting: (F2<=F6)
states: 66
abstracting: (F7<=Section_4)
states: 137
abstracting: (F5<=Section_4)
states: 41
abstracting: (1<=Section_1)
states: 45
abstracting: (Section_9<=Section_7)
states: 137
abstracting: (F1<=1)
states: 195
abstracting: (F6<=F2)
states: 182
abstracting: (1<=F2)
states: 171
abstracting: (1<=F9)
states: 75
abstracting: (F4<=F6)
states: 144
abstracting: (F10<=Section_8)
states: 154
abstracting: (Section_3<=Section_8)
states: 144
abstracting: (Section_6<=F3)
states: 154
abstracting: (Section_8<=F8)
states: 171
abstracting: (Section_10<=Section_4)
states: 161
abstracting: (Section_6<=F6)
states: 120
abstracting: (Section_6<=F2)
states: 189
abstracting: (Section_4<=F5)
states: 195
abstracting: (Section_11<=Section_6)
states: 144
abstracting: (1<=F6)
states: 75
abstracting: (Section_6<=F4)
states: 154
abstracting: (F9<=F2)
states: 182
abstracting: (F5<=F6)
states: 58
abstracting: (F5<=1)
states: 126
abstracting: (F11<=F2)
states: 135
abstracting: (1<=Section_2)
states: 75
abstracting: (Section_4<=0)
states: 150
abstracting: (Section_1<=1)
states: 195
abstracting: (Section_11<=0)
states: 120
abstracting: (1<=Section_1)
states: 45
abstracting: (F4<=F10)
states: 144
abstracting: (Section_9<=F12)
states: 154
abstracting: (Section_1<=1)
states: 195
abstracting: (Section_3<=0)
states: 120
abstracting: (Section_6<=Section_9)
states: 144
abstracting: (Section_4<=F10)
states: 167
abstracting: (Section_10<=Section_2)
states: 167
abstracting: (Section_4<=0)
states: 150
abstracting: (1<=Section_3)
states: 75
abstracting: (F1<=1)
states: 195
abstracting: (F9<=1)
states: 195
abstracting: (1<=Section_3)
states: 75
abstracting: (1<=Section_4)
states: 45
abstracting: (1<=F2)
states: 171
abstracting: (F9<=1)
states: 195
abstracting: (Section_7<=F6)
states: 150
abstracting: (1<=Section_7)
states: 45
-> the formula is TRUE

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

MC time: 0m 0.007sec

totally nodes used: 8492 (8.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3271 11341 14612
used/not used/entry size/cache size: 13171 67095693 16 1024MB
basic ops cache: hits/miss/sum: 5933 26925 32858
used/not used/entry size/cache size: 45681 16731535 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: 1614 4045 5659
used/not used/entry size/cache size: 4045 8384563 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 67100703
1 8004
2 85
3 50
4 9
5 6
6 1
7 0
8 0
9 0
>= 10 6

Total processing time: 0m 5.565sec


BK_STOP 1678270156880

--------------------
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:15 (1), effective:1 (0)

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

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

iterations count:78 (6), effective:13 (1)

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

iterations count:74 (6), effective:12 (1)

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

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

iterations count:46 (3), effective:10 (0)

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

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

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

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

iterations count:13 (1), effective:1 (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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167814393000150"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;