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.r065-smll-167814393100201.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 ClientsAndServers-PT-N0001P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393100201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N0001P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678284964216

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=ClientsAndServers-PT-N0001P0
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: ClientsAndServers_PT_N0001P0
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 3.365sec


RS generation: 0m 0.061sec


-> reachability set: #nodes 2197 (2.2e+03) #states 27,576 (4)



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

checking: EG [EF [EX [~ [EF [SwA<=CwG]]]]]
normalized: EG [E [true U EX [~ [E [true U SwA<=CwG]]]]]

abstracting: (SwA<=CwG)
states: 25,868 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: E [EX [~ [MtF<=SpG]] U 2<=MwU]
normalized: E [EX [~ [MtF<=SpG]] U 2<=MwU]

abstracting: (2<=MwU)
states: 371
abstracting: (MtF<=SpG)
states: 24,589 (4)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [EG [[~ [Mi<=SpG] & CwA<=MpA]]]
normalized: ~ [EG [[~ [Mi<=SpG] & CwA<=MpA]]]

abstracting: (CwA<=MpA)
states: 2,034 (3)
abstracting: (Mi<=SpG)
states: 0
................................................
EG iterations: 48
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: ~ [A [AX [SR<=SwG] U EG [[[~ [AX [CF<=SG]] | ~ [Cb<=6]] & AG [~ [3<=MwU]]]]]]
normalized: ~ [[~ [EG [~ [EG [[~ [E [true U 3<=MwU]] & [~ [Cb<=6] | EX [~ [CF<=SG]]]]]]]] & ~ [E [~ [EG [[~ [E [true U 3<=MwU]] & [~ [Cb<=6] | EX [~ [CF<=SG]]]]]] U [EX [~ [SR<=SwG]] & ~ [EG [[~ [E [true U 3<=MwU]] & [~ [Cb<=6] | EX [~ [CF<=SG]]]]]]]]]]]

abstracting: (CF<=SG)
states: 15,862 (4)
.abstracting: (Cb<=6)
states: 27,576 (4)
abstracting: (3<=MwU)
states: 0
................
EG iterations: 16
abstracting: (SR<=SwG)
states: 27,576 (4)
.abstracting: (CF<=SG)
states: 15,862 (4)
.abstracting: (Cb<=6)
states: 27,576 (4)
abstracting: (3<=MwU)
states: 0
................
EG iterations: 16
abstracting: (CF<=SG)
states: 15,862 (4)
.abstracting: (Cb<=6)
states: 27,576 (4)
abstracting: (3<=MwU)
states: 0
................
EG iterations: 16
.......................................
EG iterations: 39
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AX [A [EX [~ [[~ [Mi<=Mi] & 6<=CwA]]] U [~ [AG [EF [SA<=CwA]]] & [EG [AF [SR<=6]] & ~ [AX [Uf<=CA]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[EX [~ [Uf<=CA]] & EG [~ [EG [~ [SR<=6]]]]] & E [true U ~ [E [true U SA<=CwA]]]]]]] & ~ [E [~ [[[EX [~ [Uf<=CA]] & EG [~ [EG [~ [SR<=6]]]]] & E [true U ~ [E [true U SA<=CwA]]]]] U [~ [EX [~ [[~ [Mi<=Mi] & 6<=CwA]]]] & ~ [[[EX [~ [Uf<=CA]] & EG [~ [EG [~ [SR<=6]]]]] & E [true U ~ [E [true U SA<=CwA]]]]]]]]]]]]

