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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 17:31 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-nC00100vD-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vD-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868459730

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-nC00100vD
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_nC00100vD
(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.827sec


RS generation: 0m 2.495sec


-> reachability set: #nodes 75582 (7.6e+04) #states 9,803,780 (6)



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

checking: ~ [EF [~ [10<=resA]]]
normalized: ~ [E [true U ~ [10<=resA]]]

abstracting: (10<=resA)
states: 4,751,285 (6)
-> the formula is FALSE

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

MC time: 0m 0.576sec

checking: AF [EF [AG [[90<=haveA2andB & 12<=haveB]]]]
normalized: ~ [EG [~ [E [true U ~ [E [true U ~ [[90<=haveA2andB & 12<=haveB]]]]]]]]

abstracting: (12<=haveB)
states: 6,053,813 (6)
abstracting: (90<=haveA2andB)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[EF [AX [E [21<=haveA2 U 7<=haveA2andB]]] & [EG [haveA2<=32] & AF [AG [EF [haveAandB<=71]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [E [true U ~ [E [true U haveAandB<=71]]]]] & EG [haveA2<=32]] & E [true U ~ [EX [~ [E [21<=haveA2 U 7<=haveA2andB]]]]]]]]]

abstracting: (7<=haveA2andB)
states: 4,780,182 (6)
abstracting: (21<=haveA2)
states: 1,612,247 (6)
.abstracting: (haveA2<=32)
states: 9,539,244 (6)
.
EG iterations: 1
abstracting: (haveAandB<=71)
states: 9,803,780 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.158sec

checking: EF [[Clients<=resA & EF [[haveB<=haveA | EX [~ [resB<=45]]]]]]
normalized: E [true U [Clients<=resA & E [true U [haveB<=haveA | EX [~ [resB<=45]]]]]]

abstracting: (resB<=45)
states: 9,760,877 (6)
.abstracting: (haveB<=haveA)
states: 3,478,761 (6)
abstracting: (Clients<=resA)
states: 1,325 (3)
-> the formula is TRUE

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

MC time: 0m 4.100sec

checking: EF [~ [[haveB<=haveB & EF [~ [[AG [resA<=76] & [resA<=31 | 22<=haveB]]]]]]]
normalized: E [true U ~ [[haveB<=haveB & E [true U ~ [[[resA<=31 | 22<=haveB] & ~ [E [true U ~ [resA<=76]]]]]]]]]

abstracting: (resA<=76)
states: 9,803,780 (6)
abstracting: (22<=haveB)
states: 3,260,672 (6)
abstracting: (resA<=31)
states: 9,483,383 (6)
abstracting: (haveB<=haveB)
states: 9,803,780 (6)
-> the formula is TRUE

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

MC time: 0m 1.811sec

checking: EF [~ [[haveA2<=87 & ~ [[[Clients<=10 | Clients<=haveA] & EG [58<=haveA2andB]]]]]]
normalized: E [true U ~ [[haveA2<=87 & ~ [[EG [58<=haveA2andB] & [Clients<=10 | Clients<=haveA]]]]]]

