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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 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 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 21K 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-R003C003-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940535596

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-R003C003
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_R003C003
(NrP: 18 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 2.852sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 62 (6.2e+01) #states 92



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

checking: EG [A [EF [EG [1<=p_1_0]] U r_2_1<=p_2_2]]
normalized: EG [[~ [EG [~ [r_2_1<=p_2_2]]] & ~ [E [~ [r_2_1<=p_2_2] U [~ [r_2_1<=p_2_2] & ~ [E [true U EG [1<=p_1_0]]]]]]]]

abstracting: (1<=p_1_0)
states: 4
.....
EG iterations: 5
abstracting: (r_2_1<=p_2_2)
states: 56
abstracting: (r_2_1<=p_2_2)
states: 56
abstracting: (r_2_1<=p_2_2)
states: 56
....
EG iterations: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [AF [~ [A [[p_0_1<=1 & p_0_2<=p_2_0] U r_2_2<=0]]]]
normalized: E [true U ~ [EG [[~ [EG [~ [r_2_2<=0]]] & ~ [E [~ [r_2_2<=0] U [~ [r_2_2<=0] & ~ [[p_0_1<=1 & p_0_2<=p_2_0]]]]]]]]]

abstracting: (p_0_2<=p_2_0)
states: 76
abstracting: (p_0_1<=1)
states: 92
abstracting: (r_2_2<=0)
states: 32
abstracting: (r_2_2<=0)
states: 32
abstracting: (r_2_2<=0)
states: 32
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: E [AX [~ [r_0_0<=r_1_2]] U r_0_1<=p_0_1]
normalized: E [~ [EX [r_0_0<=r_1_2]] U r_0_1<=p_0_1]

abstracting: (r_0_1<=p_0_1)
states: 50
abstracting: (r_0_0<=r_1_2)
states: 66
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EX [EF [EG [~ [[[p_0_0<=0 | r_0_0<=r_0_2] | [p_0_0<=0 & p_2_1<=0]]]]]]
normalized: EX [E [true U EG [~ [[[p_0_0<=0 & p_2_1<=0] | [p_0_0<=0 | r_0_0<=r_0_2]]]]]]

abstracting: (r_0_0<=r_0_2)
states: 66
abstracting: (p_0_0<=0)
states: 48
abstracting: (p_2_1<=0)
states: 52
abstracting: (p_0_0<=0)
states: 48
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [AF [1<=r_2_1] | AF [[E [AF [AG [r_2_2<=r_1_1]] U ~ [[~ [1<=p_1_1] | AG [r_0_1<=p_2_0]]]] | AF [r_2_1<=1]]]]
normalized: [~ [EG [~ [[E [~ [EG [E [true U ~ [r_2_2<=r_1_1]]]] U ~ [[~ [E [true U ~ [r_0_1<=p_2_0]]] | ~ [1<=p_1_1]]]] | ~ [EG [~ [r_2_1<=1]]]]]]] | ~ [EG [~ [1<=r_2_1]]]]

abstracting: (1<=r_2_1)
states: 52
.
EG iterations: 1
abstracting: (r_2_1<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p_1_1)
states: 10
abstracting: (r_0_1<=p_2_0)
states: 70
abstracting: (r_2_2<=r_1_1)
states: 58

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

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

MC time: 0m 0.001sec

checking: A [E [EF [~ [r_1_1<=0]] U ~ [[[[p_0_1<=1 & r_1_2<=p_2_1] & r_0_0<=1] & ~ [AG [r_1_1<=1]]]]] U p_1_1<=0]
normalized: [~ [EG [~ [p_1_1<=0]]] & ~ [E [~ [p_1_1<=0] U [~ [E [E [true U ~ [r_1_1<=0]] U ~ [[E [true U ~ [r_1_1<=1]] & [[p_0_1<=1 & r_1_2<=p_2_1] & r_0_0<=1]]]]] & ~ [p_1_1<=0]]]]]

abstracting: (p_1_1<=0)
states: 82
abstracting: (r_0_0<=1)
states: 92
abstracting: (r_1_2<=p_2_1)
states: 70
abstracting: (p_0_1<=1)
states: 92
abstracting: (r_1_1<=1)
states: 92
abstracting: (r_1_1<=0)
states: 50
abstracting: (p_1_1<=0)
states: 82
abstracting: (p_1_1<=0)
states: 82
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [[EF [EX [r_0_0<=0]] & E [p_2_2<=0 U ~ [p_1_2<=r_1_2]]] & AX [A [p_1_0<=p_0_0 U AG [~ [[r_1_2<=1 | r_1_2<=r_2_2]]]]]]
normalized: [[E [true U EX [r_0_0<=0]] & E [p_2_2<=0 U ~ [p_1_2<=r_1_2]]] & ~ [EX [~ [[~ [EG [E [true U [r_1_2<=1 | r_1_2<=r_2_2]]]] & ~ [E [E [true U [r_1_2<=1 | r_1_2<=r_2_2]] U [~ [p_1_0<=p_0_0] & E [true U [r_1_2<=1 | r_1_2<=r_2_2]]]]]]]]]]

abstracting: (r_1_2<=r_2_2)
states: 92
abstracting: (r_1_2<=1)
states: 92
abstracting: (p_1_0<=p_0_0)
states: 88
abstracting: (r_1_2<=r_2_2)
states: 92
abstracting: (r_1_2<=1)
states: 92
abstracting: (r_1_2<=r_2_2)
states: 92
abstracting: (r_1_2<=1)
states: 92

EG iterations: 0
.abstracting: (p_1_2<=r_1_2)
states: 70
abstracting: (p_2_2<=0)
states: 60
abstracting: (r_0_0<=0)
states: 48
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [~ [[AF [A [[p_0_0<=r_0_1 | 1<=r_0_1] U ~ [p_1_0<=p_0_0]]] | E [EF [[p_1_2<=r_0_0 & 1<=r_2_0]] U AF [~ [r_1_1<=1]]]]]]
normalized: EG [~ [[~ [EG [~ [[~ [EG [p_1_0<=p_0_0]] & ~ [E [p_1_0<=p_0_0 U [~ [[p_0_0<=r_0_1 | 1<=r_0_1]] & p_1_0<=p_0_0]]]]]]] | E [E [true U [p_1_2<=r_0_0 & 1<=r_2_0]] U ~ [EG [r_1_1<=1]]]]]]

abstracting: (r_1_1<=1)
states: 92

EG iterations: 0
abstracting: (1<=r_2_0)
states: 48
abstracting: (p_1_2<=r_0_0)
states: 80
abstracting: (p_1_0<=p_0_0)
states: 88
abstracting: (1<=r_0_1)
states: 42
abstracting: (p_0_0<=r_0_1)
states: 68
abstracting: (p_1_0<=p_0_0)
states: 88
abstracting: (p_1_0<=p_0_0)
states: 88
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p_0_0<=p_1_1 | [~ [E [AG [p_2_1<=0] U 1<=r_2_0]] & [EF [1<=r_0_2] & [~ [AG [p_2_1<=r_1_0]] | [~ [1<=r_1_0] | AF [r_1_2<=0]]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [~ [E [true U ~ [p_2_1<=0]]] U 1<=r_2_0]] & [[[~ [EG [~ [r_1_2<=0]]] | ~ [1<=r_1_0]] | E [true U ~ [p_2_1<=r_1_0]]] & E [true U 1<=r_0_2]]] | p_0_0<=p_1_1]]]]