abstracting: (SA<=CwA)
states: 27,576 (4)
abstracting: (SR<=6)
states: 27,576 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (Uf<=CA)
states: 18,645 (4)
.abstracting: (6<=CwA)
states: 2,169 (3)
abstracting: (Mi<=Mi)
states: 27,576 (4)
.abstracting: (SA<=CwA)
states: 27,576 (4)
abstracting: (SR<=6)
states: 27,576 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (Uf<=CA)
states: 18,645 (4)
.abstracting: (SA<=CwA)
states: 27,576 (4)
abstracting: (SR<=6)
states: 27,576 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (Uf<=CA)
states: 18,645 (4)
.
EG iterations: 0
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: E [A [Uf<=SwG U EX [AG [E [Cb<=3 U 3<=MwU]]]] U ~ [EG [[[SwA<=3 | 6<=CG] & [MpA<=4 | 4<=CwG]]]]]
normalized: E [[~ [EG [~ [EX [~ [E [true U ~ [E [Cb<=3 U 3<=MwU]]]]]]]] & ~ [E [~ [EX [~ [E [true U ~ [E [Cb<=3 U 3<=MwU]]]]]] U [~ [Uf<=SwG] & ~ [EX [~ [E [true U ~ [E [Cb<=3 U 3<=MwU]]]]]]]]]] U ~ [EG [[[MpA<=4 | 4<=CwG] & [SwA<=3 | 6<=CG]]]]]

abstracting: (6<=CG)
states: 0
abstracting: (SwA<=3)
states: 27,576 (4)
abstracting: (4<=CwG)
states: 9,925 (3)
abstracting: (MpA<=4)
states: 27,576 (4)

EG iterations: 0
abstracting: (3<=MwU)
states: 0
abstracting: (Cb<=3)
states: 27,411 (4)
.abstracting: (Uf<=SwG)
states: 13,616 (4)
abstracting: (3<=MwU)
states: 0
abstracting: (Cb<=3)
states: 27,411 (4)
.abstracting: (3<=MwU)
states: 0
abstracting: (Cb<=3)
states: 27,411 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [EX [[[EG [[MpA<=SpA | SG<=2]] | SG<=Cb] & ~ [[AG [1<=CwA] & AG [SpG<=SpG]]]]]]
normalized: ~ [EX [~ [EX [[~ [[~ [E [true U ~ [SpG<=SpG]]] & ~ [E [true U ~ [1<=CwA]]]]] & [SG<=Cb | EG [[MpA<=SpA | SG<=2]]]]]]]]

abstracting: (SG<=2)
states: 27,576 (4)
abstracting: (MpA<=SpA)
states: 23,669 (4)

EG iterations: 0
abstracting: (SG<=Cb)
states: 25,690 (4)
abstracting: (1<=CwA)
states: 26,017 (4)
abstracting: (SpG<=SpG)
states: 27,576 (4)
..-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: E [3<=SpA U ~ [E [AX [~ [[CwA<=1 & CG<=Uf]]] U [[8<=Mi & [~ [CwG<=3] | ~ [MpG<=5]]] | 4<=MwU]]]]
normalized: E [3<=SpA U ~ [E [~ [EX [[CwA<=1 & CG<=Uf]]] U [4<=MwU | [8<=Mi & [~ [MpG<=5] | ~ [CwG<=3]]]]]]]

abstracting: (CwG<=3)
states: 17,651 (4)
abstracting: (MpG<=5)
states: 27,576 (4)
abstracting: (8<=Mi)
states: 0
abstracting: (4<=MwU)
states: 0
abstracting: (CG<=Uf)
states: 20,652 (4)
abstracting: (CwA<=1)
states: 5,923 (3)
.abstracting: (3<=SpA)
states: 0
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: ~ [E [AG [~ [EF [~ [Cb<=MtF]]]] U [EF [~ [[[SG<=3 | StF<=CwA] | [Ci<=8 & MpA<=SpG]]]] & ~ [[MtF<=8 & Uf<=0]]]]]
normalized: ~ [E [~ [E [true U E [true U ~ [Cb<=MtF]]]] U [~ [[MtF<=8 & Uf<=0]] & E [true U ~ [[[Ci<=8 & MpA<=SpG] | [SG<=3 | StF<=CwA]]]]]]]

