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.r321-tall-167889192600729.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 ResAllocation-PT-R005C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192600729
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:23 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 ResAllocation-PT-R005C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R005C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678942307595

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=ResAllocation-PT-R005C002
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: ResAllocation_PT_R005C002
(NrP: 20 NrTr: 12 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.895sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 61 (6.1e+01) #states 112



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

checking: EX [1<=r_0_4]
normalized: EX [1<=r_0_4]

abstracting: (1<=r_0_4)
states: 48
.-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

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

abstracting: (1<=r_1_4)
states: 64
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [r_1_0<=1 U ~ [1<=r_0_1]]
normalized: E [r_1_0<=1 U ~ [1<=r_0_1]]

abstracting: (1<=r_0_1)
states: 48
abstracting: (r_1_0<=1)
states: 112
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [p_0_3<=1] & E [p_0_1<=0 U p_1_0<=1]]
normalized: [E [p_0_1<=0 U p_1_0<=1] & EG [p_0_3<=1]]

abstracting: (p_0_3<=1)
states: 112

EG iterations: 0
abstracting: (p_1_0<=1)
states: 112
abstracting: (p_0_1<=0)
states: 72
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [~ [r_0_0<=r_1_2] U r_0_2<=1]
normalized: E [~ [r_0_0<=r_1_2] U r_0_2<=1]

abstracting: (r_0_2<=1)
states: 112
abstracting: (r_0_0<=r_1_2)
states: 100
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AG [EG [A [EG [p_1_0<=1] U [p_1_2<=r_1_0 & 1<=r_1_0]]]]]
normalized: EG [~ [E [true U ~ [EG [[~ [EG [~ [[p_1_2<=r_1_0 & 1<=r_1_0]]]] & ~ [E [~ [[p_1_2<=r_1_0 & 1<=r_1_0]] U [~ [EG [p_1_0<=1]] & ~ [[p_1_2<=r_1_0 & 1<=r_1_0]]]]]]]]]]]

abstracting: (1<=r_1_0)
states: 96
abstracting: (p_1_2<=r_1_0)
states: 104
abstracting: (p_1_0<=1)
states: 112

EG iterations: 0
abstracting: (1<=r_1_0)
states: 96
abstracting: (p_1_2<=r_1_0)
states: 104
abstracting: (1<=r_1_0)
states: 96
abstracting: (p_1_2<=r_1_0)
states: 104
............
EG iterations: 12

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AF [AF [[[~ [1<=r_1_3] | [~ [p_0_3<=r_0_1] | ~ [r_0_0<=0]]] & EX [~ [1<=p_0_1]]]]]]
normalized: EG [EG [~ [[EX [~ [1<=p_0_1]] & [[~ [r_0_0<=0] | ~ [p_0_3<=r_0_1]] | ~ [1<=r_1_3]]]]]]

abstracting: (1<=r_1_3)
states: 72
abstracting: (p_0_3<=r_0_1)
states: 100
abstracting: (r_0_0<=0)
states: 64
abstracting: (1<=p_0_1)
states: 40
.......
EG iterations: 6
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [EG [[E [~ [[p_0_4<=p_0_2 & r_0_2<=r_0_4]] U 1<=p_0_0] | AF [1<=p_1_3]]]]
normalized: ~ [EG [~ [EG [[~ [EG [~ [1<=p_1_3]]] | E [~ [[p_0_4<=p_0_2 & r_0_2<=r_0_4]] U 1<=p_0_0]]]]]]

abstracting: (1<=p_0_0)
states: 48
abstracting: (r_0_2<=r_0_4)
states: 84
abstracting: (p_0_4<=p_0_2)
states: 104
abstracting: (1<=p_1_3)
states: 40
.....
EG iterations: 5
......
EG iterations: 6
................
EG iterations: 16
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [EX [~ [E [[~ [1<=r_0_4] | [1<=r_1_2 | r_0_2<=p_1_2]] U ~ [[r_0_1<=r_1_0 & r_1_2<=p_1_2]]]]]]
normalized: ~ [EX [~ [EX [~ [E [[[1<=r_1_2 | r_0_2<=p_1_2] | ~ [1<=r_0_4]] U ~ [[r_0_1<=r_1_0 & r_1_2<=p_1_2]]]]]]]]

