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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Feb 25 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 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-nC00050vD-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868391805

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-nC00050vD
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_nC00050vD
(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.831sec


RS generation: 0m 0.165sec


-> reachability set: #nodes 11232 (1.1e+04) #states 380,015 (5)



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

checking: AG [EF [28<=haveB]]
normalized: ~ [E [true U ~ [E [true U 28<=haveB]]]]

abstracting: (28<=haveB)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.033sec

checking: EG [AF [~ [EF [AF [resB<=haveB]]]]]
normalized: EG [~ [EG [E [true U ~ [EG [~ [resB<=haveB]]]]]]]

abstracting: (resB<=haveB)
states: 195,922 (5)
....
EG iterations: 4

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

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.330sec

checking: EX [AX [AG [EF [[37<=haveAandB & 49<=resB]]]]]
normalized: EX [~ [EX [E [true U ~ [E [true U [37<=haveAandB & 49<=resB]]]]]]]

abstracting: (49<=resB)
states: 0
abstracting: (37<=haveAandB)
states: 0
..-> the formula is FALSE

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

MC time: 0m 0.028sec

checking: ~ [EG [haveAandB<=haveB]]
normalized: ~ [EG [haveAandB<=haveB]]

abstracting: (haveAandB<=haveB)
states: 277,367 (5)
.............................................................................
EG iterations: 77
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.238sec

checking: AG [~ [[Clients<=16 & AF [50<=haveA]]]]
normalized: ~ [E [true U [Clients<=16 & ~ [EG [~ [50<=haveA]]]]]]

abstracting: (50<=haveA)
states: 0

EG iterations: 0
abstracting: (Clients<=16)
states: 79,457 (4)
-> the formula is TRUE

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

MC time: 0m 0.018sec

checking: AG [EF [Clients<=haveB]]
normalized: ~ [E [true U ~ [E [true U Clients<=haveB]]]]

abstracting: (Clients<=haveB)
states: 57,875 (4)
-> the formula is TRUE

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

MC time: 0m 0.058sec

checking: AG [[EG [AX [AG [haveA2andB<=42]]] & haveA2andB<=29]]
normalized: ~ [E [true U ~ [[haveA2andB<=29 & EG [~ [EX [E [true U ~ [haveA2andB<=42]]]]]]]]]

abstracting: (haveA2andB<=42)
states: 380,015 (5)
.
EG iterations: 0
abstracting: (haveA2andB<=29)
states: 380,015 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [22<=haveA2andB U EX [[EF [haveA2<=haveB] & EF [~ [[31<=haveA2 | haveB<=44]]]]]]
normalized: [~ [EG [~ [EX [[E [true U ~ [[31<=haveA2 | haveB<=44]]] & E [true U haveA2<=haveB]]]]]] & ~ [E [~ [EX [[E [true U ~ [[31<=haveA2 | haveB<=44]]] & E [true U haveA2<=haveB]]]] U [~ [22<=haveA2andB] & ~ [EX [[E [true U ~ [[31<=haveA2 | haveB<=44]]] & E [true U haveA2<=haveB]]]]]]]]

abstracting: (haveA2<=haveB)
states: 261,260 (5)
abstracting: (haveB<=44)
states: 380,015 (5)
abstracting: (31<=haveA2)
states: 0
.abstracting: (22<=haveA2andB)
states: 98
abstracting: (haveA2<=haveB)
states: 261,260 (5)
abstracting: (haveB<=44)
states: 380,015 (5)
abstracting: (31<=haveA2)
states: 0
.abstracting: (haveA2<=haveB)
states: 261,260 (5)
abstracting: (haveB<=44)
states: 380,015 (5)
abstracting: (31<=haveA2)
states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EG [AF [E [EF [~ [resB<=30]] U AF [[haveAandB<=haveB & resA<=haveA2andB]]]]]
normalized: EG [~ [EG [~ [E [E [true U ~ [resB<=30]] U ~ [EG [~ [[haveAandB<=haveB & resA<=haveA2andB]]]]]]]]]

abstracting: (resA<=haveA2andB)
states: 171,989 (5)
abstracting: (haveAandB<=haveB)
states: 277,367 (5)
.....
EG iterations: 5
abstracting: (resB<=30)
states: 380,015 (5)
.
EG iterations: 1
...........................................................................
EG iterations: 75
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

checking: EF [[[34<=haveA | A [EX [[haveA2andB<=46 & 46<=haveA2]] U ~ [AF [haveA2andB<=20]]]] & 44<=haveB]]
normalized: E [true U [44<=haveB & [34<=haveA | [~ [EG [~ [EG [~ [haveA2andB<=20]]]]] & ~ [E [~ [EG [~ [haveA2andB<=20]]] U [~ [EG [~ [haveA2andB<=20]]] & ~ [EX [[haveA2andB<=46 & 46<=haveA2]]]]]]]]]]

abstracting: (46<=haveA2)
states: 0
abstracting: (haveA2andB<=46)
states: 380,015 (5)
.abstracting: (haveA2andB<=20)
states: 379,777 (5)
..
EG iterations: 2
abstracting: (haveA2andB<=20)
states: 379,777 (5)
..
EG iterations: 2
abstracting: (haveA2andB<=20)
states: 379,777 (5)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (34<=haveA)
states: 0
abstracting: (44<=haveB)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: A [[EG [18<=haveAandB] & resB<=41] U ~ [EF [A [[[50<=haveB | haveA<=Clients] & haveA2<=36] U AG [45<=haveAandB]]]]]
normalized: [~ [EG [E [true U [~ [EG [E [true U ~ [45<=haveAandB]]]] & ~ [E [E [true U ~ [45<=haveAandB]] U [~ [[haveA2<=36 & [50<=haveB | haveA<=Clients]]] & E [true U ~ [45<=haveAandB]]]]]]]]] & ~ [E [E [true U [~ [EG [E [true U ~ [45<=haveAandB]]]] & ~ [E [E [true U ~ [45<=haveAandB]] U [~ [[haveA2<=36 & [50<=haveB | haveA<=Clients]]] & E [true U ~ [45<=haveAandB]]]]]]] U [~ [[resB<=41 & EG [18<=haveAandB]]] & E [true U [~ [EG [E [true U ~ [45<=haveAandB]]]] & ~ [E [E [true U ~ [45<=haveAandB]] U [~ [[haveA2<=36 & [50<=haveB | haveA<=Clients]]] & E [true U ~ [45<=haveAandB]]]]]]]]]]]

abstracting: (45<=haveAandB)
states: 0
abstracting: (haveA<=Clients)
states: 360,723 (5)
abstracting: (50<=haveB)
states: 0
abstracting: (haveA2<=36)
states: 380,015 (5)
abstracting: (45<=haveAandB)
states: 0
abstracting: (45<=haveAandB)
states: 0

EG iterations: 0
abstracting: (18<=haveAandB)
states: 1,716 (3)
..
EG iterations: 2
abstracting: (resB<=41)
states: 380,015 (5)
abstracting: (45<=haveAandB)
states: 0
abstracting: (haveA<=Clients)
states: 360,723 (5)
abstracting: (50<=haveB)
states: 0
abstracting: (haveA2<=36)
states: 380,015 (5)
abstracting: (45<=haveAandB)
states: 0
abstracting: (45<=haveAandB)
states: 0

EG iterations: 0
abstracting: (45<=haveAandB)
states: 0
abstracting: (haveA<=Clients)
states: 360,723 (5)
abstracting: (50<=haveB)
states: 0
abstracting: (haveA2<=36)
states: 380,015 (5)
abstracting: (45<=haveAandB)
states: 0
abstracting: (45<=haveAandB)
states: 0

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

FORMULA TwoPhaseLocking-PT-nC00050vD-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.399sec

checking: A [EG [[EG [~ [haveB<=haveA]] & haveA<=haveA2andB]] U ~ [[AF [A [haveA2andB<=33 U Clients<=haveAandB]] | AG [EG [6<=Clients]]]]]
normalized: [~ [EG [[~ [E [true U ~ [EG [6<=Clients]]]] | ~ [EG [~ [[~ [EG [~ [Clients<=haveAandB]]] & ~ [E [~ [Clients<=haveAandB] U [~ [haveA2andB<=33] & ~ [Clients<=haveAandB]]]]]]]]]]] & ~ [E [[~ [E [true U ~ [EG [6<=Clients]]]] | ~ [EG [~ [[~ [EG [~ [Clients<=haveAandB]]] & ~ [E [~ [Clients<=haveAandB] U [~ [haveA2andB<=33] & ~ [Clients<=haveAandB]]]]]]]]] U [~ [EG [[haveA<=haveA2andB & EG [~ [haveB<=haveA]]]]] & [~ [E [true U ~ [EG [6<=Clients]]]] | ~ [EG [~ [[~ [EG [~ [Clients<=haveAandB]]] & ~ [E [~ [Clients<=haveAandB] U [~ [haveA2andB<=33] & ~ [Clients<=haveAandB]]]]]]]]]]]]]

abstracting: (Clients<=haveAandB)
states: 350
abstracting: (haveA2andB<=33)
states: 380,015 (5)
abstracting: (Clients<=haveAandB)
states: 350
abstracting: (Clients<=haveAandB)
states: 350
..
EG iterations: 2
.
EG iterations: 1
abstracting: (6<=Clients)
states: 377,118 (5)
.
EG iterations: 1
abstracting: (haveB<=haveA)
states: 142,506 (5)
...................................................
EG iterations: 51
abstracting: (haveA<=haveA2andB)
states: 171,989 (5)
...........................
EG iterations: 27
abstracting: (Clients<=haveAandB)
states: 350
abstracting: (haveA2andB<=33)
states: 380,015 (5)
abstracting: (Clients<=haveAandB)
states: 350
abstracting: (Clients<=haveAandB)
states: 350
..
EG iterations: 2
.
EG iterations: 1
abstracting: (6<=Clients)
states: 377,118 (5)
.
EG iterations: 1
abstracting: (Clients<=haveAandB)
states: 350
abstracting: (haveA2andB<=33)
states: 380,015 (5)
abstracting: (Clients<=haveAandB)
states: 350
abstracting: (Clients<=haveAandB)
states: 350
..
EG iterations: 2
.
EG iterations: 1
abstracting: (6<=Clients)
states: 377,118 (5)
.
EG iterations: 1
...
EG iterations: 3
-> the formula is TRUE

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

MC time: 0m 0.549sec

checking: AG [EF [[E [EF [haveA2<=43] U haveA2andB<=haveA2andB] | [~ [EX [8<=haveB]] & E [[Clients<=3 | resB<=haveA2] U [haveA<=3 & 1<=Clients]]]]]]
normalized: ~ [E [true U ~ [E [true U [[E [[Clients<=3 | resB<=haveA2] U [haveA<=3 & 1<=Clients]] & ~ [EX [8<=haveB]]] | E [E [true U haveA2<=43] U haveA2andB<=haveA2andB]]]]]]

abstracting: (haveA2andB<=haveA2andB)
states: 380,015 (5)
abstracting: (haveA2<=43)
states: 380,015 (5)
abstracting: (8<=haveB)
states: 194,711 (5)
.abstracting: (1<=Clients)
states: 379,990 (5)
abstracting: (haveA<=3)
states: 157,375 (5)
abstracting: (resB<=haveA2)
states: 142,505 (5)
abstracting: (Clients<=3)
states: 846
-> the formula is TRUE

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

MC time: 0m 0.161sec

checking: AG [[A [[EX [E [resB<=8 U resB<=haveA]] | [[30<=haveA2andB | ~ [resB<=31]] & EG [haveA<=haveB]]] U AF [haveA2<=26]] | resB<=40]]
normalized: ~ [E [true U ~ [[resB<=40 | [~ [EG [EG [~ [haveA2<=26]]]] & ~ [E [EG [~ [haveA2<=26]] U [~ [[[EG [haveA<=haveB] & [30<=haveA2andB | ~ [resB<=31]]] | EX [E [resB<=8 U resB<=haveA]]]] & EG [~ [haveA2<=26]]]]]]]]]]

abstracting: (haveA2<=26)
states: 380,015 (5)
.
EG iterations: 1
abstracting: (resB<=haveA)
states: 142,505 (5)
abstracting: (resB<=8)
states: 206,564 (5)
.abstracting: (resB<=31)
states: 380,015 (5)
abstracting: (30<=haveA2andB)
states: 0
abstracting: (haveA<=haveB)
states: 261,260 (5)
....................................................
EG iterations: 52
abstracting: (haveA2<=26)
states: 380,015 (5)
.
EG iterations: 1
abstracting: (haveA2<=26)
states: 380,015 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (resB<=40)
states: 380,015 (5)
-> the formula is TRUE

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

MC time: 0m 0.187sec

checking: EG [[~ [[E [Clients<=Clients U [resB<=haveAandB & [24<=haveA | haveA2andB<=haveA2andB]]] & haveA<=haveA2andB]] & AF [[[haveAandB<=48 & [E [haveA2<=haveAandB U 14<=haveA2] & ~ [19<=haveA2]]] | EG [[35<=haveAandB | haveAandB<=7]]]]]]
normalized: EG [[~ [EG [~ [[EG [[35<=haveAandB | haveAandB<=7]] | [haveAandB<=48 & [~ [19<=haveA2] & E [haveA2<=haveAandB U 14<=haveA2]]]]]]] & ~ [[haveA<=haveA2andB & E [Clients<=Clients U [resB<=haveAandB & [24<=haveA | haveA2andB<=haveA2andB]]]]]]]

abstracting: (haveA2andB<=haveA2andB)
states: 380,015 (5)
abstracting: (24<=haveA)
states: 128
abstracting: (resB<=haveAandB)
states: 123,213 (5)
abstracting: (Clients<=Clients)
states: 380,015 (5)
abstracting: (haveA<=haveA2andB)
states: 171,989 (5)
abstracting: (14<=haveA2)
states: 29,483 (4)
abstracting: (haveA2<=haveAandB)
states: 171,990 (5)
abstracting: (19<=haveA2)
states: 4,955 (3)
abstracting: (haveAandB<=48)
states: 380,015 (5)
abstracting: (haveAandB<=7)
states: 312,983 (5)
abstracting: (35<=haveAandB)
states: 0
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.357sec

checking: [E [~ [EG [Clients<=resA]] U A [~ [AX [resB<=20]] U EG [~ [[haveAandB<=19 & haveB<=17]]]]] | EF [[[17<=haveA2 & [[haveB<=resA & E [haveA<=haveA2andB U haveA2andB<=haveAandB]] | [[[resB<=0 | haveA<=40] | A [resB<=haveA2 U resB<=50]] & AG [haveB<=haveA2andB]]]] | [~ [resB<=33] & [haveA<=haveA | EX [[Clients<=haveA & haveA<=34]]]]]]]
normalized: [E [true U [[[haveA<=haveA | EX [[Clients<=haveA & haveA<=34]]] & ~ [resB<=33]] | [17<=haveA2 & [[~ [E [true U ~ [haveB<=haveA2andB]]] & [[~ [EG [~ [resB<=50]]] & ~ [E [~ [resB<=50] U [~ [resB<=haveA2] & ~ [resB<=50]]]]] | [resB<=0 | haveA<=40]]] | [haveB<=resA & E [haveA<=haveA2andB U haveA2andB<=haveAandB]]]]]] | E [~ [EG [Clients<=resA]] U [~ [EG [~ [EG [~ [[haveAandB<=19 & haveB<=17]]]]]] & ~ [E [~ [EG [~ [[haveAandB<=19 & haveB<=17]]]] U [~ [EX [~ [resB<=20]]] & ~ [EG [~ [[haveAandB<=19 & haveB<=17]]]]]]]]]]

abstracting: (haveB<=17)
states: 348,060 (5)
abstracting: (haveAandB<=19)
states: 379,511 (5)
..
EG iterations: 2
abstracting: (resB<=20)
states: 369,487 (5)
.abstracting: (haveB<=17)
states: 348,060 (5)
abstracting: (haveAandB<=19)
states: 379,511 (5)
..
EG iterations: 2
abstracting: (haveB<=17)
states: 348,060 (5)
abstracting: (haveAandB<=19)
states: 379,511 (5)
..
EG iterations: 2
..........
EG iterations: 10
abstracting: (Clients<=resA)
states: 350
.
EG iterations: 1
abstracting: (haveA2andB<=haveAandB)
states: 207,388 (5)
abstracting: (haveA<=haveA2andB)
states: 171,989 (5)
abstracting: (haveB<=resA)
states: 142,506 (5)
abstracting: (haveA<=40)
states: 380,015 (5)
abstracting: (resB<=0)
states: 23,750 (4)
abstracting: (resB<=50)
states: 380,015 (5)
abstracting: (resB<=haveA2)
states: 142,505 (5)
abstracting: (resB<=50)
states: 380,015 (5)
abstracting: (resB<=50)
states: 380,015 (5)
.
EG iterations: 1
abstracting: (haveB<=haveA2andB)
states: 123,214 (5)
abstracting: (17<=haveA2)
states: 11,285 (4)
abstracting: (resB<=33)
states: 380,015 (5)
abstracting: (haveA<=34)
states: 380,015 (5)
abstracting: (Clients<=haveA)
states: 22,931 (4)
.abstracting: (haveA<=haveA)
states: 380,015 (5)
-> the formula is TRUE

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

MC time: 0m 0.698sec

totally nodes used: 393158 (3.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6239004 1493717 7732721
used/not used/entry size/cache size: 1863271 65245593 16 1024MB
basic ops cache: hits/miss/sum: 2906098 1612403 4518501
used/not used/entry size/cache size: 2056702 14720514 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: 297152 118061 415213
used/not used/entry size/cache size: 117290 8271318 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 66758945
1 329333
2 12146
3 4808
4 1493
5 767
6 471
7 292
8 145
9 56
>= 10 408

Total processing time: 0m 8.044sec


BK_STOP 1679868399908

--------------------
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:673 (112), effective:222 (37)

initing FirstDep: 0m 0.000sec


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

iterations count:126 (21), effective:72 (12)

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

iterations count:236 (39), effective:89 (14)

iterations count:56 (9), effective:25 (4)

iterations count:56 (9), effective:25 (4)

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

iterations count:56 (9), effective:25 (4)

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:276 (46), effective:91 (15)

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

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

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

iterations count:276 (46), effective:91 (15)

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

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

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

iterations count:276 (46), effective:91 (15)

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

iterations count:336 (56), effective:125 (20)

iterations count:336 (56), effective:125 (20)

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

iterations count:336 (56), effective:125 (20)

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

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

iterations count:378 (63), effective:113 (18)

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

iterations count:38 (6), effective:16 (2)

iterations count:71 (11), effective:39 (6)

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

iterations count:31 (5), effective:15 (2)

iterations count:360 (60), effective:142 (23)

iterations count:136 (22), effective:58 (9)

iterations count:116 (19), effective:29 (4)

iterations count:835 (139), effective:252 (42)

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-nC00050vD"
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-nC00050vD, 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-167912692500817"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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