abstracting: (StF<=CwA)
states: 27,576 (4)
abstracting: (SG<=3)
states: 27,576 (4)
abstracting: (MpA<=SpG)
states: 23,669 (4)
abstracting: (Ci<=8)
states: 27,576 (4)
abstracting: (Uf<=0)
states: 8,865 (3)
abstracting: (MtF<=8)
states: 27,576 (4)
abstracting: (Cb<=MtF)
states: 15,862 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [~ [E [EX [[Si<=SF | A [CF<=5 U 4<=SpA]]] U E [[AF [CF<=MtF] | 4<=Si] U [AG [5<=SG] | [Si<=7 | 5<=CwA]]]]]]
normalized: E [true U ~ [E [EX [[Si<=SF | [~ [EG [~ [4<=SpA]]] & ~ [E [~ [4<=SpA] U [~ [CF<=5] & ~ [4<=SpA]]]]]]] U E [[4<=Si | ~ [EG [~ [CF<=MtF]]]] U [[Si<=7 | 5<=CwA] | ~ [E [true U ~ [5<=SG]]]]]]]]

abstracting: (5<=SG)
states: 0
abstracting: (5<=CwA)
states: 5,113 (3)
abstracting: (Si<=7)
states: 27,576 (4)
abstracting: (CF<=MtF)
states: 15,862 (4)
..............
EG iterations: 14
abstracting: (4<=Si)
states: 0
abstracting: (4<=SpA)
states: 0
abstracting: (CF<=5)
states: 27,576 (4)
abstracting: (4<=SpA)
states: 0
abstracting: (4<=SpA)
states: 0

EG iterations: 0
abstracting: (Si<=SF)
states: 21,564 (4)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AF [AF [[[E [[SpA<=8 | 8<=SR] U AF [Mi<=SF]] & ~ [[AX [CwA<=1] & SwG<=MtF]]] & [~ [AX [MwU<=5]] & E [~ [CR<=3] U EG [StF<=0]]]]]]
normalized: ~ [EG [EG [~ [[[E [~ [CR<=3] U EG [StF<=0]] & EX [~ [MwU<=5]]] & [~ [[SwG<=MtF & ~ [EX [~ [CwA<=1]]]]] & E [[SpA<=8 | 8<=SR] U ~ [EG [~ [Mi<=SF]]]]]]]]]]

abstracting: (Mi<=SF)
states: 0

EG iterations: 0
abstracting: (8<=SR)
states: 0
abstracting: (SpA<=8)
states: 27,576 (4)
abstracting: (CwA<=1)
states: 5,923 (3)
.abstracting: (SwG<=MtF)
states: 14,924 (4)
abstracting: (MwU<=5)
states: 27,576 (4)
.abstracting: (StF<=0)
states: 24,408 (4)
.
EG iterations: 1
abstracting: (CR<=3)
states: 25,140 (4)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: ~ [AX [[[E [EF [SG<=1] U [E [Si<=0 U CwA<=CF] & AG [5<=Si]]] & [EF [Si<=StF] | AF [EF [MtF<=4]]]] | SpA<=MpG]]]
normalized: EX [~ [[SpA<=MpG | [[~ [EG [~ [E [true U MtF<=4]]]] | E [true U Si<=StF]] & E [E [true U SG<=1] U [~ [E [true U ~ [5<=Si]]] & E [Si<=0 U CwA<=CF]]]]]]]