abstracting: (p_0_0<=p_1_1)
states: 52
abstracting: (1<=r_0_2)
states: 38
abstracting: (p_2_1<=r_1_0)
states: 72
abstracting: (1<=r_1_0)
states: 44
abstracting: (r_1_2<=0)
states: 54
...
EG iterations: 3
abstracting: (1<=r_2_0)
states: 48
abstracting: (p_2_1<=0)
states: 52
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[EX [1<=r_1_0] | ~ [EF [[1<=p_2_2 & [AG [p_2_2<=p_1_2] & AF [r_1_1<=p_0_0]]]]]] U EG [EX [~ [[EX [p_2_2<=1] | [p_2_1<=0 | p_2_0<=r_1_2]]]]]]
normalized: E [[~ [E [true U [[~ [E [true U ~ [p_2_2<=p_1_2]]] & ~ [EG [~ [r_1_1<=p_0_0]]]] & 1<=p_2_2]]] | EX [1<=r_1_0]] U EG [EX [~ [[[p_2_1<=0 | p_2_0<=r_1_2] | EX [p_2_2<=1]]]]]]

abstracting: (p_2_2<=1)
states: 92
.abstracting: (p_2_0<=r_1_2)
states: 66
abstracting: (p_2_1<=0)
states: 52
...
EG iterations: 2
abstracting: (1<=r_1_0)
states: 44
.abstracting: (1<=p_2_2)
states: 32
abstracting: (r_1_1<=p_0_0)
states: 70
........
EG iterations: 8
abstracting: (p_2_2<=p_1_2)
states: 60
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [~ [[[[[EX [r_2_1<=r_2_0] | 1<=r_0_0] & EX [E [r_0_1<=1 U r_0_1<=1]]] | [AF [[p_1_2<=1 & 1<=p_0_1]] | [[EX [r_0_0<=0] & r_0_2<=1] & ~ [r_2_1<=0]]]] | EF [EF [~ [r_1_1<=0]]]]]]
normalized: EX [~ [[[[~ [EG [~ [[p_1_2<=1 & 1<=p_0_1]]]] | [~ [r_2_1<=0] & [EX [r_0_0<=0] & r_0_2<=1]]] | [EX [E [r_0_1<=1 U r_0_1<=1]] & [EX [r_2_1<=r_2_0] | 1<=r_0_0]]] | E [true U E [true U ~ [r_1_1<=0]]]]]]

