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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:29 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 9.1K Feb 25 15:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 15:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:29 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 9.5K 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-R002C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R002C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940299593

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-R002C002
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_R002C002
(NrP: 8 NrTr: 6 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.885sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 22 (2.2e+01) #states 8



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

checking: EG [r_0_0<=1]
normalized: EG [r_0_0<=1]

abstracting: (r_0_0<=1)
states: 8

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: ~ [EG [EG [~ [AG [EF [r_1_0<=1]]]]]]
normalized: ~ [EG [EG [E [true U ~ [E [true U r_1_0<=1]]]]]]

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

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

MC time: 0m 0.000sec

checking: AG [EX [~ [AX [p_1_1<=1]]]]
normalized: ~ [E [true U ~ [EX [EX [~ [p_1_1<=1]]]]]]

abstracting: (p_1_1<=1)
states: 8
..-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [EG [[~ [EX [p_1_1<=1]] | EG [AG [r_1_1<=0]]]]]]
normalized: ~ [E [true U EG [[EG [~ [E [true U ~ [r_1_1<=0]]]] | ~ [EX [p_1_1<=1]]]]]]

abstracting: (p_1_1<=1)
states: 8
.abstracting: (r_1_1<=0)
states: 3
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [[EF [r_1_1<=1] & EX [AF [p_0_0<=0]]]]
normalized: ~ [EG [~ [[EX [~ [EG [~ [p_0_0<=0]]]] & E [true U r_1_1<=1]]]]]

abstracting: (r_1_1<=1)
states: 8
abstracting: (p_0_0<=0)
states: 5
.
EG iterations: 1
...
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (1<=r_1_0)
states: 6
abstracting: (p_1_0<=1)
states: 8
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [EF [r_1_0<=1] & EG [~ [1<=r_1_0]]]
normalized: [EG [~ [1<=r_1_0]] & E [true U r_1_0<=1]]

abstracting: (r_1_0<=1)
states: 8
abstracting: (1<=r_1_0)
states: 6
...
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EX [r_0_0<=p_1_0]
normalized: EX [r_0_0<=p_1_0]

abstracting: (r_0_0<=p_1_0)
states: 5
.-> the formula is TRUE

FORMULA ResAllocation-PT-R002C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AX [[EF [AX [[1<=r_1_0 & r_0_1<=0]]] & 1<=r_0_1]]]
normalized: EX [~ [[E [true U ~ [EX [~ [[1<=r_1_0 & r_0_1<=0]]]]] & 1<=r_0_1]]]

abstracting: (1<=r_0_1)
states: 3
abstracting: (r_0_1<=0)
states: 5
abstracting: (1<=r_1_0)
states: 6
..-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [[[EF [r_0_1<=r_0_0] | ~ [EF [p_0_0<=1]]] & ~ [r_1_1<=0]]]
normalized: ~ [EX [~ [[~ [r_1_1<=0] & [~ [E [true U p_0_0<=1]] | E [true U r_0_1<=r_0_0]]]]]]

abstracting: (r_0_1<=r_0_0)
states: 6
abstracting: (p_0_0<=1)
states: 8
abstracting: (r_1_1<=0)
states: 3
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [EX [A [E [1<=p_1_1 U AG [r_0_1<=r_0_0]] U AF [~ [A [r_0_0<=1 U p_0_0<=p_0_1]]]]]]
normalized: ~ [EX [[~ [EG [EG [[~ [EG [~ [p_0_0<=p_0_1]]] & ~ [E [~ [p_0_0<=p_0_1] U [~ [r_0_0<=1] & ~ [p_0_0<=p_0_1]]]]]]]] & ~ [E [EG [[~ [EG [~ [p_0_0<=p_0_1]]] & ~ [E [~ [p_0_0<=p_0_1] U [~ [r_0_0<=1] & ~ [p_0_0<=p_0_1]]]]]] U [EG [[~ [EG [~ [p_0_0<=p_0_1]]] & ~ [E [~ [p_0_0<=p_0_1] U [~ [r_0_0<=1] & ~ [p_0_0<=p_0_1]]]]]] & ~ [E [1<=p_1_1 U ~ [E [true U ~ [r_0_1<=r_0_0]]]]]]]]]]]

abstracting: (r_0_1<=r_0_0)
states: 6
abstracting: (1<=p_1_1)
states: 3
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (r_0_0<=1)
states: 8
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (p_0_0<=p_0_1)
states: 6
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (r_0_0<=1)
states: 8
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (p_0_0<=p_0_1)
states: 6
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (r_0_0<=1)
states: 8
abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (p_0_0<=p_0_1)
states: 6
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [A [[~ [[AX [1<=p_1_1] | [EX [p_0_0<=p_0_1] | ~ [r_1_1<=0]]]] & EF [[~ [r_1_1<=0] & AX [1<=r_0_0]]]] U AX [1<=p_1_0]]]
normalized: ~ [EG [~ [[~ [EG [EX [~ [1<=p_1_0]]]] & ~ [E [EX [~ [1<=p_1_0]] U [~ [[E [true U [~ [EX [~ [1<=r_0_0]]] & ~ [r_1_1<=0]]] & ~ [[[~ [r_1_1<=0] | EX [p_0_0<=p_0_1]] | ~ [EX [~ [1<=p_1_1]]]]]]] & EX [~ [1<=p_1_0]]]]]]]]]