abstracting: (CwA<=CF)
states: 3,105 (3)
abstracting: (Si<=0)
states: 21,168 (4)
abstracting: (5<=Si)
states: 0
abstracting: (SG<=1)
states: 27,395 (4)
abstracting: (Si<=StF)
states: 21,564 (4)
abstracting: (MtF<=4)
states: 27,576 (4)
.
EG iterations: 1
abstracting: (SpA<=MpG)
states: 23,669 (4)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: [AX [[[AG [[~ [4<=StF] | AG [3<=SpA]]] | [[SA<=6 & [[CR<=MwU & 1<=MpA] & [CwA<=5 & Mi<=6]]] | AF [AX [7<=Ci]]]] | EG [EF [[5<=Cb & 5<=SpA]]]]] | ~ [EX [EF [~ [[7<=Mi & SF<=MwU]]]]]]
normalized: [~ [EX [E [true U ~ [[7<=Mi & SF<=MwU]]]]] | ~ [EX [~ [[EG [E [true U [5<=Cb & 5<=SpA]]] | [[~ [EG [EX [~ [7<=Ci]]]] | [SA<=6 & [[CwA<=5 & Mi<=6] & [CR<=MwU & 1<=MpA]]]] | ~ [E [true U ~ [[~ [E [true U ~ [3<=SpA]]] | ~ [4<=StF]]]]]]]]]]]

abstracting: (4<=StF)
states: 0
abstracting: (3<=SpA)
states: 0
abstracting: (1<=MpA)
states: 4,188 (3)
abstracting: (CR<=MwU)
states: 10,485 (4)
abstracting: (Mi<=6)
states: 27,576 (4)
abstracting: (CwA<=5)
states: 25,407 (4)
abstracting: (SA<=6)
states: 27,576 (4)
abstracting: (7<=Ci)
states: 18
..................
EG iterations: 17
abstracting: (5<=SpA)
states: 0
abstracting: (5<=Cb)
states: 0
.
EG iterations: 1
.abstracting: (SF<=MwU)
states: 24,689 (4)
abstracting: (7<=Mi)
states: 0
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [[E [EF [8<=SR] U E [[EX [CF<=SF] | EF [SpA<=StR]] U [[[SA<=4 & 5<=SA] | EF [StR<=6]] & E [6<=SF U MtF<=6]]]] | EX [MwU<=CwA]] & EF [[AF [~ [EX [Mi<=4]]] | ~ [[AG [1<=SwG] & CG<=4]]]]]
normalized: [E [true U [~ [[CG<=4 & ~ [E [true U ~ [1<=SwG]]]]] | ~ [EG [EX [Mi<=4]]]]] & [EX [MwU<=CwA] | E [E [true U 8<=SR] U E [[E [true U SpA<=StR] | EX [CF<=SF]] U [E [6<=SF U MtF<=6] & [E [true U StR<=6] | [SA<=4 & 5<=SA]]]]]]]

abstracting: (5<=SA)
states: 0
abstracting: (SA<=4)
states: 27,576 (4)
abstracting: (StR<=6)
states: 27,576 (4)
abstracting: (MtF<=6)
states: 27,576 (4)
abstracting: (6<=SF)
states: 0
abstracting: (CF<=SF)
states: 15,862 (4)
.abstracting: (SpA<=StR)
states: 23,759 (4)
abstracting: (8<=SR)
states: 0
abstracting: (MwU<=CwA)
states: 27,061 (4)
.abstracting: (Mi<=4)
states: 27,576 (4)
..................
EG iterations: 17
abstracting: (1<=SwG)
states: 13,576 (4)
abstracting: (CG<=4)
states: 27,576 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [E [AX [[AX [~ [StR<=SG]] & [[AF [7<=SG] & [SpA<=0 | 5<=Uf]] | AF [1<=MwU]]]] U [A [AX [[3<=Si & 1<=StF]] U SpG<=7] & E [EG [AX [MpA<=Si]] U ~ [CG<=MpG]]]] & E [~ [A [AX [E [8<=CwG U SwA<=4]] U [[[CwA<=CG | CG<=SG] | EF [CG<=SpA]] & AX [Mi<=1]]]] U ~ [EF [[EF [CA<=5] | [~ [StF<=7] | [5<=Ci & StF<=SwA]]]]]]]
normalized: [E [~ [[~ [EG [~ [[~ [EX [~ [Mi<=1]]] & [E [true U CG<=SpA] | [CwA<=CG | CG<=SG]]]]]] & ~ [E [~ [[~ [EX [~ [Mi<=1]]] & [E [true U CG<=SpA] | [CwA<=CG | CG<=SG]]]] U [EX [~ [E [8<=CwG U SwA<=4]]] & ~ [[~ [EX [~ [Mi<=1]]] & [E [true U CG<=SpA] | [CwA<=CG | CG<=SG]]]]]]]]] U ~ [E [true U [[[5<=Ci & StF<=SwA] | ~ [StF<=7]] | E [true U CA<=5]]]]] & E [~ [EX [~ [[[~ [EG [~ [1<=MwU]]] | [[SpA<=0 | 5<=Uf] & ~ [EG [~ [7<=SG]]]]] & ~ [EX [StR<=SG]]]]]] U [E [EG [~ [EX [~ [MpA<=Si]]]] U ~ [CG<=MpG]] & [~ [EG [~ [SpG<=7]]] & ~ [E [~ [SpG<=7] U [EX [~ [[3<=Si & 1<=StF]]] & ~ [SpG<=7]]]]]]]]