abstracting: (Clients<=haveA)
states: 498,770 (5)
abstracting: (Clients<=10)
states: 45,044 (4)
abstracting: (58<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (haveA2<=87)
states: 9,803,780 (6)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.634sec

checking: AF [~ [AG [[A [resB<=35 U AX [93<=haveA2andB]] | E [[resA<=61 | resB<=70] U [39<=haveA2 | haveA<=resA]]]]]]
normalized: ~ [EG [~ [E [true U ~ [[E [[resA<=61 | resB<=70] U [39<=haveA2 | haveA<=resA]] | [~ [EG [EX [~ [93<=haveA2andB]]]] & ~ [E [EX [~ [93<=haveA2andB]] U [~ [resB<=35] & EX [~ [93<=haveA2andB]]]]]]]]]]]]

abstracting: (93<=haveA2andB)
states: 0
.abstracting: (resB<=35)
states: 9,126,296 (6)
abstracting: (93<=haveA2andB)
states: 0
.abstracting: (93<=haveA2andB)
states: 0
..
EG iterations: 1
abstracting: (haveA<=resA)
states: 5,057,090 (6)
abstracting: (39<=haveA2)
states: 63,608 (4)
abstracting: (resB<=70)
states: 9,803,780 (6)
abstracting: (resA<=61)
states: 9,803,780 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.096sec

checking: EF [AG [[[[[~ [haveA2<=haveB] | EX [resA<=resA]] | haveA2andB<=haveB] | ~ [AF [haveB<=72]]] | Clients<=14]]]
normalized: E [true U ~ [E [true U ~ [[Clients<=14 | [[haveA2andB<=haveB | [~ [haveA2<=haveB] | EX [resA<=resA]]] | EG [~ [haveB<=72]]]]]]]]

abstracting: (haveB<=72)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (resA<=resA)
states: 9,803,780 (6)
.abstracting: (haveA2<=haveB)
states: 6,641,270 (6)
abstracting: (haveA2andB<=haveB)
states: 7,054,865 (6)
abstracting: (Clients<=14)
states: 130,355 (5)
-> the formula is TRUE

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

MC time: 0m 0.394sec

checking: E [haveB<=haveB U AX [[[AF [EG [45<=haveAandB]] & [EX [12<=Clients] & haveA<=resA]] | AG [~ [[Clients<=32 | haveB<=15]]]]]]
normalized: E [haveB<=haveB U ~ [EX [~ [[~ [E [true U [Clients<=32 | haveB<=15]]] | [[haveA<=resA & EX [12<=Clients]] & ~ [EG [~ [EG [45<=haveAandB]]]]]]]]]]

abstracting: (45<=haveAandB)
states: 504
..
EG iterations: 2
.
EG iterations: 1
abstracting: (12<=Clients)
states: 9,743,175 (6)
.abstracting: (haveA<=resA)
states: 5,057,090 (6)
abstracting: (haveB<=15)
states: 4,929,660 (6)
abstracting: (Clients<=32)
states: 1,873,178 (6)
.abstracting: (haveB<=haveB)
states: 9,803,780 (6)
-> the formula is TRUE

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

MC time: 0m 0.399sec

checking: AF [AG [[[A [[haveA2andB<=haveB & haveA<=22] U haveB<=88] & AF [haveA2<=95]] | [AF [AF [haveAandB<=haveAandB]] | A [~ [haveB<=63] U AF [36<=Clients]]]]]]
normalized: ~ [EG [E [true U ~ [[[[~ [EG [EG [~ [36<=Clients]]]] & ~ [E [EG [~ [36<=Clients]] U [haveB<=63 & EG [~ [36<=Clients]]]]]] | ~ [EG [EG [~ [haveAandB<=haveAandB]]]]] | [~ [EG [~ [haveA2<=95]]] & [~ [EG [~ [haveB<=88]]] & ~ [E [~ [haveB<=88] U [~ [[haveA2andB<=haveB & haveA<=22]] & ~ [haveB<=88]]]]]]]]]]]

abstracting: (haveB<=88)
states: 9,803,780 (6)
abstracting: (haveA<=22)
states: 8,538,887 (6)
abstracting: (haveA2andB<=haveB)
states: 7,054,865 (6)
abstracting: (haveB<=88)
states: 9,803,780 (6)
abstracting: (haveB<=88)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (haveA2<=95)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (haveAandB<=haveAandB)
states: 9,803,780 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (36<=Clients)
states: 7,336,251 (6)
.....................................
EG iterations: 37
abstracting: (haveB<=63)
states: 9,803,780 (6)
abstracting: (36<=Clients)
states: 7,336,251 (6)
.....................................
EG iterations: 37
abstracting: (36<=Clients)
states: 7,336,251 (6)
.....................................
EG iterations: 37
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.246sec

checking: AG [~ [AG [[[~ [resA<=25] & A [4<=haveA2andB U 66<=haveA2]] & [[AG [54<=haveB] | [16<=resA & haveAandB<=haveA2]] | haveAandB<=Clients]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[[haveAandB<=Clients | [[16<=resA & haveAandB<=haveA2] | ~ [E [true U ~ [54<=haveB]]]]] & [[~ [EG [~ [66<=haveA2]]] & ~ [E [~ [66<=haveA2] U [~ [4<=haveA2andB] & ~ [66<=haveA2]]]]] & ~ [resA<=25]]]]]]]]

abstracting: (resA<=25)
states: 8,956,115 (6)
abstracting: (66<=haveA2)
states: 0
abstracting: (4<=haveA2andB)
states: 6,586,580 (6)
abstracting: (66<=haveA2)
states: 0
abstracting: (66<=haveA2)
states: 0