abstracting: (1<=p_1_0)
states: 2
.abstracting: (1<=p_1_1)
states: 3
.abstracting: (p_0_0<=p_0_1)
states: 6
.abstracting: (r_1_1<=0)
states: 3
abstracting: (r_1_1<=0)
states: 3
abstracting: (1<=r_0_0)
states: 3
.abstracting: (1<=p_1_0)
states: 2
.abstracting: (1<=p_1_0)
states: 2
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [~ [EF [EF [1<=p_1_0]]]] & EX [[E [~ [p_0_1<=1] U ~ [AG [r_0_0<=r_0_1]]] & [[AF [~ [r_1_0<=1]] | [EF [r_0_0<=p_0_0] & EG [r_1_1<=1]]] & ~ [EF [~ [p_0_1<=1]]]]]]]
normalized: [EG [~ [E [true U E [true U 1<=p_1_0]]]] & EX [[E [~ [p_0_1<=1] U E [true U ~ [r_0_0<=r_0_1]]] & [[[E [true U r_0_0<=p_0_0] & EG [r_1_1<=1]] | ~ [EG [r_1_0<=1]]] & ~ [E [true U ~ [p_0_1<=1]]]]]]]

abstracting: (p_0_1<=1)
states: 8
abstracting: (r_1_0<=1)
states: 8

EG iterations: 0
abstracting: (r_1_1<=1)
states: 8

EG iterations: 0
abstracting: (r_0_0<=p_0_0)
states: 5
abstracting: (r_0_0<=r_0_1)
states: 6
abstracting: (p_0_1<=1)
states: 8
.abstracting: (1<=p_1_0)
states: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[~ [[p_1_0<=p_0_0 & [[A [1<=p_1_1 U p_1_1<=r_0_0] & EF [p_0_0<=1]] | [AX [p_1_0<=r_1_0] & A [p_1_0<=r_1_0 U 1<=r_0_1]]]]] | AF [~ [EX [p_1_1<=0]]]]]
normalized: ~ [EG [~ [[~ [EG [EX [p_1_1<=0]]] | ~ [[[[[~ [EG [~ [p_1_1<=r_0_0]]] & ~ [E [~ [p_1_1<=r_0_0] U [~ [1<=p_1_1] & ~ [p_1_1<=r_0_0]]]]] & E [true U p_0_0<=1]] | [[~ [EG [~ [1<=r_0_1]]] & ~ [E [~ [1<=r_0_1] U [~ [p_1_0<=r_1_0] & ~ [1<=r_0_1]]]]] & ~ [EX [~ [p_1_0<=r_1_0]]]]] & p_1_0<=p_0_0]]]]]]

abstracting: (p_1_0<=p_0_0)
states: 6
abstracting: (p_1_0<=r_1_0)
states: 6
.abstracting: (1<=r_0_1)
states: 3
abstracting: (p_1_0<=r_1_0)
states: 6
abstracting: (1<=r_0_1)
states: 3
abstracting: (1<=r_0_1)
states: 3
...
EG iterations: 3
abstracting: (p_0_0<=1)
states: 8
abstracting: (p_1_1<=r_0_0)
states: 6
abstracting: (1<=p_1_1)
states: 3
abstracting: (p_1_1<=r_0_0)
states: 6
abstracting: (p_1_1<=r_0_0)
states: 6
..
EG iterations: 2
abstracting: (p_1_1<=0)
states: 5
..
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [[[A [[~ [EX [1<=p_1_1]] & EF [r_1_1<=0]] U ~ [p_0_0<=p_0_1]] & AX [EG [AF [p_0_1<=r_1_1]]]] & ~ [EG [r_0_0<=p_0_1]]] | EG [[EX [r_0_0<=1] & E [E [~ [1<=p_1_1] U [r_0_0<=p_1_1 | 1<=p_0_0]] U [EG [1<=p_0_1] | ~ [p_1_1<=1]]]]]]
normalized: [[[[~ [EG [p_0_0<=p_0_1]] & ~ [E [p_0_0<=p_0_1 U [~ [[~ [EX [1<=p_1_1]] & E [true U r_1_1<=0]]] & p_0_0<=p_0_1]]]] & ~ [EX [~ [EG [~ [EG [~ [p_0_1<=r_1_1]]]]]]]] & ~ [EG [r_0_0<=p_0_1]]] | EG [[E [E [~ [1<=p_1_1] U [r_0_0<=p_1_1 | 1<=p_0_0]] U [~ [p_1_1<=1] | EG [1<=p_0_1]]] & EX [r_0_0<=1]]]]