abstracting: (SpG<=7)
states: 27,576 (4)
abstracting: (1<=StF)
states: 3,168 (3)
abstracting: (3<=Si)
states: 0
.abstracting: (SpG<=7)
states: 27,576 (4)
abstracting: (SpG<=7)
states: 27,576 (4)
.
EG iterations: 1
abstracting: (CG<=MpG)
states: 15,862 (4)
abstracting: (MpA<=Si)
states: 23,934 (4)
..........................................
EG iterations: 41
abstracting: (StR<=SG)
states: 23,399 (4)
.abstracting: (7<=SG)
states: 0

EG iterations: 0
abstracting: (5<=Uf)
states: 0
abstracting: (SpA<=0)
states: 23,388 (4)
abstracting: (1<=MwU)
states: 4,458 (3)
................................................................
EG iterations: 64
.abstracting: (CA<=5)
states: 27,405 (4)
abstracting: (StF<=7)
states: 27,576 (4)
abstracting: (StF<=SwA)
states: 25,332 (4)
abstracting: (5<=Ci)
states: 776
abstracting: (CG<=SG)
states: 15,862 (4)
abstracting: (CwA<=CG)
states: 5,513 (3)
abstracting: (CG<=SpA)
states: 16,174 (4)
abstracting: (Mi<=1)
states: 2,690 (3)
.abstracting: (SwA<=4)
states: 27,576 (4)
abstracting: (8<=CwG)
states: 116
.abstracting: (CG<=SG)
states: 15,862 (4)
abstracting: (CwA<=CG)
states: 5,513 (3)
abstracting: (CG<=SpA)
states: 16,174 (4)
abstracting: (Mi<=1)
states: 2,690 (3)
.abstracting: (CG<=SG)
states: 15,862 (4)
abstracting: (CwA<=CG)
states: 5,513 (3)
abstracting: (CG<=SpA)
states: 16,174 (4)
abstracting: (Mi<=1)
states: 2,690 (3)
.....................
EG iterations: 20
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.173sec