EG iterations: 0
abstracting: (54<=haveB)
states: 0
abstracting: (haveAandB<=haveA2)
states: 5,925,230 (6)
abstracting: (16<=resA)
states: 2,760,681 (6)
abstracting: (haveAandB<=Clients)
states: 9,803,780 (6)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.071sec

checking: ~ [[[EX [~ [EF [Clients<=resA]]] & EF [AG [[A [haveB<=haveA U resA<=94] | AX [haveA<=48]]]]] | ~ [EG [[79<=resB | [haveA<=haveA | haveA2andB<=74]]]]]]
normalized: ~ [[~ [EG [[79<=resB | [haveA<=haveA | haveA2andB<=74]]]] | [E [true U ~ [E [true U ~ [[~ [EX [~ [haveA<=48]]] | [~ [EG [~ [resA<=94]]] & ~ [E [~ [resA<=94] U [~ [haveB<=haveA] & ~ [resA<=94]]]]]]]]]] & EX [~ [E [true U Clients<=resA]]]]]]

abstracting: (Clients<=resA)
states: 1,325 (3)
.abstracting: (resA<=94)
states: 9,803,780 (6)
abstracting: (haveB<=haveA)
states: 3,478,761 (6)
abstracting: (resA<=94)
states: 9,803,780 (6)
abstracting: (resA<=94)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (haveA<=48)
states: 9,803,527 (6)
.abstracting: (haveA2andB<=74)
states: 9,803,780 (6)
abstracting: (haveA<=haveA)
states: 9,803,780 (6)
abstracting: (79<=resB)
states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.517sec

checking: A [[resB<=61 & [[AG [~ [E [haveA<=83 U haveAandB<=Clients]]] & [EF [haveB<=88] & [haveB<=92 | EX [resB<=27]]]] & AX [[[AG [resB<=resB] & ~ [12<=Clients]] & EG [74<=haveA2]]]]] U AF [AG [AF [[resB<=haveA | haveA2<=resB]]]]]
normalized: [~ [EG [EG [E [true U EG [~ [[resB<=haveA | haveA2<=resB]]]]]]] & ~ [E [EG [E [true U EG [~ [[resB<=haveA | haveA2<=resB]]]]] U [~ [[resB<=61 & [~ [EX [~ [[EG [74<=haveA2] & [~ [12<=Clients] & ~ [E [true U ~ [resB<=resB]]]]]]]] & [[[haveB<=92 | EX [resB<=27]] & E [true U haveB<=88]] & ~ [E [true U E [haveA<=83 U haveAandB<=Clients]]]]]]] & EG [E [true U EG [~ [[resB<=haveA | haveA2<=resB]]]]]]]]]

abstracting: (haveA2<=resB)
states: 6,641,271 (6)
abstracting: (resB<=haveA)
states: 3,478,760 (6)
..................................................
EG iterations: 50
.
EG iterations: 1
abstracting: (haveAandB<=Clients)
states: 9,803,780 (6)
abstracting: (haveA<=83)
states: 9,803,780 (6)
abstracting: (haveB<=88)
states: 9,803,780 (6)
abstracting: (resB<=27)
states: 7,884,890 (6)
.abstracting: (haveB<=92)
states: 9,803,780 (6)
abstracting: (resB<=resB)
states: 9,803,780 (6)
abstracting: (12<=Clients)
states: 9,743,175 (6)
abstracting: (74<=haveA2)
states: 0
.
EG iterations: 1
.abstracting: (resB<=61)
states: 9,803,780 (6)
abstracting: (haveA2<=resB)
states: 6,641,271 (6)
abstracting: (resB<=haveA)
states: 3,478,760 (6)
..................................................
EG iterations: 50
.
EG iterations: 1
abstracting: (haveA2<=resB)
states: 6,641,271 (6)
abstracting: (resB<=haveA)
states: 3,478,760 (6)
..................................................
EG iterations: 50
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.037sec