abstracting: (r_1_1<=0)
states: 50
abstracting: (1<=r_0_0)
states: 44
abstracting: (r_2_1<=r_2_0)
states: 68
.abstracting: (r_0_1<=1)
states: 92
abstracting: (r_0_1<=1)
states: 92
.abstracting: (r_0_2<=1)
states: 92
abstracting: (r_0_0<=0)
states: 48
.abstracting: (r_2_1<=0)
states: 40
abstracting: (1<=p_0_1)
states: 40
abstracting: (p_1_2<=1)
states: 92
....
EG iterations: 4
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AG [A [[~ [[AX [1<=r_1_2] | A [1<=r_0_2 U r_1_1<=1]]] | EG [A [r_2_1<=0 U 1<=p_2_0]]] U [[AX [p_0_1<=0] & [~ [p_1_2<=0] | EF [1<=r_1_1]]] & [~ [A [p_0_1<=r_2_0 U 1<=r_2_0]] & ~ [EF [p_0_1<=1]]]]]]]
normalized: E [true U ~ [[~ [EG [~ [[[[E [true U 1<=r_1_1] | ~ [p_1_2<=0]] & ~ [EX [~ [p_0_1<=0]]]] & [~ [E [true U p_0_1<=1]] & ~ [[~ [EG [~ [1<=r_2_0]]] & ~ [E [~ [1<=r_2_0] U [~ [p_0_1<=r_2_0] & ~ [1<=r_2_0]]]]]]]]]]] & ~ [E [~ [[[[E [true U 1<=r_1_1] | ~ [p_1_2<=0]] & ~ [EX [~ [p_0_1<=0]]]] & [~ [E [true U p_0_1<=1]] & ~ [[~ [EG [~ [1<=r_2_0]]] & ~ [E [~ [1<=r_2_0] U [~ [p_0_1<=r_2_0] & ~ [1<=r_2_0]]]]]]]]] U [~ [[~ [[~ [EX [~ [1<=r_1_2]]] | [~ [EG [~ [r_1_1<=1]]] & ~ [E [~ [r_1_1<=1] U [~ [1<=r_0_2] & ~ [r_1_1<=1]]]]]]] | EG [[~ [EG [~ [1<=p_2_0]]] & ~ [E [~ [1<=p_2_0] U [~ [1<=p_2_0] & ~ [r_2_1<=0]]]]]]]] & ~ [[[[E [true U 1<=r_1_1] | ~ [p_1_2<=0]] & ~ [EX [~ [p_0_1<=0]]]] & [~ [E [true U p_0_1<=1]] & ~ [[~ [EG [~ [1<=r_2_0]]] & ~ [E [~ [1<=r_2_0] U [~ [p_0_1<=r_2_0] & ~ [1<=r_2_0]]]]]]]]]]]]]]]