abstracting: (r_1_2<=p_1_2)
states: 32
abstracting: (r_0_1<=r_1_0)
states: 104
abstracting: (1<=r_0_4)
states: 48
abstracting: (r_0_2<=p_1_2)
states: 64
abstracting: (1<=r_1_2)
states: 80
..-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[E [AF [EX [1<=r_1_1]] U EF [1<=p_0_3]] | [A [[[A [r_1_2<=p_1_1 U r_1_1<=p_1_2] & [r_0_4<=1 | 1<=r_1_2]] | AF [r_0_0<=1]] U r_1_4<=1] & EX [~ [r_0_0<=r_0_0]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [r_1_4<=1]]] & ~ [E [~ [r_1_4<=1] U [~ [[~ [EG [~ [r_0_0<=1]]] | [[r_0_4<=1 | 1<=r_1_2] & [~ [EG [~ [r_1_1<=p_1_2]]] & ~ [E [~ [r_1_1<=p_1_2] U [~ [r_1_2<=p_1_1] & ~ [r_1_1<=p_1_2]]]]]]]] & ~ [r_1_4<=1]]]]] & EX [~ [r_0_0<=r_0_0]]] | E [~ [EG [~ [EX [1<=r_1_1]]]] U E [true U 1<=p_0_3]]]]]]

abstracting: (1<=p_0_3)
states: 24
abstracting: (1<=r_1_1)
states: 88
.........
EG iterations: 8
abstracting: (r_0_0<=r_0_0)
states: 112
.abstracting: (r_1_4<=1)
states: 112
abstracting: (r_1_1<=p_1_2)
states: 44
abstracting: (r_1_2<=p_1_1)
states: 44
abstracting: (r_1_1<=p_1_2)
states: 44
abstracting: (r_1_1<=p_1_2)
states: 44
.
EG iterations: 1
abstracting: (1<=r_1_2)
states: 80
abstracting: (r_0_4<=1)
states: 112
abstracting: (r_0_0<=1)
states: 112
.
EG iterations: 1
abstracting: (r_1_4<=1)
states: 112
abstracting: (r_1_4<=1)
states: 112
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[[[~ [EX [E [p_1_3<=p_0_0 U 1<=p_1_1]]] & AX [~ [p_0_1<=0]]] & 1<=p_1_4] | [EG [EX [[1<=r_0_1 & r_0_2<=r_1_0]]] | [[r_0_0<=r_1_0 | AG [~ [r_1_0<=r_1_4]]] | 1<=r_1_3]]]]
normalized: EX [[[[[~ [E [true U r_1_0<=r_1_4]] | r_0_0<=r_1_0] | 1<=r_1_3] | EG [EX [[1<=r_0_1 & r_0_2<=r_1_0]]]] | [[~ [EX [p_0_1<=0]] & ~ [EX [E [p_1_3<=p_0_0 U 1<=p_1_1]]]] & 1<=p_1_4]]]

abstracting: (1<=p_1_4)
states: 48
abstracting: (1<=p_1_1)
states: 24
abstracting: (p_1_3<=p_0_0)
states: 88
.abstracting: (p_0_1<=0)
states: 72
.abstracting: (r_0_2<=r_1_0)
states: 104
abstracting: (1<=r_0_1)
states: 48
.........
EG iterations: 8
abstracting: (1<=r_1_3)
states: 72
abstracting: (r_0_0<=r_1_0)
states: 112
abstracting: (r_1_0<=r_1_4)
states: 72
.-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[~ [AF [[[[[p_0_3<=0 | 1<=r_1_2] | A [p_0_1<=1 U 1<=r_1_0]] & [EG [p_0_1<=0] & A [r_1_0<=0 U p_0_1<=0]]] | r_1_1<=p_0_4]]] | AF [EX [~ [[[r_0_1<=p_1_1 & p_0_4<=1] & 1<=p_0_0]]]]]]
normalized: ~ [[~ [EG [~ [EX [~ [[[r_0_1<=p_1_1 & p_0_4<=1] & 1<=p_0_0]]]]]] | EG [~ [[[[[~ [EG [~ [1<=r_1_0]]] & ~ [E [~ [1<=r_1_0] U [~ [p_0_1<=1] & ~ [1<=r_1_0]]]]] | [p_0_3<=0 | 1<=r_1_2]] & [[~ [EG [~ [p_0_1<=0]]] & ~ [E [~ [p_0_1<=0] U [~ [r_1_0<=0] & ~ [p_0_1<=0]]]]] & EG [p_0_1<=0]]] | r_1_1<=p_0_4]]]]]

