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.r481-tall-167912692400769.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 TwoPhaseLocking-PT-nC00004vD, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692400769
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 8.5K Feb 25 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00004vD-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868050623

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=TwoPhaseLocking-PT-nC00004vD
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: TwoPhaseLocking_PT_nC00004vD
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.844sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 54 (5.4e+01) #states 32



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

checking: ~ [EX [Clients<=4]]
normalized: ~ [EX [Clients<=4]]

abstracting: (Clients<=4)
states: 32
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [AG [~ [AF [EX [haveAandB<=Clients]]]]]
normalized: EX [~ [E [true U ~ [EG [~ [EX [haveAandB<=Clients]]]]]]]

abstracting: (haveAandB<=Clients)
states: 32
..
EG iterations: 1
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [EG [[[AF [AG [2<=haveB]] | haveA2andB<=2] & ~ [[~ [resA<=2] | [haveA2andB<=2 | 1<=haveA2andB]]]]]]
normalized: ~ [EG [[[~ [EG [E [true U ~ [2<=haveB]]]] | haveA2andB<=2] & ~ [[[haveA2andB<=2 | 1<=haveA2andB] | ~ [resA<=2]]]]]]

abstracting: (resA<=2)
states: 32
abstracting: (1<=haveA2andB)
states: 8
abstracting: (haveA2andB<=2)
states: 32
abstracting: (haveA2andB<=2)
states: 32
abstracting: (2<=haveB)
states: 5
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AF [[~ [[AF [4<=haveA2] | [haveAandB<=resA | haveA2andB<=resB]]] | ~ [EG [AF [1<=haveA2]]]]]]
normalized: ~ [EG [EG [~ [[~ [[~ [EG [~ [4<=haveA2]]] | [haveAandB<=resA | haveA2andB<=resB]]] | ~ [EG [~ [EG [~ [1<=haveA2]]]]]]]]]]

abstracting: (1<=haveA2)
states: 12
......
EG iterations: 6
..
EG iterations: 2
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (haveAandB<=resA)
states: 26
abstracting: (4<=haveA2)
states: 0

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

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[AF [EG [EG [haveA2andB<=1]]] & [~ [[~ [AG [1<=haveB]] | [EX [2<=haveB] & [~ [1<=haveA] | EG [resA<=2]]]]] | haveB<=resB]]]
normalized: ~ [EG [~ [[[~ [[E [true U ~ [1<=haveB]] | [[EG [resA<=2] | ~ [1<=haveA]] & EX [2<=haveB]]]] | haveB<=resB] & ~ [EG [~ [EG [EG [haveA2andB<=1]]]]]]]]]

abstracting: (haveA2andB<=1)
states: 31
.
EG iterations: 1
.
EG iterations: 1
..
EG iterations: 2
abstracting: (haveB<=resB)
states: 21
abstracting: (2<=haveB)
states: 5
.abstracting: (1<=haveA)
states: 13
abstracting: (resA<=2)
states: 32

EG iterations: 0
abstracting: (1<=haveB)
states: 17
......
EG iterations: 6
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [~ [[4<=resB & [AG [[EX [haveA2andB<=resA] | EX [Clients<=3]]] & ~ [haveA2<=3]]]] U ~ [AX [EG [A [haveA<=resA U 1<=haveA]]]]]
normalized: [~ [EG [~ [EX [~ [EG [[~ [EG [~ [1<=haveA]]] & ~ [E [~ [1<=haveA] U [~ [haveA<=resA] & ~ [1<=haveA]]]]]]]]]]] & ~ [E [~ [EX [~ [EG [[~ [EG [~ [1<=haveA]]] & ~ [E [~ [1<=haveA] U [~ [haveA<=resA] & ~ [1<=haveA]]]]]]]]] U [[[~ [haveA2<=3] & ~ [E [true U ~ [[EX [Clients<=3] | EX [haveA2andB<=resA]]]]]] & 4<=resB] & ~ [EX [~ [EG [[~ [EG [~ [1<=haveA]]] & ~ [E [~ [1<=haveA] U [~ [haveA<=resA] & ~ [1<=haveA]]]]]]]]]]]]]

abstracting: (1<=haveA)
states: 13
abstracting: (haveA<=resA)
states: 22
abstracting: (1<=haveA)
states: 13
abstracting: (1<=haveA)
states: 13
..........
EG iterations: 10