abstracting: (1<=r_2_0)
states: 48
abstracting: (p_0_1<=r_2_0)
states: 72
abstracting: (1<=r_2_0)
states: 48
abstracting: (1<=r_2_0)
states: 48
...
EG iterations: 3
abstracting: (p_0_1<=1)
states: 92
abstracting: (p_0_1<=0)
states: 52
.abstracting: (p_1_2<=0)
states: 70
abstracting: (1<=r_1_1)
states: 42
abstracting: (r_2_1<=0)
states: 40
abstracting: (1<=p_2_0)
states: 44
abstracting: (1<=p_2_0)
states: 44
abstracting: (1<=p_2_0)
states: 44
.....
EG iterations: 5
.
EG iterations: 1
abstracting: (r_1_1<=1)
states: 92
abstracting: (1<=r_0_2)
states: 38
abstracting: (r_1_1<=1)
states: 92
abstracting: (r_1_1<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=r_1_2)
states: 38
.abstracting: (1<=r_2_0)
states: 48
abstracting: (p_0_1<=r_2_0)
states: 72
abstracting: (1<=r_2_0)
states: 48
abstracting: (1<=r_2_0)
states: 48
...
EG iterations: 3
abstracting: (p_0_1<=1)
states: 92
abstracting: (p_0_1<=0)
states: 52
.abstracting: (p_1_2<=0)
states: 70
abstracting: (1<=r_1_1)
states: 42
abstracting: (1<=r_2_0)
states: 48
abstracting: (p_0_1<=r_2_0)
states: 72
abstracting: (1<=r_2_0)
states: 48
abstracting: (1<=r_2_0)
states: 48
...
EG iterations: 3
abstracting: (p_0_1<=1)
states: 92
abstracting: (p_0_1<=0)
states: 52
.abstracting: (p_1_2<=0)
states: 70
abstracting: (1<=r_1_1)
states: 42

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: E [[A [[r_2_2<=1 | p_1_2<=0] U EG [[[r_0_2<=p_0_0 | r_0_1<=1] | [r_0_2<=p_2_2 | r_1_2<=r_0_0]]]] | p_1_0<=r_1_2] U EX [AF [EF [[p_0_1<=1 & r_2_2<=1]]]]]
normalized: E [[[~ [EG [~ [EG [[[r_0_2<=p_2_2 | r_1_2<=r_0_0] | [r_0_2<=p_0_0 | r_0_1<=1]]]]]] & ~ [E [~ [EG [[[r_0_2<=p_2_2 | r_1_2<=r_0_0] | [r_0_2<=p_0_0 | r_0_1<=1]]]] U [~ [[r_2_2<=1 | p_1_2<=0]] & ~ [EG [[[r_0_2<=p_2_2 | r_1_2<=r_0_0] | [r_0_2<=p_0_0 | r_0_1<=1]]]]]]]] | p_1_0<=r_1_2] U EX [~ [EG [~ [E [true U [p_0_1<=1 & r_2_2<=1]]]]]]]

abstracting: (r_2_2<=1)
states: 92
abstracting: (p_0_1<=1)
states: 92
.
EG iterations: 1
.abstracting: (p_1_0<=r_1_2)
states: 90
abstracting: (r_0_1<=1)
states: 92
abstracting: (r_0_2<=p_0_0)
states: 72
abstracting: (r_1_2<=r_0_0)
states: 72
abstracting: (r_0_2<=p_2_2)
states: 70

EG iterations: 0
abstracting: (p_1_2<=0)
states: 70
abstracting: (r_2_2<=1)
states: 92
abstracting: (r_0_1<=1)
states: 92
abstracting: (r_0_2<=p_0_0)
states: 72
abstracting: (r_1_2<=r_0_0)
states: 72
abstracting: (r_0_2<=p_2_2)
states: 70