abstracting: (r_1_1<=p_0_4)
states: 40
abstracting: (p_0_1<=0)
states: 72
.....
EG iterations: 5
abstracting: (p_0_1<=0)
states: 72
abstracting: (r_1_0<=0)
states: 16
abstracting: (p_0_1<=0)
states: 72
abstracting: (p_0_1<=0)
states: 72
...
EG iterations: 3
abstracting: (1<=r_1_2)
states: 80
abstracting: (p_0_3<=0)
states: 88
abstracting: (1<=r_1_0)
states: 96
abstracting: (p_0_1<=1)
states: 112
abstracting: (1<=r_1_0)
states: 96
abstracting: (1<=r_1_0)
states: 96
............
EG iterations: 12
.
EG iterations: 1
abstracting: (1<=p_0_0)
states: 48
abstracting: (p_0_4<=1)
states: 112
abstracting: (r_0_1<=p_1_1)
states: 64
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AG [AG [~ [[E [p_1_3<=r_1_3 U r_1_4<=r_1_4] | [p_0_0<=r_0_4 | p_0_0<=p_0_4]]]]] | E [~ [[r_0_1<=1 & AX [E [p_0_0<=r_0_4 U r_1_3<=1]]]] U EG [[EG [EF [p_0_4<=1]] & 1<=r_0_3]]]]
normalized: [E [~ [[~ [EX [~ [E [p_0_0<=r_0_4 U r_1_3<=1]]]] & r_0_1<=1]] U EG [[EG [E [true U p_0_4<=1]] & 1<=r_0_3]]] | ~ [E [true U E [true U [[p_0_0<=r_0_4 | p_0_0<=p_0_4] | E [p_1_3<=r_1_3 U r_1_4<=r_1_4]]]]]]

abstracting: (r_1_4<=r_1_4)
states: 112
abstracting: (p_1_3<=r_1_3)
states: 72
abstracting: (p_0_0<=p_0_4)
states: 72
abstracting: (p_0_0<=r_0_4)
states: 84
abstracting: (1<=r_0_3)
states: 48
abstracting: (p_0_4<=1)
states: 112

EG iterations: 0
...............
EG iterations: 15
abstracting: (r_0_1<=1)
states: 112
abstracting: (r_1_3<=1)
states: 112
abstracting: (p_0_0<=r_0_4)
states: 84
.-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [E [AF [[~ [EG [1<=p_1_3]] | ~ [EX [r_1_0<=0]]]] U ~ [p_1_3<=0]] U [p_0_2<=r_1_0 | [[r_0_4<=1 | AG [[[p_0_1<=r_1_3 & 1<=p_0_2] | EX [p_0_3<=1]]]] & [EF [[[p_0_4<=p_1_4 & 1<=r_0_0] & 1<=p_1_2]] & E [1<=p_0_3 U ~ [[p_0_3<=1 & p_1_3<=1]]]]]]]
normalized: [~ [EG [~ [[[[E [true U [[p_0_4<=p_1_4 & 1<=r_0_0] & 1<=p_1_2]] & E [1<=p_0_3 U ~ [[p_0_3<=1 & p_1_3<=1]]]] & [~ [E [true U ~ [[EX [p_0_3<=1] | [p_0_1<=r_1_3 & 1<=p_0_2]]]]] | r_0_4<=1]] | p_0_2<=r_1_0]]]] & ~ [E [~ [[[[E [true U [[p_0_4<=p_1_4 & 1<=r_0_0] & 1<=p_1_2]] & E [1<=p_0_3 U ~ [[p_0_3<=1 & p_1_3<=1]]]] & [~ [E [true U ~ [[EX [p_0_3<=1] | [p_0_1<=r_1_3 & 1<=p_0_2]]]]] | r_0_4<=1]] | p_0_2<=r_1_0]] U [~ [[[[E [true U [[p_0_4<=p_1_4 & 1<=r_0_0] & 1<=p_1_2]] & E [1<=p_0_3 U ~ [[p_0_3<=1 & p_1_3<=1]]]] & [~ [E [true U ~ [[EX [p_0_3<=1] | [p_0_1<=r_1_3 & 1<=p_0_2]]]]] | r_0_4<=1]] | p_0_2<=r_1_0]] & ~ [E [~ [EG [~ [[~ [EX [r_1_0<=0]] | ~ [EG [1<=p_1_3]]]]]] U ~ [p_1_3<=0]]]]]]]