EG iterations: 0
.abstracting: (4<=resB)
states: 0
abstracting: (haveA2andB<=resA)
states: 26
.abstracting: (Clients<=3)
states: 31
.abstracting: (haveA2<=3)
states: 32
abstracting: (1<=haveA)
states: 13
abstracting: (haveA<=resA)
states: 22
abstracting: (1<=haveA)
states: 13
abstracting: (1<=haveA)
states: 13
..........
EG iterations: 10

EG iterations: 0
.abstracting: (1<=haveA)
states: 13
abstracting: (haveA<=resA)
states: 22
abstracting: (1<=haveA)
states: 13
abstracting: (1<=haveA)
states: 13
..........
EG iterations: 10

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

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [AF [~ [EG [~ [haveA2andB<=Clients]]]]] & E [~ [[EF [1<=haveA] & 4<=haveB]] U [~ [[[2<=haveB & EF [Clients<=1]] | ~ [3<=haveA]]] | resB<=haveA]]]
normalized: [EG [EG [~ [haveA2andB<=Clients]]] & E [~ [[E [true U 1<=haveA] & 4<=haveB]] U [~ [[~ [3<=haveA] | [E [true U Clients<=1] & 2<=haveB]]] | resB<=haveA]]]

abstracting: (resB<=haveA)
states: 20
abstracting: (2<=haveB)
states: 5
abstracting: (Clients<=1)
states: 11
abstracting: (3<=haveA)
states: 0
abstracting: (4<=haveB)
states: 0
abstracting: (1<=haveA)
states: 13
abstracting: (haveA2andB<=Clients)
states: 32
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [A [~ [EX [[[resA<=1 & 2<=resB] & [3<=haveA2andB | 2<=haveA]]]] U [EG [E [resA<=1 U resB<=1]] & [4<=Clients & [2<=Clients | haveB<=4]]]]]
normalized: E [true U [~ [EG [~ [[[[2<=Clients | haveB<=4] & 4<=Clients] & EG [E [resA<=1 U resB<=1]]]]]] & ~ [E [~ [[[[2<=Clients | haveB<=4] & 4<=Clients] & EG [E [resA<=1 U resB<=1]]]] U [EX [[[3<=haveA2andB | 2<=haveA] & [resA<=1 & 2<=resB]]] & ~ [[[[2<=Clients | haveB<=4] & 4<=Clients] & EG [E [resA<=1 U resB<=1]]]]]]]]]

abstracting: (resB<=1)
states: 26
abstracting: (resA<=1)
states: 29
.
EG iterations: 1
abstracting: (4<=Clients)
states: 1
abstracting: (haveB<=4)
states: 32
abstracting: (2<=Clients)
states: 21
abstracting: (2<=resB)
states: 6
abstracting: (resA<=1)
states: 29
abstracting: (2<=haveA)
states: 3
abstracting: (3<=haveA2andB)
states: 0
.abstracting: (resB<=1)
states: 26
abstracting: (resA<=1)
states: 29
.
EG iterations: 1
abstracting: (4<=Clients)
states: 1
abstracting: (haveB<=4)
states: 32
abstracting: (2<=Clients)
states: 21
abstracting: (resB<=1)
states: 26
abstracting: (resA<=1)
states: 29
.
EG iterations: 1
abstracting: (4<=Clients)
states: 1
abstracting: (haveB<=4)
states: 32
abstracting: (2<=Clients)
states: 21

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [[E [AF [[[2<=haveA2 | haveA2andB<=haveA2] & [haveB<=haveA & 1<=resB]]] U AF [E [haveA<=Clients U 3<=haveAandB]]] | EF [[~ [3<=haveA] | EG [~ [1<=haveAandB]]]]]]
normalized: ~ [EX [~ [[E [~ [EG [~ [[[haveB<=haveA & 1<=resB] & [2<=haveA2 | haveA2andB<=haveA2]]]]] U ~ [EG [~ [E [haveA<=Clients U 3<=haveAandB]]]]] | E [true U [EG [~ [1<=haveAandB]] | ~ [3<=haveA]]]]]]]

abstracting: (3<=haveA)
states: 0
abstracting: (1<=haveAandB)
states: 8
..........
EG iterations: 10
abstracting: (3<=haveAandB)
states: 0
abstracting: (haveA<=Clients)
states: 29