EG iterations: 0
abstracting: (r_0_1<=1)
states: 92
abstracting: (r_0_2<=p_0_0)
states: 72
abstracting: (r_1_2<=r_0_0)
states: 72
abstracting: (r_0_2<=p_2_2)
states: 70

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

FORMULA ResAllocation-PT-R003C003-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [EF [[[[A [p_1_0<=r_1_2 U r_1_1<=p_2_1] | AX [r_0_0<=0]] | A [[r_2_2<=p_2_1 | 1<=r_0_0] U ~ [p_2_0<=r_1_0]]] | AF [A [r_1_1<=r_1_0 U 1<=p_0_2]]]] U r_1_0<=r_0_0]
normalized: E [E [true U [~ [EG [~ [[~ [EG [~ [1<=p_0_2]]] & ~ [E [~ [1<=p_0_2] U [~ [r_1_1<=r_1_0] & ~ [1<=p_0_2]]]]]]]] | [[~ [EG [p_2_0<=r_1_0]] & ~ [E [p_2_0<=r_1_0 U [~ [[r_2_2<=p_2_1 | 1<=r_0_0]] & p_2_0<=r_1_0]]]] | [~ [EX [~ [r_0_0<=0]]] | [~ [EG [~ [r_1_1<=p_2_1]]] & ~ [E [~ [r_1_1<=p_2_1] U [~ [p_1_0<=r_1_2] & ~ [r_1_1<=p_2_1]]]]]]]]] U r_1_0<=r_0_0]

abstracting: (r_1_0<=r_0_0)
states: 70
abstracting: (r_1_1<=p_2_1)
states: 50
abstracting: (p_1_0<=r_1_2)
states: 90
abstracting: (r_1_1<=p_2_1)
states: 50
abstracting: (r_1_1<=p_2_1)
states: 50
.......
EG iterations: 7
abstracting: (r_0_0<=0)
states: 48
.abstracting: (p_2_0<=r_1_0)
states: 48
abstracting: (1<=r_0_0)
states: 44
abstracting: (r_2_2<=p_2_1)
states: 56
abstracting: (p_2_0<=r_1_0)
states: 48
abstracting: (p_2_0<=r_1_0)
states: 48
.....
EG iterations: 5
abstracting: (1<=p_0_2)
states: 32
abstracting: (r_1_1<=r_1_0)
states: 70
abstracting: (1<=p_0_2)
states: 32
abstracting: (1<=p_0_2)
states: 32
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [[p_2_1<=0 | [E [EG [p_1_1<=r_2_2] U [A [1<=r_0_1 U r_0_2<=p_1_0] | [A [p_2_0<=r_1_2 U r_1_2<=0] | E [p_1_1<=1 U r_0_1<=0]]]] | [[1<=p_1_0 & p_0_0<=r_2_2] & EX [A [p_2_1<=r_2_0 U 1<=p_0_2]]]]]]
normalized: ~ [EX [~ [[[E [EG [p_1_1<=r_2_2] U [[~ [EG [~ [r_0_2<=p_1_0]]] & ~ [E [~ [r_0_2<=p_1_0] U [~ [1<=r_0_1] & ~ [r_0_2<=p_1_0]]]]] | [E [p_1_1<=1 U r_0_1<=0] | [~ [EG [~ [r_1_2<=0]]] & ~ [E [~ [r_1_2<=0] U [~ [p_2_0<=r_1_2] & ~ [r_1_2<=0]]]]]]]] | [EX [[~ [EG [~ [1<=p_0_2]]] & ~ [E [~ [1<=p_0_2] U [~ [p_2_1<=r_2_0] & ~ [1<=p_0_2]]]]]] & [1<=p_1_0 & p_0_0<=r_2_2]]] | p_2_1<=0]]]]