abstracting: (p_1_3<=0)
states: 72
abstracting: (1<=p_1_3)
states: 40
...
EG iterations: 3
abstracting: (r_1_0<=0)
states: 16
.........
EG iterations: 8
abstracting: (p_0_2<=r_1_0)
states: 112
abstracting: (r_0_4<=1)
states: 112
abstracting: (1<=p_0_2)
states: 32
abstracting: (p_0_1<=r_1_3)
states: 100
abstracting: (p_0_3<=1)
states: 112
.abstracting: (p_1_3<=1)
states: 112
abstracting: (p_0_3<=1)
states: 112
abstracting: (1<=p_0_3)
states: 24
abstracting: (1<=p_1_2)
states: 32
abstracting: (1<=r_0_0)
states: 48
abstracting: (p_0_4<=p_1_4)
states: 96
abstracting: (p_0_2<=r_1_0)
states: 112
abstracting: (r_0_4<=1)
states: 112
abstracting: (1<=p_0_2)
states: 32
abstracting: (p_0_1<=r_1_3)
states: 100
abstracting: (p_0_3<=1)
states: 112
.abstracting: (p_1_3<=1)
states: 112
abstracting: (p_0_3<=1)
states: 112
abstracting: (1<=p_0_3)
states: 24
abstracting: (1<=p_1_2)
states: 32
abstracting: (1<=r_0_0)
states: 48
abstracting: (p_0_4<=p_1_4)
states: 96
abstracting: (p_0_2<=r_1_0)
states: 112
abstracting: (r_0_4<=1)
states: 112
abstracting: (1<=p_0_2)
states: 32
abstracting: (p_0_1<=r_1_3)
states: 100
abstracting: (p_0_3<=1)
states: 112
.abstracting: (p_1_3<=1)
states: 112
abstracting: (p_0_3<=1)
states: 112
abstracting: (1<=p_0_3)
states: 24
abstracting: (1<=p_1_2)
states: 32
abstracting: (1<=r_0_0)
states: 48
abstracting: (p_0_4<=p_1_4)
states: 96
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [[EX [p_1_0<=r_1_4] & EG [[~ [r_1_3<=p_1_4] & [[[AG [1<=r_1_3] | AX [r_1_0<=1]] & ~ [1<=p_1_4]] | [E [r_1_0<=r_0_2 U p_1_4<=p_0_3] & ~ [r_0_0<=r_1_1]]]]]] | AX [EX [[E [EG [r_0_0<=r_0_0] U [p_0_0<=0 | 1<=p_0_4]] & r_0_1<=1]]]]
normalized: [~ [EX [~ [EX [[E [EG [r_0_0<=r_0_0] U [p_0_0<=0 | 1<=p_0_4]] & r_0_1<=1]]]]] | [EG [[[[~ [r_0_0<=r_1_1] & E [r_1_0<=r_0_2 U p_1_4<=p_0_3]] | [~ [1<=p_1_4] & [~ [EX [~ [r_1_0<=1]]] | ~ [E [true U ~ [1<=r_1_3]]]]]] & ~ [r_1_3<=p_1_4]]] & EX [p_1_0<=r_1_4]]]

abstracting: (p_1_0<=r_1_4)
states: 104
.abstracting: (r_1_3<=p_1_4)
states: 68
abstracting: (1<=r_1_3)
states: 72
abstracting: (r_1_0<=1)
states: 112
.abstracting: (1<=p_1_4)
states: 48
abstracting: (p_1_4<=p_0_3)
states: 72
abstracting: (r_1_0<=r_0_2)
states: 56
abstracting: (r_0_0<=r_1_1)
states: 104
....
EG iterations: 4
abstracting: (r_0_1<=1)
states: 112
abstracting: (1<=p_0_4)
states: 16
abstracting: (p_0_0<=0)
states: 64
abstracting: (r_0_0<=r_0_0)
states: 112