EG iterations: 0
abstracting: (haveA2andB<=haveA2)
states: 26
abstracting: (2<=haveA2)
states: 2
abstracting: (1<=resB)
states: 18
abstracting: (haveB<=haveA)
states: 21
..
EG iterations: 2
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [~ [[EG [~ [haveAandB<=resA]] | EF [[EF [haveA2<=0] & A [haveA<=Clients U haveB<=0]]]]] U [2<=resA | AG [A [E [Clients<=haveB U 3<=haveA] U AX [haveA2<=haveAandB]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [[~ [EG [EX [~ [haveA2<=haveAandB]]]] & ~ [E [EX [~ [haveA2<=haveAandB]] U [~ [E [Clients<=haveB U 3<=haveA]] & EX [~ [haveA2<=haveAandB]]]]]]]]] | 2<=resA]]]] & ~ [E [~ [[~ [E [true U ~ [[~ [EG [EX [~ [haveA2<=haveAandB]]]] & ~ [E [EX [~ [haveA2<=haveAandB]] U [~ [E [Clients<=haveB U 3<=haveA]] & EX [~ [haveA2<=haveAandB]]]]]]]]] | 2<=resA]] U [~ [[~ [E [true U ~ [[~ [EG [EX [~ [haveA2<=haveAandB]]]] & ~ [E [EX [~ [haveA2<=haveAandB]] U [~ [E [Clients<=haveB U 3<=haveA]] & EX [~ [haveA2<=haveAandB]]]]]]]]] | 2<=resA]] & [E [true U [[~ [EG [~ [haveB<=0]]] & ~ [E [~ [haveB<=0] U [~ [haveA<=Clients] & ~ [haveB<=0]]]]] & E [true U haveA2<=0]]] | EG [~ [haveAandB<=resA]]]]]]]

abstracting: (haveAandB<=resA)
states: 26
...
EG iterations: 3
abstracting: (haveA2<=0)
states: 20
abstracting: (haveB<=0)
states: 15
abstracting: (haveA<=Clients)
states: 29
abstracting: (haveB<=0)
states: 15
abstracting: (haveB<=0)
states: 15
.
EG iterations: 1
abstracting: (2<=resA)
states: 3
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (3<=haveA)
states: 0
abstracting: (Clients<=haveB)
states: 12
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (haveA2<=haveAandB)
states: 22
..........
EG iterations: 9
abstracting: (2<=resA)
states: 3
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (3<=haveA)
states: 0
abstracting: (Clients<=haveB)
states: 12
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (haveA2<=haveAandB)
states: 22
..........
EG iterations: 9
abstracting: (2<=resA)
states: 3
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (3<=haveA)
states: 0
abstracting: (Clients<=haveB)
states: 12
abstracting: (haveA2<=haveAandB)
states: 22
.abstracting: (haveA2<=haveAandB)
states: 22
..........
EG iterations: 9
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [EX [E [haveA2<=2 U 1<=haveA2]] | EX [[AX [AF [EX [1<=resA]]] | ~ [[[[A [haveA<=2 U 3<=resA] & ~ [2<=resA]] & AF [haveAandB<=haveAandB]] & [resA<=haveAandB & resA<=resB]]]]]]
normalized: [EX [[~ [[[resA<=haveAandB & resA<=resB] & [~ [EG [~ [haveAandB<=haveAandB]]] & [~ [2<=resA] & [~ [EG [~ [3<=resA]]] & ~ [E [~ [3<=resA] U [~ [haveA<=2] & ~ [3<=resA]]]]]]]]] | ~ [EX [EG [~ [EX [1<=resA]]]]]]] | EX [E [haveA2<=2 U 1<=haveA2]]]

abstracting: (1<=haveA2)
states: 12
abstracting: (haveA2<=2)
states: 32
.abstracting: (1<=resA)
states: 13
...
EG iterations: 2
.abstracting: (3<=resA)
states: 0
abstracting: (haveA<=2)
states: 32
abstracting: (3<=resA)
states: 0
abstracting: (3<=resA)
states: 0