abstracting: (r_0_0<=1)
states: 8
.abstracting: (1<=p_0_1)
states: 2
...
EG iterations: 3
abstracting: (p_1_1<=1)
states: 8
abstracting: (1<=p_0_0)
states: 3
abstracting: (r_0_0<=p_1_1)
states: 6
abstracting: (1<=p_1_1)
states: 3
.
EG iterations: 1
abstracting: (r_0_0<=p_0_1)
states: 6
...
EG iterations: 3
abstracting: (p_0_1<=r_1_1)
states: 8
.
EG iterations: 1

EG iterations: 0
.abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (r_1_1<=0)
states: 3
abstracting: (1<=p_1_1)
states: 3
.abstracting: (p_0_0<=p_0_1)
states: 6
abstracting: (p_0_0<=p_0_1)
states: 6
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AF [[[~ [[AF [EF [1<=r_0_0]] | ~ [[AG [r_1_1<=p_1_0] & ~ [1<=p_1_0]]]]] | [p_0_0<=1 | AX [r_0_1<=r_1_0]]] & [E [[[~ [p_1_1<=0] & [p_1_1<=p_0_1 | r_1_0<=p_0_0]] | [A [1<=r_0_0 U 1<=r_0_0] | [r_1_1<=r_0_0 | 1<=r_1_1]]] U ~ [[[p_0_1<=0 & 1<=p_1_0] | [p_1_1<=1 & p_1_1<=1]]]] & ~ [A [AG [1<=r_1_0] U E [r_1_0<=r_0_1 U p_0_1<=p_0_0]]]]]]
normalized: ~ [EG [~ [[[~ [[~ [[~ [1<=p_1_0] & ~ [E [true U ~ [r_1_1<=p_1_0]]]]] | ~ [EG [~ [E [true U 1<=r_0_0]]]]]] | [~ [EX [~ [r_0_1<=r_1_0]]] | p_0_0<=1]] & [E [[[[p_1_1<=p_0_1 | r_1_0<=p_0_0] & ~ [p_1_1<=0]] | [[r_1_1<=r_0_0 | 1<=r_1_1] | [~ [EG [~ [1<=r_0_0]]] & ~ [E [~ [1<=r_0_0] U [~ [1<=r_0_0] & ~ [1<=r_0_0]]]]]]] U ~ [[[p_1_1<=1 & p_1_1<=1] | [p_0_1<=0 & 1<=p_1_0]]]] & ~ [[~ [EG [~ [E [r_1_0<=r_0_1 U p_0_1<=p_0_0]]]] & ~ [E [~ [E [r_1_0<=r_0_1 U p_0_1<=p_0_0]] U [E [true U ~ [1<=r_1_0]] & ~ [E [r_1_0<=r_0_1 U p_0_1<=p_0_0]]]]]]]]]]]]

abstracting: (p_0_1<=p_0_0)
states: 7
abstracting: (r_1_0<=r_0_1)
states: 4
abstracting: (1<=r_1_0)
states: 6
abstracting: (p_0_1<=p_0_0)
states: 7
abstracting: (r_1_0<=r_0_1)
states: 4
abstracting: (p_0_1<=p_0_0)
states: 7
abstracting: (r_1_0<=r_0_1)
states: 4
..
EG iterations: 2
abstracting: (1<=p_1_0)
states: 2
abstracting: (p_0_1<=0)
states: 6
abstracting: (p_1_1<=1)
states: 8
abstracting: (p_1_1<=1)
states: 8
abstracting: (1<=r_0_0)
states: 3
abstracting: (1<=r_0_0)
states: 3
abstracting: (1<=r_0_0)
states: 3
abstracting: (1<=r_0_0)
states: 3
...
EG iterations: 3
abstracting: (1<=r_1_1)
states: 5
abstracting: (r_1_1<=r_0_0)
states: 5
abstracting: (p_1_1<=0)
states: 5
abstracting: (r_1_0<=p_0_0)
states: 5
abstracting: (p_1_1<=p_0_1)
states: 5
abstracting: (p_0_0<=1)
states: 8
abstracting: (r_0_1<=r_1_0)
states: 7
.abstracting: (1<=r_0_0)
states: 3
.
EG iterations: 1
abstracting: (r_1_1<=p_1_0)
states: 4
abstracting: (1<=p_1_0)
states: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

totally nodes used: 362 (3.6e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 836 1209 2045
used/not used/entry size/cache size: 1494 67107370 16 1024MB
basic ops cache: hits/miss/sum: 698 1019 1717
used/not used/entry size/cache size: 1684 16775532 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: 134 103 237
used/not used/entry size/cache size: 103 8388505 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 67108511
1 344
2 9
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.593sec


BK_STOP 1678940304235

--------------------
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:25 (4), effective:6 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:13 (2), effective:2 (0)

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

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

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

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

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

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

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

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

iterations count:19 (3), 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="ResAllocation-PT-R002C002"
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-R002C002, 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-167889192500657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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