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.r353-smll-167891800500113.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 RwMutex-PT-r0010w0020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800500113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.7K Feb 25 22:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 22:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 22:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 RwMutex-PT-r0010w0020-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679851147227

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=RwMutex-PT-r0010w0020
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: RwMutex_PT_r0010w0020
(NrP: 70 NrTr: 60 NrArc: 540)

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

net check time: 0m 0.000sec

init dd package: 0m 3.541sec


RS generation: 0m 0.064sec


-> reachability set: #nodes 9897 (9.9e+03) #states 1,044 (3)



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

checking: EX [1<=p24]
normalized: EX [1<=p24]

abstracting: (1<=p24)
states: 1,043 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: E [1<=p22 U 1<=p16]
normalized: E [1<=p22 U 1<=p16]

abstracting: (1<=p16)
states: 1,043 (3)
abstracting: (1<=p22)
states: 1,043 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [~ [AX [1<=p31]] | ~ [AF [[~ [EG [~ [p59<=0]]] & p23<=p59]]]]
normalized: [EG [~ [[p23<=p59 & ~ [EG [~ [p59<=0]]]]]] | EX [~ [1<=p31]]]

abstracting: (1<=p31)
states: 1,043 (3)
.abstracting: (p59<=0)
states: 1,043 (3)
..
EG iterations: 2
abstracting: (p23<=p59)
states: 2
.
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [~ [AG [~ [[~ [E [p43<=p29 U 1<=p55]] & EG [p3<=0]]]]]]
normalized: EG [E [true U [EG [p3<=0] & ~ [E [p43<=p29 U 1<=p55]]]]]

abstracting: (1<=p55)
states: 1
abstracting: (p43<=p29)
states: 1,044 (3)
abstracting: (p3<=0)
states: 512
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: A [EF [~ [[p28<=p60 | AG [[1<=p56 & 1<=p5]]]]] U p4<=0]
normalized: [~ [EG [~ [p4<=0]]] & ~ [E [~ [p4<=0] U [~ [E [true U ~ [[p28<=p60 | ~ [E [true U ~ [[1<=p56 & 1<=p5]]]]]]]] & ~ [p4<=0]]]]]

abstracting: (p4<=0)
states: 512
abstracting: (1<=p5)
states: 532
abstracting: (1<=p56)
states: 1
abstracting: (p28<=p60)
states: 2
abstracting: (p4<=0)
states: 512
abstracting: (p4<=0)
states: 512
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EX [EF [~ [E [p32<=p13 U A [p69<=p36 U 1<=p61]]]]]
normalized: EX [E [true U ~ [E [p32<=p13 U [~ [EG [~ [1<=p61]]] & ~ [E [~ [1<=p61] U [~ [p69<=p36] & ~ [1<=p61]]]]]]]]]

abstracting: (1<=p61)
states: 1
abstracting: (p69<=p36)
states: 1,043 (3)
abstracting: (1<=p61)
states: 1
abstracting: (1<=p61)
states: 1
.
EG iterations: 1
abstracting: (p32<=p13)
states: 1,044 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [A [[~ [EF [AF [p58<=1]]] | AF [AF [1<=p38]]] U EG [~ [[EF [p19<=p29] & EF [p2<=p32]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EG [~ [[E [true U p2<=p32] & E [true U p19<=p29]]]]]]] & ~ [E [~ [EG [~ [[E [true U p2<=p32] & E [true U p19<=p29]]]]] U [~ [[~ [EG [EG [~ [1<=p38]]]] | ~ [E [true U ~ [EG [~ [p58<=1]]]]]]] & ~ [EG [~ [[E [true U p2<=p32] & E [true U p19<=p29]]]]]]]]]]]]

abstracting: (p19<=p29)
states: 1,043 (3)
abstracting: (p2<=p32)
states: 512
.
EG iterations: 1
abstracting: (p58<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (1<=p38)
states: 512
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p19<=p29)
states: 1,043 (3)
abstracting: (p2<=p32)
states: 512
.
EG iterations: 1
abstracting: (p19<=p29)
states: 1,043 (3)
abstracting: (p2<=p32)
states: 512
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: ~ [A [p40<=p27 U A [EF [p25<=p34] U [1<=p27 & [[AG [1<=p41] | AX [1<=p51]] | 1<=p14]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]] & ~ [E [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]] U [~ [E [true U p25<=p34]] & ~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]] & ~ [E [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]] U [~ [E [true U p25<=p34]] & ~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]]]]] U [~ [p40<=p27] & ~ [[~ [EG [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]] & ~ [E [~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]] U [~ [E [true U p25<=p34]] & ~ [[1<=p27 & [1<=p14 | [~ [EX [~ [1<=p51]]] | ~ [E [true U ~ [1<=p41]]]]]]]]]]]]]]]]]

abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (p25<=p34)
states: 513
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
..
EG iterations: 2
abstracting: (p40<=p27)
states: 1,044 (3)
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (p25<=p34)
states: 513
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
..
EG iterations: 2
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (p25<=p34)
states: 513
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (1<=p41)
states: 512
abstracting: (1<=p51)
states: 512
.abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (1<=p27)
states: 1,043 (3)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [~ [AF [[[[[p34<=1 | ~ [p55<=0]] & p25<=1] | [AG [1<=p58] | 1<=p69]] | ~ [[AF [1<=p51] & EX [p13<=1]]]]]] | EX [EX [[p6<=1 | 1<=p56]]]]
normalized: [EX [EX [[p6<=1 | 1<=p56]]] | EG [~ [[~ [[EX [p13<=1] & ~ [EG [~ [1<=p51]]]]] | [[1<=p69 | ~ [E [true U ~ [1<=p58]]]] | [p25<=1 & [p34<=1 | ~ [p55<=0]]]]]]]]

abstracting: (p55<=0)
states: 1,043 (3)
abstracting: (p34<=1)
states: 1,044 (3)
abstracting: (p25<=1)
states: 1,044 (3)
abstracting: (1<=p58)
states: 1
abstracting: (1<=p69)
states: 1
abstracting: (1<=p51)
states: 512
..
EG iterations: 2
abstracting: (p13<=1)
states: 1,044 (3)
..
EG iterations: 1
abstracting: (1<=p56)
states: 1
abstracting: (p6<=1)
states: 1,044 (3)
..-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: ~ [[EF [~ [[[A [1<=p15 U p36<=1] | ~ [1<=p36]] & EG [~ [p47<=p43]]]]] | AF [[p54<=1 & [p25<=p55 & ~ [p14<=0]]]]]]
normalized: ~ [[~ [EG [~ [[p54<=1 & [p25<=p55 & ~ [p14<=0]]]]]] | E [true U ~ [[EG [~ [p47<=p43]] & [~ [1<=p36] | [~ [EG [~ [p36<=1]]] & ~ [E [~ [p36<=1] U [~ [1<=p15] & ~ [p36<=1]]]]]]]]]]]

abstracting: (p36<=1)
states: 1,044 (3)
abstracting: (1<=p15)
states: 1,043 (3)
abstracting: (p36<=1)
states: 1,044 (3)
abstracting: (p36<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (1<=p36)
states: 512
abstracting: (p47<=p43)
states: 788
.
EG iterations: 1
abstracting: (p14<=0)
states: 1
abstracting: (p25<=p55)
states: 2
abstracting: (p54<=1)
states: 1,044 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[[1<=p20 | p24<=p69] & E [p60<=p53 U [AG [[p45<=0 & 1<=p34]] | ~ [[E [1<=p61 U p26<=0] & EF [1<=p32]]]]]]]
normalized: E [true U [E [p60<=p53 U [~ [[E [true U 1<=p32] & E [1<=p61 U p26<=0]]] | ~ [E [true U ~ [[p45<=0 & 1<=p34]]]]]] & [1<=p20 | p24<=p69]]]

abstracting: (p24<=p69)
states: 2
abstracting: (1<=p20)
states: 1,043 (3)
abstracting: (1<=p34)
states: 512
abstracting: (p45<=0)
states: 532
abstracting: (p26<=0)
states: 1
abstracting: (1<=p61)
states: 1
abstracting: (1<=p32)
states: 512
abstracting: (p60<=p53)
states: 1,043 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: ~ [[AF [E [AF [[1<=p51 | p12<=1]] U AF [EG [p25<=p26]]]] & EX [[[~ [AG [1<=p1]] & p9<=0] & [[A [p48<=p62 U p29<=0] | E [p61<=p50 U 1<=p42]] | p43<=1]]]]]
normalized: ~ [[EX [[[p43<=1 | [E [p61<=p50 U 1<=p42] | [~ [EG [~ [p29<=0]]] & ~ [E [~ [p29<=0] U [~ [p48<=p62] & ~ [p29<=0]]]]]]] & [p9<=0 & E [true U ~ [1<=p1]]]]] & ~ [EG [~ [E [~ [EG [~ [[1<=p51 | p12<=1]]]] U ~ [EG [~ [EG [p25<=p26]]]]]]]]]]