checking: AG [[[AX [AX [EF [haveA2andB<=haveAandB]]] & [[54<=haveA2andB | [[18<=haveA2 & ~ [40<=haveAandB]] | 32<=resB]] & [haveA2andB<=resA & haveA2<=66]]] | [AG [[~ [[haveA<=3 & resA<=resA]] | [[resB<=resA | 95<=haveB] & AG [haveB<=87]]]] | haveAandB<=haveA]]]
normalized: ~ [E [true U ~ [[[haveAandB<=haveA | ~ [E [true U ~ [[[~ [E [true U ~ [haveB<=87]]] & [resB<=resA | 95<=haveB]] | ~ [[haveA<=3 & resA<=resA]]]]]]] | [[[haveA2andB<=resA & haveA2<=66] & [54<=haveA2andB | [32<=resB | [18<=haveA2 & ~ [40<=haveAandB]]]]] & ~ [EX [EX [~ [E [true U haveA2andB<=haveAandB]]]]]]]]]]

abstracting: (haveA2andB<=haveAandB)
states: 5,136,065 (6)
..abstracting: (40<=haveAandB)
states: 7,007 (3)
abstracting: (18<=haveA2)
states: 2,250,170 (6)
abstracting: (32<=resB)
states: 1,214,157 (6)
abstracting: (54<=haveA2andB)
states: 0
abstracting: (haveA2<=66)
states: 9,803,780 (6)
abstracting: (haveA2andB<=resA)
states: 5,925,230 (6)
abstracting: (resA<=resA)
states: 9,803,780 (6)
abstracting: (haveA<=3)
states: 2,296,000 (6)
abstracting: (95<=haveB)
states: 0
abstracting: (resB<=resA)
states: 3,478,760 (6)
abstracting: (haveB<=87)
states: 9,803,780 (6)
abstracting: (haveAandB<=haveA)
states: 5,925,230 (6)
-> the formula is FALSE

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

MC time: 0m10.776sec

checking: [~ [EF [E [[[EX [15<=haveB] | A [haveAandB<=haveB U resA<=97]] & E [56<=resA U 73<=resB]] U [AF [resB<=70] & ~ [[haveAandB<=20 | haveA2andB<=Clients]]]]]] & AG [[AG [[[resA<=86 & ~ [Clients<=haveB]] | AX [haveA2andB<=haveB]]] & [[EF [[haveA2<=100 & 10<=resA]] | [resB<=43 | ~ [EX [haveA2andB<=haveA2andB]]]] | EG [~ [40<=haveA2andB]]]]]]
normalized: [~ [E [true U ~ [[[EG [~ [40<=haveA2andB]] | [[resB<=43 | ~ [EX [haveA2andB<=haveA2andB]]] | E [true U [haveA2<=100 & 10<=resA]]]] & ~ [E [true U ~ [[~ [EX [~ [haveA2andB<=haveB]]] | [resA<=86 & ~ [Clients<=haveB]]]]]]]]]] & ~ [E [true U E [[E [56<=resA U 73<=resB] & [[~ [EG [~ [resA<=97]]] & ~ [E [~ [resA<=97] U [~ [haveAandB<=haveB] & ~ [resA<=97]]]]] | EX [15<=haveB]]] U [~ [[haveAandB<=20 | haveA2andB<=Clients]] & ~ [EG [~ [resB<=70]]]]]]]]

abstracting: (resB<=70)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (haveA2andB<=Clients)
states: 9,803,780 (6)
abstracting: (haveAandB<=20)
states: 9,050,852 (6)
abstracting: (15<=haveB)
states: 5,162,831 (6)
.abstracting: (resA<=97)
states: 9,803,780 (6)
abstracting: (haveAandB<=haveB)
states: 7,054,865 (6)
abstracting: (resA<=97)
states: 9,803,780 (6)
abstracting: (resA<=97)
states: 9,803,780 (6)
.
EG iterations: 1
abstracting: (73<=resB)
states: 0
abstracting: (56<=resA)
states: 0
abstracting: (Clients<=haveB)
states: 1,366,910 (6)
abstracting: (resA<=86)
states: 9,803,780 (6)
abstracting: (haveA2andB<=haveB)
states: 7,054,865 (6)
.abstracting: (10<=resA)
states: 4,751,285 (6)
abstracting: (haveA2<=100)
states: 9,803,780 (6)
abstracting: (haveA2andB<=haveA2andB)
states: 9,803,780 (6)
.abstracting: (resB<=43)
states: 9,704,870 (6)
abstracting: (40<=haveA2andB)
states: 7,007 (3)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 3.835sec