checking: [A [[~ [EG [[[7<=MpG | StF<=Mi] | 1<=SF]]] & SR<=SG] U [[E [[AG [6<=CwA] | [CG<=5 | Ci<=4]] U EF [CF<=2]] & [EG [~ [Cb<=Mi]] & [EG [SR<=Uf] | AG [5<=SwG]]]] | AG [Mi<=6]]] & ~ [A [EX [[EG [MpA<=SwG] & AX [Cb<=CR]]] U [~ [[[[SpA<=Mi | 7<=CG] & [Si<=5 & SwA<=SG]] & [AX [4<=CF] | [8<=SwA & 1<=MpG]]]] & [CA<=CG & EG [[SR<=4 & CR<=0]]]]]]]
normalized: [~ [[~ [EG [~ [[[CA<=CG & EG [[SR<=4 & CR<=0]]] & ~ [[[[8<=SwA & 1<=MpG] | ~ [EX [~ [4<=CF]]]] & [[Si<=5 & SwA<=SG] & [SpA<=Mi | 7<=CG]]]]]]]] & ~ [E [~ [[[CA<=CG & EG [[SR<=4 & CR<=0]]] & ~ [[[[8<=SwA & 1<=MpG] | ~ [EX [~ [4<=CF]]]] & [[Si<=5 & SwA<=SG] & [SpA<=Mi | 7<=CG]]]]]] U [~ [EX [[~ [EX [~ [Cb<=CR]]] & EG [MpA<=SwG]]]] & ~ [[[CA<=CG & EG [[SR<=4 & CR<=0]]] & ~ [[[[8<=SwA & 1<=MpG] | ~ [EX [~ [4<=CF]]]] & [[Si<=5 & SwA<=SG] & [SpA<=Mi | 7<=CG]]]]]]]]]]] & [~ [EG [~ [[~ [E [true U ~ [Mi<=6]]] | [[[EG [SR<=Uf] | ~ [E [true U ~ [5<=SwG]]]] & EG [~ [Cb<=Mi]]] & E [[[CG<=5 | Ci<=4] | ~ [E [true U ~ [6<=CwA]]]] U E [true U CF<=2]]]]]]] & ~ [E [~ [[~ [E [true U ~ [Mi<=6]]] | [[[EG [SR<=Uf] | ~ [E [true U ~ [5<=SwG]]]] & EG [~ [Cb<=Mi]]] & E [[[CG<=5 | Ci<=4] | ~ [E [true U ~ [6<=CwA]]]] U E [true U CF<=2]]]]] U [~ [[SR<=SG & ~ [EG [[1<=SF | [7<=MpG | StF<=Mi]]]]]] & ~ [[~ [E [true U ~ [Mi<=6]]] | [[[EG [SR<=Uf] | ~ [E [true U ~ [5<=SwG]]]] & EG [~ [Cb<=Mi]]] & E [[[CG<=5 | Ci<=4] | ~ [E [true U ~ [6<=CwA]]]] U E [true U CF<=2]]]]]]]]]]

abstracting: (CF<=2)
states: 26,310 (4)
abstracting: (6<=CwA)
states: 2,169 (3)
abstracting: (Ci<=4)
states: 26,800 (4)
abstracting: (CG<=5)
states: 27,576 (4)
abstracting: (Cb<=Mi)
states: 26,579 (4)
............
EG iterations: 12
abstracting: (5<=SwG)
states: 0
abstracting: (SR<=Uf)
states: 26,186 (4)
..............
EG iterations: 14
abstracting: (Mi<=6)
states: 27,576 (4)
abstracting: (StF<=Mi)
states: 27,576 (4)
abstracting: (7<=MpG)
states: 0
abstracting: (1<=SF)
states: 3,168 (3)