abstracting: (p25<=p26)
states: 1,043 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p12<=1)
states: 1,044 (3)
abstracting: (1<=p51)
states: 512
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (p9<=0)
states: 512
abstracting: (p29<=0)
states: 1
abstracting: (p48<=p62)
states: 532
abstracting: (p29<=0)
states: 1
abstracting: (p29<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p42)
states: 512
abstracting: (p61<=p50)
states: 1,043 (3)
abstracting: (p43<=1)
states: 1,044 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [E [A [AG [~ [[p13<=1 & p12<=1]]] U AG [[[p1<=1 & 1<=p54] & [1<=p28 & p33<=0]]]] U ~ [[EF [1<=p35] & [[[[1<=p2 | p31<=p67] | [p26<=p27 | p29<=0]] & p54<=1] | EG [[1<=p52 & 1<=p66]]]]]] & ~ [[EF [AG [~ [[p54<=p51 & p29<=0]]]] | EG [AX [1<=p61]]]]]
normalized: [~ [[EG [~ [EX [~ [1<=p61]]]] | E [true U ~ [E [true U [p54<=p51 & p29<=0]]]]]] & E [[~ [EG [E [true U ~ [[[1<=p28 & p33<=0] & [p1<=1 & 1<=p54]]]]]] & ~ [E [E [true U ~ [[[1<=p28 & p33<=0] & [p1<=1 & 1<=p54]]]] U [E [true U [p13<=1 & p12<=1]] & E [true U ~ [[[1<=p28 & p33<=0] & [p1<=1 & 1<=p54]]]]]]]] U ~ [[[EG [[1<=p52 & 1<=p66]] | [p54<=1 & [[p26<=p27 | p29<=0] | [1<=p2 | p31<=p67]]]] & E [true U 1<=p35]]]]]

abstracting: (1<=p35)
states: 512
abstracting: (p31<=p67)
states: 2
abstracting: (1<=p2)
states: 532
abstracting: (p29<=0)
states: 1
abstracting: (p26<=p27)
states: 1,043 (3)
abstracting: (p54<=1)
states: 1,044 (3)
abstracting: (1<=p66)
states: 1
abstracting: (1<=p52)
states: 1
.
EG iterations: 1
abstracting: (1<=p54)
states: 1
abstracting: (p1<=1)
states: 1,044 (3)
abstracting: (p33<=0)
states: 532
abstracting: (1<=p28)
states: 1,043 (3)
abstracting: (p12<=1)
states: 1,044 (3)
abstracting: (p13<=1)
states: 1,044 (3)
abstracting: (1<=p54)
states: 1
abstracting: (p1<=1)
states: 1,044 (3)
abstracting: (p33<=0)
states: 532
abstracting: (1<=p28)
states: 1,043 (3)
abstracting: (1<=p54)
states: 1
abstracting: (p1<=1)
states: 1,044 (3)
abstracting: (p33<=0)
states: 532
abstracting: (1<=p28)
states: 1,043 (3)

EG iterations: 0
abstracting: (p29<=0)
states: 1
abstracting: (p54<=p51)
states: 1,043 (3)
abstracting: (1<=p61)
states: 1
..
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: A [[[EF [[[~ [p66<=p52] | 1<=p63] | p42<=p60]] | EX [AF [[p49<=1 | 1<=p14]]]] & [1<=p21 & [AX [[1<=p69 & [p34<=p19 | p20<=p69]]] & [~ [[p60<=p62 & EG [1<=p42]]] & [p59<=0 & A [1<=p61 U 1<=p42]]]]]] U ~ [[p16<=p64 & p24<=1]]]
normalized: [~ [EG [[p16<=p64 & p24<=1]]] & ~ [E [[p16<=p64 & p24<=1] U [~ [[[1<=p21 & [[[p59<=0 & [~ [EG [~ [1<=p42]]] & ~ [E [~ [1<=p42] U [~ [1<=p61] & ~ [1<=p42]]]]]] & ~ [[p60<=p62 & EG [1<=p42]]]] & ~ [EX [~ [[1<=p69 & [p34<=p19 | p20<=p69]]]]]]] & [EX [~ [EG [~ [[p49<=1 | 1<=p14]]]]] | E [true U [p42<=p60 | [1<=p63 | ~ [p66<=p52]]]]]]] & [p16<=p64 & p24<=1]]]]]