checking: AG [[[[96<=haveAandB | AF [haveB<=haveAandB]] & AG [EX [16<=haveAandB]]] | [~ [[[EG [resA<=haveA] & AF [haveA<=7]] & EF [haveAandB<=98]]] & [EG [[~ [haveB<=resB] | [haveA2<=resA | haveAandB<=haveA2andB]]] & E [[[haveA2andB<=11 & haveAandB<=70] & EG [77<=haveAandB]] U [[resB<=haveA2andB | resA<=63] | 50<=haveA2]]]]]]
normalized: ~ [E [true U ~ [[[[E [[EG [77<=haveAandB] & [haveA2andB<=11 & haveAandB<=70]] U [50<=haveA2 | [resB<=haveA2andB | resA<=63]]] & EG [[[haveA2<=resA | haveAandB<=haveA2andB] | ~ [haveB<=resB]]]] & ~ [[E [true U haveAandB<=98] & [~ [EG [~ [haveA<=7]]] & EG [resA<=haveA]]]]] | [~ [E [true U ~ [EX [16<=haveAandB]]]] & [96<=haveAandB | ~ [EG [~ [haveB<=haveAandB]]]]]]]]]

abstracting: (haveB<=haveAandB)
states: 3,024,216 (6)
.......................................................................................................................................................
EG iterations: 151
abstracting: (96<=haveAandB)
states: 0
abstracting: (16<=haveAandB)
states: 1,579,641 (6)
.abstracting: (resA<=haveA)
states: 5,057,090 (6)
....................................................
EG iterations: 52
abstracting: (haveA<=7)
states: 4,222,853 (6)
.
EG iterations: 1
abstracting: (haveAandB<=98)
states: 9,803,780 (6)
abstracting: (haveB<=resB)
states: 4,981,041 (6)
abstracting: (haveAandB<=haveA2andB)
states: 5,136,065 (6)
abstracting: (haveA2<=resA)
states: 5,057,091 (6)
.
EG iterations: 1
abstracting: (resA<=63)
states: 9,803,780 (6)
abstracting: (resB<=haveA2andB)
states: 3,024,215 (6)
abstracting: (50<=haveA2)
states: 50
abstracting: (haveAandB<=70)
states: 9,803,780 (6)
abstracting: (haveA2andB<=11)
states: 7,139,846 (6)
abstracting: (77<=haveAandB)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vD-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.538sec

totally nodes used: 5859604 (5.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 131121427 17122778 148244205
used/not used/entry size/cache size: 18565340 48543524 16 1024MB
basic ops cache: hits/miss/sum: 52182485 25716313 77898798
used/not used/entry size/cache size: 13654375 3122841 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: 5055543 1694654 6750197
used/not used/entry size/cache size: 1463597 6925011 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 61895669
1 4905396
2 245453
3 26638
4 6769
5 3799
6 3427
7 2981
8 3340
9 2307
>= 10 13085

Total processing time: 1m18.153sec


BK_STOP 1679868537939

--------------------
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:1348 (224), effective:447 (74)

initing FirstDep: 0m 0.000sec


iterations count:88 (14), effective:41 (6)

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

iterations count:247 (41), effective:77 (12)

iterations count:604 (100), effective:235 (39)

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

iterations count:759 (126), effective:229 (38)

iterations count:204 (34), effective:99 (16)

iterations count:706 (117), effective:250 (41)

iterations count:1344 (224), effective:406 (67)

iterations count:904 (150), effective:349 (58)

iterations count:757 (126), effective:214 (35)

iterations count:776 (129), effective:273 (45)

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

iterations count:134 (22), effective:60 (10)

iterations count:1085 (180), effective:425 (70)

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

iterations count:194 (32), effective:47 (7)

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

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

iterations count:706 (117), effective:250 (41)

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

iterations count:1116 (186), effective:378 (63)

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

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

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

iterations count:1116 (186), effective:378 (63)

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

iterations count:1116 (186), effective:378 (63)

iterations count:231 (38), effective:100 (16)

iterations count:950 (158), effective:308 (51)

iterations count:649 (108), effective:231 (38)

iterations count:295 (49), effective:89 (14)

iterations count:313 (52), effective:103 (17)

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

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

iterations count:676 (112), effective:244 (40)

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

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