EG iterations: 0
abstracting: (SR<=SG)
states: 23,399 (4)
abstracting: (CF<=2)
states: 26,310 (4)
abstracting: (6<=CwA)
states: 2,169 (3)
abstracting: (Ci<=4)
states: 26,800 (4)
abstracting: (CG<=5)
states: 27,576 (4)
abstracting: (Cb<=Mi)
states: 26,579 (4)
............
EG iterations: 12
abstracting: (5<=SwG)
states: 0
abstracting: (SR<=Uf)
states: 26,186 (4)
..............
EG iterations: 14
abstracting: (Mi<=6)
states: 27,576 (4)
abstracting: (CF<=2)
states: 26,310 (4)
abstracting: (6<=CwA)
states: 2,169 (3)
abstracting: (Ci<=4)
states: 26,800 (4)
abstracting: (CG<=5)
states: 27,576 (4)
abstracting: (Cb<=Mi)
states: 26,579 (4)
............
EG iterations: 12
abstracting: (5<=SwG)
states: 0
abstracting: (SR<=Uf)
states: 26,186 (4)
..............
EG iterations: 14
abstracting: (Mi<=6)
states: 27,576 (4)
.
EG iterations: 1
abstracting: (7<=CG)
states: 0
abstracting: (SpA<=Mi)
states: 27,576 (4)
abstracting: (SwA<=SG)
states: 15,374 (4)
abstracting: (Si<=5)
states: 27,576 (4)
abstracting: (4<=CF)
states: 165
.abstracting: (1<=MpG)
states: 3,168 (3)
abstracting: (8<=SwA)
states: 0
abstracting: (CR<=0)
states: 9,195 (3)
abstracting: (SR<=4)
states: 27,576 (4)
...................................................................
EG iterations: 67
abstracting: (CA<=CG)
states: 13,700 (4)
abstracting: (MpA<=SwG)
states: 24,692 (4)
..................
EG iterations: 18
abstracting: (Cb<=CR)
states: 21,491 (4)
..abstracting: (7<=CG)
states: 0
abstracting: (SpA<=Mi)
states: 27,576 (4)
abstracting: (SwA<=SG)
states: 15,374 (4)
abstracting: (Si<=5)
states: 27,576 (4)
abstracting: (4<=CF)
states: 165
.abstracting: (1<=MpG)
states: 3,168 (3)
abstracting: (8<=SwA)
states: 0
abstracting: (CR<=0)
states: 9,195 (3)
abstracting: (SR<=4)
states: 27,576 (4)
...................................................................
EG iterations: 67
abstracting: (CA<=CG)
states: 13,700 (4)
abstracting: (7<=CG)
states: 0
abstracting: (SpA<=Mi)
states: 27,576 (4)
abstracting: (SwA<=SG)
states: 15,374 (4)
abstracting: (Si<=5)
states: 27,576 (4)
abstracting: (4<=CF)
states: 165
.abstracting: (1<=MpG)
states: 3,168 (3)
abstracting: (8<=SwA)
states: 0
abstracting: (CR<=0)
states: 9,195 (3)
abstracting: (SR<=4)
states: 27,576 (4)
...................................................................
EG iterations: 67
abstracting: (CA<=CG)
states: 13,700 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

totally nodes used: 295343 (3.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 525793 838784 1364577
used/not used/entry size/cache size: 1061117 66047747 16 1024MB
basic ops cache: hits/miss/sum: 173471 325113 498584
used/not used/entry size/cache size: 515509 16261707 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: 18751 26288 45039
used/not used/entry size/cache size: 26261 8362347 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 66834578
1 260531
2 11375
3 1285
4 338
5 173
6 100
7 87
8 56
9 47
>= 10 294

Total processing time: 0m 5.686sec


BK_STOP 1678284969969

--------------------
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.001sec


iterations count:1006 (55), effective:216 (12)

initing FirstDep: 0m 0.000sec


iterations count:42 (2), effective:6 (0)

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

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

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

iterations count:365 (20), effective:79 (4)

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

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

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

iterations count:162 (9), effective:32 (1)

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

iterations count:290 (16), effective:60 (3)

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

iterations count:168 (9), effective:33 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:112 (6), effective:22 (1)

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

iterations count:120 (6), effective:21 (1)

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

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

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

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

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

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

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

iterations count:102 (5), effective:18 (1)

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

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

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

iterations count:102 (5), effective:18 (1)

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

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

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

iterations count:102 (5), effective:18 (1)

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

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

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

iterations count:396 (22), effective:92 (5)

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="ClientsAndServers-PT-N0001P0"
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 ClientsAndServers-PT-N0001P0, 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 r065-smll-167814393100201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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