abstracting: (p24<=1)
states: 1,044 (3)
abstracting: (p16<=p64)
states: 2
abstracting: (p66<=p52)
states: 1,043 (3)
abstracting: (1<=p63)
states: 1
abstracting: (p42<=p60)
states: 532
abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (p49<=1)
states: 1,044 (3)
.
EG iterations: 1
.abstracting: (p20<=p69)
states: 2
abstracting: (p34<=p19)
states: 1,044 (3)
abstracting: (1<=p69)
states: 1
.abstracting: (1<=p42)
states: 512
.
EG iterations: 1
abstracting: (p60<=p62)
states: 1,043 (3)
abstracting: (1<=p42)
states: 512
abstracting: (1<=p61)
states: 1
abstracting: (1<=p42)
states: 512
abstracting: (1<=p42)
states: 512
..
EG iterations: 2
abstracting: (p59<=0)
states: 1,043 (3)
abstracting: (1<=p21)
states: 1,043 (3)
abstracting: (p24<=1)
states: 1,044 (3)
abstracting: (p16<=p64)
states: 2
abstracting: (p24<=1)
states: 1,044 (3)
abstracting: (p16<=p64)
states: 2
..
EG iterations: 2
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: E [[[[EF [AF [p11<=p55]] & [[~ [AG [1<=p19]] | [AF [p39<=p30] & ~ [p34<=p58]]] | p12<=0]] | AG [p61<=0]] & ~ [[[A [[p31<=0 | 1<=p20] U EX [p33<=0]] | [[1<=p60 | [1<=p23 & p32<=0]] | ~ [[p49<=p49 | 1<=p60]]]] & [[1<=p8 | [EG [1<=p51] & AF [p13<=p23]]] | [p11<=1 | [A [1<=p27 U 1<=p66] | ~ [1<=p43]]]]]]] U EF [[p64<=p41 & [EG [EG [p21<=p19]] | ~ [E [p65<=1 U 1<=p20]]]]]]
normalized: E [[~ [[[[p11<=1 | [~ [1<=p43] | [~ [EG [~ [1<=p66]]] & ~ [E [~ [1<=p66] U [~ [1<=p27] & ~ [1<=p66]]]]]]] | [1<=p8 | [~ [EG [~ [p13<=p23]]] & EG [1<=p51]]]] & [[~ [[p49<=p49 | 1<=p60]] | [1<=p60 | [1<=p23 & p32<=0]]] | [~ [EG [~ [EX [p33<=0]]]] & ~ [E [~ [EX [p33<=0]] U [~ [[p31<=0 | 1<=p20]] & ~ [EX [p33<=0]]]]]]]]] & [~ [E [true U ~ [p61<=0]]] | [[p12<=0 | [[~ [p34<=p58] & ~ [EG [~ [p39<=p30]]]] | E [true U ~ [1<=p19]]]] & E [true U ~ [EG [~ [p11<=p55]]]]]]] U E [true U [p64<=p41 & [~ [E [p65<=1 U 1<=p20]] | EG [EG [p21<=p19]]]]]]

abstracting: (p21<=p19)
states: 1,043 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p20)
states: 1,043 (3)
abstracting: (p65<=1)
states: 1,044 (3)
abstracting: (p64<=p41)
states: 1,043 (3)
abstracting: (p11<=p55)
states: 513
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,043 (3)
abstracting: (p39<=p30)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (p34<=p58)
states: 532
abstracting: (p12<=0)
states: 1
abstracting: (p61<=0)
states: 1,043 (3)
abstracting: (p33<=0)
states: 532
.abstracting: (1<=p20)
states: 1,043 (3)
abstracting: (p31<=0)
states: 1
abstracting: (p33<=0)
states: 532
.abstracting: (p33<=0)
states: 532
..
EG iterations: 1
abstracting: (p32<=0)
states: 532
abstracting: (1<=p23)
states: 1,043 (3)
abstracting: (1<=p60)
states: 1
abstracting: (1<=p60)
states: 1
abstracting: (p49<=p49)
states: 1,044 (3)
abstracting: (1<=p51)
states: 512
.
EG iterations: 1
abstracting: (p13<=p23)
states: 1,043 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 532
abstracting: (1<=p66)
states: 1
abstracting: (1<=p27)
states: 1,043 (3)
abstracting: (1<=p66)
states: 1
abstracting: (1<=p66)
states: 1
.
EG iterations: 1
abstracting: (1<=p43)
states: 512
abstracting: (p11<=1)
states: 1,044 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: [[E [EX [E [[p4<=p51 & p8<=p3] U A [1<=p52 U 1<=p65]]] U EG [AG [p50<=p37]]] & EG [~ [[[~ [[p19<=p28 & p6<=1]] | AF [1<=p53]] & [1<=p59 & [EG [p35<=p22] & [p66<=p60 & p6<=1]]]]]]] & [[~ [AX [A [~ [p23<=p9] U p25<=p11]]] & [EG [A [[p41<=0 & p22<=0] U p6<=1]] | ~ [AG [[[p59<=p25 | p42<=p60] | ~ [p58<=0]]]]]] & E [EG [1<=p30] U EX [[[AG [p31<=0] & 1<=p19] & p37<=p45]]]]]
normalized: [[E [EG [1<=p30] U EX [[p37<=p45 & [1<=p19 & ~ [E [true U ~ [p31<=0]]]]]]] & [[E [true U ~ [[~ [p58<=0] | [p59<=p25 | p42<=p60]]]] | EG [[~ [EG [~ [p6<=1]]] & ~ [E [~ [p6<=1] U [~ [[p41<=0 & p22<=0]] & ~ [p6<=1]]]]]]] & EX [~ [[~ [EG [~ [p25<=p11]]] & ~ [E [~ [p25<=p11] U [p23<=p9 & ~ [p25<=p11]]]]]]]]] & [EG [~ [[[1<=p59 & [[p66<=p60 & p6<=1] & EG [p35<=p22]]] & [~ [EG [~ [1<=p53]]] | ~ [[p19<=p28 & p6<=1]]]]]] & E [EX [E [[p4<=p51 & p8<=p3] U [~ [EG [~ [1<=p65]]] & ~ [E [~ [1<=p65] U [~ [1<=p52] & ~ [1<=p65]]]]]]] U EG [~ [E [true U ~ [p50<=p37]]]]]]]

