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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 15K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:45 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-nC00004vN-ReachabilityCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679868164597

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00004vN
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: TwoPhaseLocking_PT_nC00004vN
(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 3.304sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 66 (6.6e+01) #states 45



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

checking: EF [haveB<=2]
normalized: E [true U haveB<=2]

abstracting: (haveB<=2)
states: 42
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [haveB<=4]
normalized: E [true U haveB<=4]

abstracting: (haveB<=4)
states: 45
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [haveA<=3]]
normalized: E [true U ~ [haveA<=3]]

abstracting: (haveA<=3)
states: 45
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [haveAandB<=resB]
normalized: ~ [E [true U ~ [haveAandB<=resB]]]

abstracting: (haveAandB<=resB)
states: 39
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[resB<=4 | ~ [[1<=haveA2 & 4<=haveB]]]]
normalized: ~ [E [true U ~ [[~ [[1<=haveA2 & 4<=haveB]] | resB<=4]]]]

abstracting: (resB<=4)
states: 45
abstracting: (4<=haveB)
states: 0
abstracting: (1<=haveA2)
states: 16
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (haveA2<=4)
states: 45
abstracting: (haveA2andB<=resB)
states: 39
abstracting: (2<=resA)
states: 4
abstracting: (1<=resB)
states: 33
abstracting: (haveA2andB<=3)
states: 45
abstracting: (4<=haveA)
states: 0
abstracting: (2<=resA)
states: 4
abstracting: (haveA<=1)
states: 42
abstracting: (4<=haveAandB)
states: 0
abstracting: (resA<=haveA2)
states: 31
abstracting: (haveA2<=3)
states: 45
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (haveB<=2)
states: 42
abstracting: (2<=haveA2andB)
states: 2
abstracting: (haveAandB<=resA)
states: 35
abstracting: (haveA2andB<=haveB)
states: 39
abstracting: (2<=haveA)
states: 3
abstracting: (1<=Clients)
states: 36
abstracting: (haveA<=1)
states: 42
abstracting: (haveAandB<=4)
states: 45
abstracting: (2<=haveA2)
states: 3
abstracting: (Clients<=4)
states: 45
abstracting: (haveA2<=haveA2andB)
states: 32
abstracting: (haveA<=1)
states: 42
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=resB)
states: 18
abstracting: (haveB<=1)
states: 30
abstracting: (haveA2andB<=4)
states: 45
abstracting: (resA<=resA)
states: 45
abstracting: (resB<=haveA2)
states: 18
abstracting: (1<=Clients)
states: 36
abstracting: (Clients<=2)
states: 39
abstracting: (resA<=0)
states: 27
abstracting: (haveA2andB<=haveA2)
states: 35
abstracting: (resB<=resA)
states: 18
abstracting: (haveAandB<=3)
states: 45
abstracting: (Clients<=resA)
states: 15
abstracting: (2<=Clients)
states: 21
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (haveA2andB<=1)
states: 43
abstracting: (Clients<=haveAandB)
states: 15
abstracting: (Clients<=3)
states: 44
abstracting: (2<=haveB)
states: 15
abstracting: (haveA2<=Clients)
states: 39
abstracting: (resB<=haveAandB)
states: 17
abstracting: (resB<=haveA2andB)
states: 17
abstracting: (haveA<=haveA2)
states: 32
abstracting: (resB<=4)
states: 45
abstracting: (resA<=resB)
states: 39
abstracting: (haveA2andB<=3)
states: 45
abstracting: (3<=haveA2andB)
states: 0
abstracting: (haveAandB<=1)
states: 43
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

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