abstracting: (p_2_1<=0)
states: 52
abstracting: (p_0_0<=r_2_2)
states: 76
abstracting: (1<=p_1_0)
states: 4
abstracting: (1<=p_0_2)
states: 32
abstracting: (p_2_1<=r_2_0)
states: 72
abstracting: (1<=p_0_2)
states: 32
abstracting: (1<=p_0_2)
states: 32
.
EG iterations: 1
.abstracting: (r_1_2<=0)
states: 54
abstracting: (p_2_0<=r_1_2)
states: 66
abstracting: (r_1_2<=0)
states: 54
abstracting: (r_1_2<=0)
states: 54
...
EG iterations: 3
abstracting: (r_0_1<=0)
states: 50
abstracting: (p_1_1<=1)
states: 92
abstracting: (r_0_2<=p_1_0)
states: 56
abstracting: (1<=r_0_1)
states: 42
abstracting: (r_0_2<=p_1_0)
states: 56
abstracting: (r_0_2<=p_1_0)
states: 56
....
EG iterations: 4
abstracting: (p_1_1<=r_2_2)
states: 92

EG iterations: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[EG [[r_0_2<=p_0_0 & [[EX [p_0_1<=1] & AF [p_1_2<=r_2_0]] | [EX [1<=p_2_2] | AX [1<=r_2_1]]]]] & [AF [[[[r_1_2<=p_0_0 & 1<=r_2_0] & ~ [r_0_0<=r_1_1]] | EG [r_1_1<=1]]] & [[[r_0_1<=p_2_1 | EX [r_1_0<=r_1_1]] | 1<=p_1_1] & [~ [[p_0_0<=r_0_0 & ~ [p_2_1<=r_1_1]]] | ~ [[EX [1<=r_0_0] & ~ [p_0_0<=r_2_1]]]]]]]]
normalized: EX [[EG [[[[EX [p_0_1<=1] & ~ [EG [~ [p_1_2<=r_2_0]]]] | [~ [EX [~ [1<=r_2_1]]] | EX [1<=p_2_2]]] & r_0_2<=p_0_0]] & [[[~ [[~ [p_0_0<=r_2_1] & EX [1<=r_0_0]]] | ~ [[~ [p_2_1<=r_1_1] & p_0_0<=r_0_0]]] & [[EX [r_1_0<=r_1_1] | r_0_1<=p_2_1] | 1<=p_1_1]] & ~ [EG [~ [[EG [r_1_1<=1] | [~ [r_0_0<=r_1_1] & [r_1_2<=p_0_0 & 1<=r_2_0]]]]]]]]]

abstracting: (1<=r_2_0)
states: 48
abstracting: (r_1_2<=p_0_0)
states: 72
abstracting: (r_0_0<=r_1_1)
states: 68
abstracting: (r_1_1<=1)
states: 92

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p_1_1)
states: 10
abstracting: (r_0_1<=p_2_1)
states: 70
abstracting: (r_1_0<=r_1_1)
states: 68
.abstracting: (p_0_0<=r_0_0)
states: 48
abstracting: (p_2_1<=r_1_1)
states: 52
abstracting: (1<=r_0_0)
states: 44
.abstracting: (p_0_0<=r_2_1)
states: 72
abstracting: (r_0_2<=p_0_0)
states: 72
abstracting: (1<=p_2_2)
states: 32
.abstracting: (1<=r_2_1)
states: 52
.abstracting: (p_1_2<=r_2_0)
states: 82
.....
EG iterations: 5
abstracting: (p_0_1<=1)
states: 92
..
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.001sec

totally nodes used: 6400 (6.4e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5174 15675 20849
used/not used/entry size/cache size: 20469 67088395 16 1024MB
basic ops cache: hits/miss/sum: 3607 9367 12974
used/not used/entry size/cache size: 16920 16760296 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: 360 586 946
used/not used/entry size/cache size: 586 8388022 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 67102490
1 6348
2 26
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.586sec


BK_STOP 1678940540230

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


iterations count:89 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:62 (5), effective:10 (0)

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

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

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

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

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

iterations count:31 (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:65 (5), effective:15 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:52 (4), effective:10 (0)

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

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

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

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

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

iterations count:12 (1), effective:0 (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-R003C003"
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-R003C003, 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-167889192500673"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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