abstracting: (p50<=p37)
states: 788
.
EG iterations: 1
abstracting: (1<=p65)
states: 1
abstracting: (1<=p52)
states: 1
abstracting: (1<=p65)
states: 1
abstracting: (1<=p65)
states: 1
.
EG iterations: 1
abstracting: (p8<=p3)
states: 788
abstracting: (p4<=p51)
states: 768
.abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (p19<=p28)
states: 1,043 (3)
abstracting: (1<=p53)
states: 1
.
EG iterations: 1
abstracting: (p35<=p22)
states: 1,044 (3)

EG iterations: 0
abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (p66<=p60)
states: 1,043 (3)
abstracting: (1<=p59)
states: 1

EG iterations: 0
abstracting: (p25<=p11)
states: 532
abstracting: (p23<=p9)
states: 532
abstracting: (p25<=p11)
states: 532
abstracting: (p25<=p11)
states: 532
.
EG iterations: 1
.abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (p22<=0)
states: 1
abstracting: (p41<=0)
states: 532
abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (p6<=1)
states: 1,044 (3)
.
EG iterations: 1

EG iterations: 0
abstracting: (p42<=p60)
states: 532
abstracting: (p59<=p25)
states: 1,044 (3)
abstracting: (p58<=0)
states: 1,043 (3)
abstracting: (p31<=0)
states: 1
abstracting: (1<=p19)
states: 1,043 (3)
abstracting: (p37<=p45)
states: 788
.abstracting: (1<=p30)
states: 1,043 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

totally nodes used: 32347 (3.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 109367 616884 726251
used/not used/entry size/cache size: 637477 66471387 16 1024MB
basic ops cache: hits/miss/sum: 44707 383899 428606
used/not used/entry size/cache size: 429991 16347225 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: 3754 18468 22222
used/not used/entry size/cache size: 18467 8370141 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 67076661
1 32060
2 142
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.761sec


BK_STOP 1679851153057

--------------------
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:873 (14), effective:30 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:894 (14), effective:30 (0)

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

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

iterations count:854 (14), effective:29 (0)

iterations count:896 (14), effective:30 (0)

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

iterations count:884 (14), effective:21 (0)

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

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

iterations count:884 (14), effective:21 (0)

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

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

iterations count:884 (14), effective:21 (0)

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

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

iterations count:834 (13), effective:20 (0)

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

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

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

iterations count:834 (13), effective:20 (0)

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

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

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

iterations count:834 (13), effective:20 (0)

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

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

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

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

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

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

iterations count:884 (14), effective:21 (0)

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

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

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

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

iterations count:826 (13), effective:20 (0)

iterations count:843 (14), effective:20 (0)

iterations count:885 (14), effective:21 (0)

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

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

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

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

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

iterations count:896 (14), effective:30 (0)

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

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

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

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

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

iterations count:854 (14), effective:20 (0)

iterations count:896 (14), effective:30 (0)

iterations count:896 (14), effective:30 (0)

iterations count:844 (14), effective:29 (0)

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

iterations count:885 (14), effective:22 (0)

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

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

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

iterations count:82 (1), effective:1 (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="RwMutex-PT-r0010w0020"
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 RwMutex-PT-r0010w0020, 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 r353-smll-167891800500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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