EG iterations: 0
abstracting: (2<=resA)
states: 3
abstracting: (haveAandB<=haveAandB)
states: 32
.
EG iterations: 1
abstracting: (resA<=resB)
states: 26
abstracting: (resA<=haveAandB)
states: 21
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [AG [E [E [AG [haveB<=4] U ~ [3<=haveA2andB]] U [EG [resA<=haveA] | 2<=Clients]]] U [[[~ [EX [[haveAandB<=2 | haveA2andB<=resA]]] | ~ [E [[haveAandB<=haveA | 2<=haveB] U EG [3<=haveA2andB]]]] & resB<=0] | ~ [AX [EG [AG [haveA2andB<=4]]]]]]
normalized: [~ [EG [~ [[EX [~ [EG [~ [E [true U ~ [haveA2andB<=4]]]]]] | [[~ [E [[haveAandB<=haveA | 2<=haveB] U EG [3<=haveA2andB]]] | ~ [EX [[haveAandB<=2 | haveA2andB<=resA]]]] & resB<=0]]]]] & ~ [E [~ [[EX [~ [EG [~ [E [true U ~ [haveA2andB<=4]]]]]] | [[~ [E [[haveAandB<=haveA | 2<=haveB] U EG [3<=haveA2andB]]] | ~ [EX [[haveAandB<=2 | haveA2andB<=resA]]]] & resB<=0]]] U [E [true U ~ [E [E [~ [E [true U ~ [haveB<=4]]] U ~ [3<=haveA2andB]] U [EG [resA<=haveA] | 2<=Clients]]]] & ~ [[EX [~ [EG [~ [E [true U ~ [haveA2andB<=4]]]]]] | [[~ [E [[haveAandB<=haveA | 2<=haveB] U EG [3<=haveA2andB]]] | ~ [EX [[haveAandB<=2 | haveA2andB<=resA]]]] & resB<=0]]]]]]]