abstracting: (haveB<=haveAandB)
states: 20
abstracting: (Clients<=haveB)
states: 25
abstracting: (resA<=haveA)
states: 31
abstracting: (Clients<=2)
states: 39
abstracting: (1<=Clients)
states: 36
abstracting: (haveA2<=Clients)
states: 39
abstracting: (resA<=3)
states: 45
abstracting: (1<=haveA2)
states: 16
abstracting: (resA<=haveAandB)
states: 30
abstracting: (resA<=2)
states: 45
abstracting: (haveA<=resA)
states: 33
abstracting: (haveA<=4)
states: 45
abstracting: (3<=haveA2andB)
states: 0
abstracting: (3<=haveB)
states: 3
abstracting: (haveA2andB<=0)
states: 32
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (haveA2andB<=0)
states: 32
abstracting: (4<=haveA2andB)
states: 0
abstracting: (resA<=4)
states: 45
abstracting: (haveA2andB<=3)
states: 45
abstracting: (haveA2<=haveAandB)
states: 32
abstracting: (Clients<=1)
states: 24
abstracting: (haveA2<=Clients)
states: 39
abstracting: (2<=haveA)
states: 3
abstracting: (haveA2andB<=haveAandB)
states: 34
abstracting: (haveA<=3)
states: 45
abstracting: (Clients<=2)
states: 39
abstracting: (resB<=3)
states: 45
abstracting: (haveAandB<=2)
states: 45
abstracting: (1<=Clients)
states: 36
abstracting: (2<=haveA)
states: 3
abstracting: (3<=haveA2)
states: 0
abstracting: (haveA2<=haveB)
states: 39
abstracting: (haveAandB<=haveB)
states: 39
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=haveA2)
states: 0
abstracting: (haveA2<=resA)
states: 33
abstracting: (haveA2andB<=1)
states: 43
abstracting: (haveA<=0)
states: 29
abstracting: (4<=haveA2andB)
states: 0
abstracting: (4<=Clients)
states: 1
abstracting: (3<=haveA2andB)
states: 0
abstracting: (resA<=Clients)
states: 42
abstracting: (2<=Clients)
states: 21
abstracting: (4<=haveB)
states: 0
abstracting: (haveB<=Clients)
states: 31
abstracting: (resB<=haveB)
states: 24
abstracting: (haveA2<=haveB)
states: 39
abstracting: (haveA<=1)
states: 42
abstracting: (1<=haveB)
states: 30
abstracting: (Clients<=haveB)
states: 25
abstracting: (haveA2andB<=haveB)
states: 39
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (haveA<=3)
states: 45
abstracting: (haveAandB<=resA)
states: 35
abstracting: (haveA2andB<=haveA)
states: 35
abstracting: (Clients<=haveA)
states: 15
abstracting: (resA<=resB)
states: 39
abstracting: (3<=haveA2andB)
states: 0
abstracting: (resA<=haveA2andB)
states: 30
abstracting: (haveAandB<=3)
states: 45
abstracting: (haveA<=2)
states: 45
abstracting: (haveAandB<=0)
states: 32
abstracting: (haveAandB<=1)
states: 43
abstracting: (Clients<=3)
states: 44
abstracting: (resA<=Clients)
states: 42
abstracting: (1<=haveA)
states: 16
abstracting: (haveA2<=4)
states: 45
abstracting: (Clients<=2)
states: 39
abstracting: (3<=haveA2)
states: 0
abstracting: (3<=haveA2andB)
states: 0
abstracting: (haveA2andB<=resB)
states: 39
abstracting: (Clients<=1)
states: 24
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (4<=resB)
states: 0
abstracting: (haveAandB<=2)
states: 45
abstracting: (haveB<=haveA2andB)
states: 20
abstracting: (resA<=resB)
states: 39
abstracting: (haveA2andB<=1)
states: 43
abstracting: (resA<=haveAandB)
states: 30
abstracting: (Clients<=3)
states: 44
abstracting: (haveB<=haveA)
states: 21
abstracting: (2<=haveAandB)
states: 2
abstracting: (haveA<=Clients)
states: 39
abstracting: (Clients<=0)
states: 9
abstracting: (haveB<=4)
states: 45
abstracting: (haveA2andB<=2)
states: 45
abstracting: (haveA2andB<=3)
states: 45
abstracting: (haveAandB<=4)
states: 45
abstracting: (4<=haveA)
states: 0
abstracting: (haveB<=haveA)
states: 21
abstracting: (resB<=2)
states: 39
abstracting: (2<=haveAandB)
states: 2
abstracting: (4<=haveA2)
states: 0
abstracting: (2<=Clients)
states: 21
abstracting: (haveA2andB<=4)
states: 45
abstracting: (1<=haveB)
states: 30
abstracting: (4<=haveB)
states: 0
abstracting: (3<=haveA2andB)
states: 0
abstracting: (2<=resB)
states: 18
abstracting: (resB<=haveA)
states: 18
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (3<=haveA2)
states: 0
abstracting: (1<=resA)
states: 18
abstracting: (haveA2<=haveB)
states: 39
abstracting: (4<=haveA2)
states: 0
abstracting: (haveA<=resA)
states: 33
abstracting: (haveB<=4)
states: 45
abstracting: (2<=resB)
states: 18
abstracting: (3<=haveAandB)
states: 0
abstracting: (haveAandB<=4)
states: 45
abstracting: (resB<=0)
states: 12
abstracting: (1<=haveB)
states: 30
abstracting: (resA<=0)
states: 27
abstracting: (4<=haveB)
states: 0
abstracting: (4<=haveA2andB)
states: 0
abstracting: (2<=resB)
states: 18
abstracting: (3<=haveA2)
states: 0
abstracting: (3<=haveAandB)
states: 0
abstracting: (haveB<=resB)
states: 27
abstracting: (2<=resB)
states: 18
abstracting: (haveB<=0)
states: 15
abstracting: (haveA2andB<=resA)
states: 35
abstracting: (2<=resB)
states: 18
abstracting: (haveB<=Clients)
states: 31
abstracting: (2<=haveA)
states: 3
abstracting: (1<=haveAandB)
states: 13
abstracting: (resA<=haveB)
states: 39
abstracting: (haveA<=resA)
states: 33
abstracting: (haveA2<=3)
states: 45
abstracting: (haveA2andB<=3)
states: 45
abstracting: (Clients<=4)
states: 45
abstracting: (1<=haveAandB)
states: 13
abstracting: (Clients<=haveA2andB)
states: 15
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (haveA<=1)
states: 42
abstracting: (2<=haveA2andB)
states: 2
abstracting: (resB<=resA)
states: 18
abstracting: (haveB<=0)
states: 15
abstracting: (Clients<=haveA)
states: 15
abstracting: (haveB<=haveB)
states: 45
abstracting: (Clients<=haveB)
states: 25
abstracting: (Clients<=haveB)
states: 25
abstracting: (1<=Clients)
states: 36
abstracting: (Clients<=resA)
states: 15
abstracting: (haveA2<=Clients)
states: 39
abstracting: (Clients<=4)
states: 45
abstracting: (haveA2<=4)
states: 45
abstracting: (Clients<=haveA)
states: 15
abstracting: (haveA<=resA)
states: 33
abstracting: (haveA2andB<=4)
states: 45
abstracting: (haveAandB<=haveA)
states: 35
abstracting: (2<=haveA2andB)
states: 2
abstracting: (resB<=haveA2andB)
states: 17
abstracting: (haveB<=haveA2)
states: 21
abstracting: (haveAandB<=1)
states: 43
abstracting: (haveAandB<=haveA2andB)
states: 34
abstracting: (resA<=2)
states: 45
abstracting: (1<=haveB)
states: 30
abstracting: (haveA2<=4)
states: 45
abstracting: (resB<=resA)
states: 18
abstracting: (4<=Clients)
states: 1
abstracting: (haveA<=resA)
states: 33
abstracting: (haveA<=haveAandB)
states: 32
abstracting: (3<=haveA)
states: 0
abstracting: (1<=Clients)
states: 36
abstracting: (Clients<=Clients)
states: 45
abstracting: (haveA2<=4)
states: 45
abstracting: (haveAandB<=0)
states: 32
abstracting: (haveA2andB<=haveA2)
states: 35
abstracting: (Clients<=haveA2)
states: 15
abstracting: (3<=haveB)
states: 3
abstracting: (haveA<=haveAandB)
states: 32
abstracting: (resB<=2)
states: 39
abstracting: (2<=haveAandB)
states: 2
abstracting: (Clients<=4)
states: 45
abstracting: (haveB<=haveA2)
states: 21
abstracting: (haveA<=haveA)
states: 45
abstracting: (haveB<=haveAandB)
states: 20
abstracting: (3<=haveA)
states: 0
abstracting: (2<=Clients)
states: 21
abstracting: (4<=haveAandB)
states: 0
abstracting: (4<=haveB)
states: 0
abstracting: (3<=resA)
states: 0
abstracting: (Clients<=haveB)
states: 25
abstracting: (1<=resB)
states: 33
abstracting: (4<=haveA2andB)
states: 0
abstracting: (haveA2andB<=haveA)
states: 35
abstracting: (haveA2andB<=3)
states: 45
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 1286 (1.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1240 1530 2770
used/not used/entry size/cache size: 1780 67107084 16 1024MB
basic ops cache: hits/miss/sum: 2390 5094 7484
used/not used/entry size/cache size: 7766 16769450 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: 747 488 1235
used/not used/entry size/cache size: 488 8388120 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 67107712
1 1101
2 17
3 10
4 9
5 9
6 3
7 2
8 1
9 0
>= 10 0

Total processing time: 0m 5.158sec


BK_STOP 1679868169815

--------------------
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:56 (9), effective:16 (2)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:48 (8), effective:15 (2)

iterations count:55 (9), effective:16 (2)

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

iterations count:61 (10), effective:16 (2)

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

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

iterations count:6 (1), effective:0 (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-nC00004vN"
export BK_EXAMINATION="ReachabilityCardinality"
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-nC00004vN, examination is ReachabilityCardinality"
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-167912692400782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00004vN.tgz
mv TwoPhaseLocking-PT-nC00004vN execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;