EG iterations: 0
..-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[E [[[1<=p_1_0 & [[r_0_1<=1 & 1<=p_1_0] & ~ [r_1_3<=1]]] & A [p_0_1<=1 U EG [p_0_0<=r_1_3]]] U [[[AX [p_1_2<=p_0_4] & [r_0_1<=0 | 1<=p_0_3]] | AX [1<=r_1_1]] & r_1_1<=p_1_1]] & EG [[~ [[A [r_1_3<=0 U 1<=p_1_1] | 1<=p_1_1]] & AX [[p_0_4<=p_0_2 | 1<=r_1_0]]]]]]
normalized: EG [[EG [[~ [EX [~ [[p_0_4<=p_0_2 | 1<=r_1_0]]]] & ~ [[[~ [EG [~ [1<=p_1_1]]] & ~ [E [~ [1<=p_1_1] U [~ [r_1_3<=0] & ~ [1<=p_1_1]]]]] | 1<=p_1_1]]]] & E [[[~ [EG [~ [EG [p_0_0<=r_1_3]]]] & ~ [E [~ [EG [p_0_0<=r_1_3]] U [~ [p_0_1<=1] & ~ [EG [p_0_0<=r_1_3]]]]]] & [[~ [r_1_3<=1] & [r_0_1<=1 & 1<=p_1_0]] & 1<=p_1_0]] U [[~ [EX [~ [1<=r_1_1]]] | [[r_0_1<=0 | 1<=p_0_3] & ~ [EX [~ [p_1_2<=p_0_4]]]]] & r_1_1<=p_1_1]]]]

abstracting: (r_1_1<=p_1_1)
states: 24
abstracting: (p_1_2<=p_0_4)
states: 80
.abstracting: (1<=p_0_3)
states: 24
abstracting: (r_0_1<=0)
states: 64
abstracting: (1<=r_1_1)
states: 88
.abstracting: (1<=p_1_0)
states: 16
abstracting: (1<=p_1_0)
states: 16
abstracting: (r_0_1<=1)
states: 112
abstracting: (r_1_3<=1)
states: 112
abstracting: (p_0_0<=r_1_3)
states: 96
......
EG iterations: 6
abstracting: (p_0_1<=1)
states: 112
abstracting: (p_0_0<=r_1_3)
states: 96
......
EG iterations: 6
abstracting: (p_0_0<=r_1_3)
states: 96
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p_1_1)
states: 24
abstracting: (1<=p_1_1)
states: 24
abstracting: (r_1_3<=0)
states: 40
abstracting: (1<=p_1_1)
states: 24
abstracting: (1<=p_1_1)
states: 24
.
EG iterations: 1
abstracting: (1<=r_1_0)
states: 96
abstracting: (p_0_4<=p_0_2)
states: 104
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 11854 (1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6512 21047 27559
used/not used/entry size/cache size: 29091 67079773 16 1024MB
basic ops cache: hits/miss/sum: 4363 12816 17179
used/not used/entry size/cache size: 25963 16751253 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: 329 566 895
used/not used/entry size/cache size: 566 8388042 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 67097065
1 11744
2 55
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.662sec


BK_STOP 1678942312309

--------------------
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:129 (10), effective:30 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:47 (3), effective:12 (1)

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

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

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

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

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

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

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

iterations count:29 (2), effective:7 (0)

iterations count:56 (4), effective:16 (1)

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

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

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

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

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

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

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

iterations count:23 (1), effective:5 (0)

iterations count:83 (6), effective:26 (2)

iterations count:54 (4), effective:15 (1)

iterations count:83 (6), effective:26 (2)

iterations count:54 (4), effective:15 (1)

iterations count:83 (6), effective:26 (2)

iterations count:54 (4), effective:15 (1)

iterations count:23 (1), effective:5 (0)

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

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

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

iterations count:16 (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="ResAllocation-PT-R005C002"
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 ResAllocation-PT-R005C002, 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 r321-tall-167889192600729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R005C002.tgz
mv ResAllocation-PT-R005C002 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 ;