abstracting: (resB<=0)
states: 14
abstracting: (haveA2andB<=resA)
states: 26
abstracting: (haveAandB<=2)
states: 32
.abstracting: (3<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (2<=haveB)
states: 5
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (haveA2andB<=4)
states: 32

EG iterations: 0
.abstracting: (2<=Clients)
states: 21
abstracting: (resA<=haveA)
states: 22
....
EG iterations: 4
abstracting: (3<=haveA2andB)
states: 0
abstracting: (haveB<=4)
states: 32
abstracting: (resB<=0)
states: 14
abstracting: (haveA2andB<=resA)
states: 26
abstracting: (haveAandB<=2)
states: 32
.abstracting: (3<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (2<=haveB)
states: 5
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (haveA2andB<=4)
states: 32

EG iterations: 0
.abstracting: (resB<=0)
states: 14
abstracting: (haveA2andB<=resA)
states: 26
abstracting: (haveAandB<=2)
states: 32
.abstracting: (3<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (2<=haveB)
states: 5
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (haveA2andB<=4)
states: 32

EG iterations: 0
...
EG iterations: 2
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [A [EG [AF [~ [haveAandB<=1]]] U [AF [[AF [4<=Clients] | [EG [1<=haveA] | [Clients<=2 | haveA2<=Clients]]]] | [[[[[haveA<=Clients & haveA2andB<=3] & A [haveA2<=0 U resA<=0]] & haveA<=2] | haveA<=haveA] | [[E [haveA2<=4 U 2<=haveB] | AF [3<=haveA2andB]] | 1<=haveA]]]] | EF [resA<=resA]]
normalized: [E [true U resA<=resA] | [~ [EG [~ [[[[[~ [EG [~ [3<=haveA2andB]]] | E [haveA2<=4 U 2<=haveB]] | 1<=haveA] | [[[[~ [EG [~ [resA<=0]]] & ~ [E [~ [resA<=0] U [~ [haveA2<=0] & ~ [resA<=0]]]]] & [haveA<=Clients & haveA2andB<=3]] & haveA<=2] | haveA<=haveA]] | ~ [EG [~ [[[[Clients<=2 | haveA2<=Clients] | EG [1<=haveA]] | ~ [EG [~ [4<=Clients]]]]]]]]]]] & ~ [E [~ [[[[[~ [EG [~ [3<=haveA2andB]]] | E [haveA2<=4 U 2<=haveB]] | 1<=haveA] | [[[[~ [EG [~ [resA<=0]]] & ~ [E [~ [resA<=0] U [~ [haveA2<=0] & ~ [resA<=0]]]]] & [haveA<=Clients & haveA2andB<=3]] & haveA<=2] | haveA<=haveA]] | ~ [EG [~ [[[[Clients<=2 | haveA2<=Clients] | EG [1<=haveA]] | ~ [EG [~ [4<=Clients]]]]]]]]] U [~ [EG [~ [EG [haveAandB<=1]]]] & ~ [[[[[~ [EG [~ [3<=haveA2andB]]] | E [haveA2<=4 U 2<=haveB]] | 1<=haveA] | [[[[~ [EG [~ [resA<=0]]] & ~ [E [~ [resA<=0] U [~ [haveA2<=0] & ~ [resA<=0]]]]] & [haveA<=Clients & haveA2andB<=3]] & haveA<=2] | haveA<=haveA]] | ~ [EG [~ [[[[Clients<=2 | haveA2<=Clients] | EG [1<=haveA]] | ~ [EG [~ [4<=Clients]]]]]]]]]]]]]]

abstracting: (4<=Clients)
states: 1
.
EG iterations: 1
abstracting: (1<=haveA)
states: 13
.
EG iterations: 1
abstracting: (haveA2<=Clients)
states: 30
abstracting: (Clients<=2)
states: 26
.
EG iterations: 1
abstracting: (haveA<=haveA)
states: 32
abstracting: (haveA<=2)
states: 32
abstracting: (haveA2andB<=3)
states: 32
abstracting: (haveA<=Clients)
states: 29
abstracting: (resA<=0)
states: 19
abstracting: (haveA2<=0)
states: 20
abstracting: (resA<=0)
states: 19
abstracting: (resA<=0)
states: 19
..
EG iterations: 2
abstracting: (1<=haveA)
states: 13
abstracting: (2<=haveB)
states: 5
abstracting: (haveA2<=4)
states: 32
abstracting: (3<=haveA2andB)
states: 0

EG iterations: 0
abstracting: (haveAandB<=1)
states: 31
.
EG iterations: 1
..
EG iterations: 2
abstracting: (4<=Clients)
states: 1
.
EG iterations: 1
abstracting: (1<=haveA)
states: 13
.
EG iterations: 1
abstracting: (haveA2<=Clients)
states: 30
abstracting: (Clients<=2)
states: 26
.
EG iterations: 1
abstracting: (haveA<=haveA)
states: 32
abstracting: (haveA<=2)
states: 32
abstracting: (haveA2andB<=3)
states: 32
abstracting: (haveA<=Clients)
states: 29
abstracting: (resA<=0)
states: 19
abstracting: (haveA2<=0)
states: 20
abstracting: (resA<=0)
states: 19
abstracting: (resA<=0)
states: 19
..
EG iterations: 2
abstracting: (1<=haveA)
states: 13
abstracting: (2<=haveB)
states: 5
abstracting: (haveA2<=4)
states: 32
abstracting: (3<=haveA2andB)
states: 0

EG iterations: 0
abstracting: (4<=Clients)
states: 1
.
EG iterations: 1
abstracting: (1<=haveA)
states: 13
.
EG iterations: 1
abstracting: (haveA2<=Clients)
states: 30
abstracting: (Clients<=2)
states: 26
.
EG iterations: 1
abstracting: (haveA<=haveA)
states: 32
abstracting: (haveA<=2)
states: 32
abstracting: (haveA2andB<=3)
states: 32
abstracting: (haveA<=Clients)
states: 29
abstracting: (resA<=0)
states: 19
abstracting: (haveA2<=0)
states: 20
abstracting: (resA<=0)
states: 19
abstracting: (resA<=0)
states: 19
..
EG iterations: 2
abstracting: (1<=haveA)
states: 13
abstracting: (2<=haveB)
states: 5
abstracting: (haveA2<=4)
states: 32
abstracting: (3<=haveA2andB)
states: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (resA<=resA)
states: 32
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [E [[EF [[[4<=resB & AX [2<=haveA2andB]] & [[haveA2andB<=3 | haveA2andB<=4] & ~ [resB<=3]]]] | haveAandB<=haveA2andB] U ~ [E [EF [~ [haveB<=haveB]] U ~ [[[haveA2<=4 & haveA<=haveA2andB] & EF [resA<=2]]]]]] & EF [~ [[~ [haveA2<=3] & A [[Clients<=haveA2 & 1<=haveAandB] U A [3<=resA U haveA2andB<=resB]]]]]]
normalized: [E [true U ~ [[[~ [EG [~ [[~ [EG [~ [haveA2andB<=resB]]] & ~ [E [~ [haveA2andB<=resB] U [~ [3<=resA] & ~ [haveA2andB<=resB]]]]]]]] & ~ [E [~ [[~ [EG [~ [haveA2andB<=resB]]] & ~ [E [~ [haveA2andB<=resB] U [~ [3<=resA] & ~ [haveA2andB<=resB]]]]]] U [~ [[Clients<=haveA2 & 1<=haveAandB]] & ~ [[~ [EG [~ [haveA2andB<=resB]]] & ~ [E [~ [haveA2andB<=resB] U [~ [3<=resA] & ~ [haveA2andB<=resB]]]]]]]]]] & ~ [haveA2<=3]]]] & E [[E [true U [[~ [resB<=3] & [haveA2andB<=3 | haveA2andB<=4]] & [~ [EX [~ [2<=haveA2andB]]] & 4<=resB]]] | haveAandB<=haveA2andB] U ~ [E [E [true U ~ [haveB<=haveB]] U ~ [[E [true U resA<=2] & [haveA2<=4 & haveA<=haveA2andB]]]]]]]

abstracting: (haveA<=haveA2andB)
states: 21
abstracting: (haveA2<=4)
states: 32
abstracting: (resA<=2)
states: 32
abstracting: (haveB<=haveB)
states: 32
abstracting: (haveAandB<=haveA2andB)
states: 25
abstracting: (4<=resB)
states: 0
abstracting: (2<=haveA2andB)
states: 1
.abstracting: (haveA2andB<=4)
states: 32
abstracting: (haveA2andB<=3)
states: 32
abstracting: (resB<=3)
states: 32
abstracting: (haveA2<=3)
states: 32
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (3<=resA)
states: 0
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (haveA2andB<=resB)
states: 27
....
EG iterations: 4
abstracting: (1<=haveAandB)
states: 8
abstracting: (Clients<=haveA2)
states: 8
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (3<=resA)
states: 0
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (haveA2andB<=resB)
states: 27
....
EG iterations: 4
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (3<=resA)
states: 0
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (haveA2andB<=resB)
states: 27
....
EG iterations: 4
....
EG iterations: 4
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [[E [[[[[resA<=haveB | 4<=Clients] | AX [2<=haveAandB]] | 1<=haveAandB] & haveAandB<=resB] U EX [E [1<=haveA2andB U 3<=haveAandB]]] & ~ [AG [AG [haveA<=resB]]]] U E [[haveB<=resA & EG [AX [haveAandB<=4]]] U [[~ [4<=haveA2andB] | [AX [haveB<=3] & [AX [haveA2andB<=2] | 1<=Clients]]] | [[3<=resA & AX [resB<=2]] & ~ [EX [3<=haveA2andB]]]]]]
normalized: E [[E [true U E [true U ~ [haveA<=resB]]] & E [[[[~ [EX [~ [2<=haveAandB]]] | [resA<=haveB | 4<=Clients]] | 1<=haveAandB] & haveAandB<=resB] U EX [E [1<=haveA2andB U 3<=haveAandB]]]] U E [[EG [~ [EX [~ [haveAandB<=4]]]] & haveB<=resA] U [[~ [EX [3<=haveA2andB]] & [~ [EX [~ [resB<=2]]] & 3<=resA]] | [[[~ [EX [~ [haveA2andB<=2]]] | 1<=Clients] & ~ [EX [~ [haveB<=3]]]] | ~ [4<=haveA2andB]]]]]

abstracting: (4<=haveA2andB)
states: 0
abstracting: (haveB<=3)
states: 32
.abstracting: (1<=Clients)
states: 30
abstracting: (haveA2andB<=2)
states: 32
.abstracting: (3<=resA)
states: 0
abstracting: (resB<=2)
states: 32
.abstracting: (3<=haveA2andB)
states: 0
.abstracting: (haveB<=resA)
states: 21
abstracting: (haveAandB<=4)
states: 32
.
EG iterations: 0
abstracting: (3<=haveAandB)
states: 0
abstracting: (1<=haveA2andB)
states: 8
.abstracting: (haveAandB<=resB)
states: 27
abstracting: (1<=haveAandB)
states: 8
abstracting: (4<=Clients)
states: 1
abstracting: (resA<=haveB)
states: 26
abstracting: (2<=haveAandB)
states: 1
.abstracting: (haveA<=resB)
states: 26
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [[E [~ [AF [haveA<=4]] U A [[haveA2<=4 | haveA<=haveA2] U [haveA2<=4 & Clients<=1]]] | [E [AX [Clients<=3] U [AX [haveA2andB<=haveAandB] | EX [1<=haveAandB]]] & [[[AX [haveAandB<=4] & haveA<=haveAandB] | resA<=0] | haveA2andB<=haveAandB]]]] | [EX [[EX [A [haveB<=haveAandB U 1<=resA]] | haveA<=4]] & AF [[EG [~ [EG [haveB<=resB]]] | [~ [E [3<=haveA2andB U haveB<=4]] & EX [haveAandB<=2]]]]]]
normalized: [E [true U [[E [~ [EX [~ [Clients<=3]]] U [EX [1<=haveAandB] | ~ [EX [~ [haveA2andB<=haveAandB]]]]] & [[[~ [EX [~ [haveAandB<=4]]] & haveA<=haveAandB] | resA<=0] | haveA2andB<=haveAandB]] | E [EG [~ [haveA<=4]] U [~ [EG [~ [[haveA2<=4 & Clients<=1]]]] & ~ [E [~ [[haveA2<=4 & Clients<=1]] U [~ [[haveA2<=4 | haveA<=haveA2]] & ~ [[haveA2<=4 & Clients<=1]]]]]]]]] | [~ [EG [~ [[[EX [haveAandB<=2] & ~ [E [3<=haveA2andB U haveB<=4]]] | EG [~ [EG [haveB<=resB]]]]]]] & EX [[EX [[~ [EG [~ [1<=resA]]] & ~ [E [~ [1<=resA] U [~ [haveB<=haveAandB] & ~ [1<=resA]]]]]] | haveA<=4]]]]

abstracting: (haveA<=4)
states: 32
abstracting: (1<=resA)
states: 13
abstracting: (haveB<=haveAandB)
states: 18
abstracting: (1<=resA)
states: 13
abstracting: (1<=resA)
states: 13
....
EG iterations: 4
..abstracting: (haveB<=resB)
states: 21
..
EG iterations: 2
....
EG iterations: 4
abstracting: (haveB<=4)
states: 32
abstracting: (3<=haveA2andB)
states: 0
abstracting: (haveAandB<=2)
states: 32
..
EG iterations: 1
abstracting: (Clients<=1)
states: 11
abstracting: (haveA2<=4)
states: 32
abstracting: (haveA<=haveA2)
states: 22
abstracting: (haveA2<=4)
states: 32
abstracting: (Clients<=1)
states: 11
abstracting: (haveA2<=4)
states: 32
abstracting: (Clients<=1)
states: 11
abstracting: (haveA2<=4)
states: 32
.
EG iterations: 1
abstracting: (haveA<=4)
states: 32
.
EG iterations: 1
abstracting: (haveA2andB<=haveAandB)
states: 25
abstracting: (resA<=0)
states: 19
abstracting: (haveA<=haveAandB)
states: 21
abstracting: (haveAandB<=4)
states: 32
.abstracting: (haveA2andB<=haveAandB)
states: 25
.abstracting: (1<=haveAandB)
states: 8
.abstracting: (Clients<=3)
states: 31
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 1726 (1.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4069 3906 7975
used/not used/entry size/cache size: 5066 67103798 16 1024MB
basic ops cache: hits/miss/sum: 2878 4111 6989
used/not used/entry size/cache size: 6525 16770691 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: 509 329 838
used/not used/entry size/cache size: 329 8388279 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 67107353
1 1383
2 70
3 40
4 8
5 9
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.534sec


BK_STOP 1679868055204

--------------------
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:52 (8), effective:15 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:30 (5), effective:7 (1)

iterations count:40 (6), effective:13 (2)

iterations count:24 (4), effective:7 (1)

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

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

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

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

iterations count:50 (8), effective:14 (2)

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

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

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

iterations count:23 (3), effective:6 (1)

iterations count:30 (5), effective:7 (1)

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

iterations count:26 (4), effective:7 (1)

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

iterations count:26 (4), effective:7 (1)

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

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

iterations count:26 (4), effective:7 (1)

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

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

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

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

iterations count:34 (5), effective:10 (1)

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

iterations count:34 (5), effective:10 (1)

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

iterations count:34 (5), effective:10 (1)

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

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

iterations count:28 (4), effective:9 (1)

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

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

iterations count:6 (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="TwoPhaseLocking-PT-nC00004vD"
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 TwoPhaseLocking-PT-nC00004vD, 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 r481-tall-167912692400769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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