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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Feb 26 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 9.7K 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 TriangularGrid-PT-1200-CTLCardinality-00
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-01
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-02
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-03
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-04
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-05
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-06
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-07
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-08
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-09
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-1200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679863963596

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=TriangularGrid-PT-1200
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: TriangularGrid_PT_1200
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.860sec


RS generation: 0m 0.101sec


-> reachability set: #nodes 651 (6.5e+02) #states 109,552 (5)



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

checking: EG [~ [AG [~ [AG [AG [18<=pil2_1_1]]]]]]
normalized: EG [E [true U ~ [E [true U E [true U ~ [18<=pil2_1_1]]]]]]

abstracting: (18<=pil2_1_1)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [EX [AG [EX [~ [pil2_1_1<=pil2_1_1]]]]]
normalized: E [true U EX [~ [E [true U ~ [EX [~ [pil2_1_1<=pil2_1_1]]]]]]]

abstracting: (pil2_1_1<=pil2_1_1)
states: 109,552 (5)
..-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[EX [pol1_1_1<=9] & EF [AG [~ [18<=pil2_1_1]]]]]
normalized: ~ [[E [true U ~ [E [true U 18<=pil2_1_1]]] & EX [pol1_1_1<=9]]]

abstracting: (pol1_1_1<=9)
states: 109,552 (5)
.abstracting: (18<=pil2_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AG [~ [A [~ [A [8<=pol1_1_1 U 20<=pb3_1_1]] U AG [AX [14<=pil1_1_1]]]]]]
normalized: E [true U [~ [EG [E [true U EX [~ [14<=pil1_1_1]]]]] & ~ [E [E [true U EX [~ [14<=pil1_1_1]]] U [E [true U EX [~ [14<=pil1_1_1]]] & [~ [EG [~ [20<=pb3_1_1]]] & ~ [E [~ [20<=pb3_1_1] U [~ [8<=pol1_1_1] & ~ [20<=pb3_1_1]]]]]]]]]]

abstracting: (20<=pb3_1_1)
states: 47,472 (4)
abstracting: (8<=pol1_1_1)
states: 0
abstracting: (20<=pb3_1_1)
states: 47,472 (4)
abstracting: (20<=pb3_1_1)
states: 47,472 (4)
.
EG iterations: 1
abstracting: (14<=pil1_1_1)
states: 0
.abstracting: (14<=pil1_1_1)
states: 0
.abstracting: (14<=pil1_1_1)
states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

checking: AF [AG [EX [[~ [E [1<=pb3_1_1 U 13<=pb3_1_1]] | [EX [1<=pil1_1_1] | EX [20<=pi2_1_1]]]]]]
normalized: ~ [EG [E [true U ~ [EX [[[EX [20<=pi2_1_1] | EX [1<=pil1_1_1]] | ~ [E [1<=pb3_1_1 U 13<=pb3_1_1]]]]]]]]

abstracting: (13<=pb3_1_1)
states: 66,288 (4)
abstracting: (1<=pb3_1_1)
states: 105,840 (5)
abstracting: (1<=pil1_1_1)
states: 55,712 (4)
.abstracting: (20<=pi2_1_1)
states: 0
...
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AF [[5<=pi1_1_1 | EF [[15<=pbl_1_1 | [~ [EX [12<=pb1_1_1]] & ~ [pol2_1_1<=18]]]]]]
normalized: ~ [EG [~ [[E [true U [[~ [pol2_1_1<=18] & ~ [EX [12<=pb1_1_1]]] | 15<=pbl_1_1]] | 5<=pi1_1_1]]]]

abstracting: (5<=pi1_1_1)
states: 0
abstracting: (15<=pbl_1_1)
states: 0
abstracting: (12<=pb1_1_1)
states: 69,232 (4)
.abstracting: (pol2_1_1<=18)
states: 109,552 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [AF [AG [[[[po2_1_1<=1 & 17<=pb1_1_1] | AF [1<=po3_1_1]] | po3_1_1<=pol3_1_1]]]]
normalized: EG [~ [EG [E [true U ~ [[[~ [EG [~ [1<=po3_1_1]]] | [po2_1_1<=1 & 17<=pb1_1_1]] | po3_1_1<=pol3_1_1]]]]]]

abstracting: (po3_1_1<=pol3_1_1)
states: 55,712 (4)
abstracting: (17<=pb1_1_1)
states: 55,152 (4)
abstracting: (po2_1_1<=1)
states: 109,552 (5)
abstracting: (1<=po3_1_1)
states: 53,840 (4)
..
EG iterations: 2
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EF [~ [A [E [pi3_1_1<=0 U 14<=pbl_1_1] U A [pol2_1_1<=pi3_1_1 U po2_1_1<=4]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [EG [~ [po2_1_1<=4]]] & ~ [E [~ [po2_1_1<=4] U [~ [pol2_1_1<=pi3_1_1] & ~ [po2_1_1<=4]]]]]]]] & ~ [E [~ [[~ [EG [~ [po2_1_1<=4]]] & ~ [E [~ [po2_1_1<=4] U [~ [pol2_1_1<=pi3_1_1] & ~ [po2_1_1<=4]]]]]] U [~ [E [pi3_1_1<=0 U 14<=pbl_1_1]] & ~ [[~ [EG [~ [po2_1_1<=4]]] & ~ [E [~ [po2_1_1<=4] U [~ [pol2_1_1<=pi3_1_1] & ~ [po2_1_1<=4]]]]]]]]]]]]]

abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
.
EG iterations: 1
abstracting: (14<=pbl_1_1)
states: 0
abstracting: (pi3_1_1<=0)
states: 55,712 (4)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
.
EG iterations: 1
abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
abstracting: (po2_1_1<=4)
states: 109,552 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[EF [[[EX [19<=pb1_1_1] & EG [5<=pbl_1_1]] & E [pb2_1_1<=pol2_1_1 U [pil1_1_1<=8 & 14<=pol3_1_1]]]] & ~ [EF [~ [pil3_1_1<=18]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [pil3_1_1<=18]]] & E [true U [E [pb2_1_1<=pol2_1_1 U [pil1_1_1<=8 & 14<=pol3_1_1]] & [EG [5<=pbl_1_1] & EX [19<=pb1_1_1]]]]]]]]

abstracting: (19<=pb1_1_1)
states: 49,968 (4)
.abstracting: (5<=pbl_1_1)
states: 11,116 (4)
...
EG iterations: 3
abstracting: (14<=pol3_1_1)
states: 0
abstracting: (pil1_1_1<=8)
states: 109,552 (5)
abstracting: (pb2_1_1<=pol2_1_1)
states: 5,552 (3)
abstracting: (pil3_1_1<=18)
states: 109,552 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AF [EF [[[AX [[pb3_1_1<=5 | 6<=pi3_1_1]] & pi1_1_1<=pb1_1_1] & ~ [A [[pi2_1_1<=pb3_1_1 & 2<=pil1_1_1] U ~ [pol1_1_1<=3]]]]]]
normalized: ~ [EG [~ [E [true U [~ [[~ [EG [pol1_1_1<=3]] & ~ [E [pol1_1_1<=3 U [pol1_1_1<=3 & ~ [[pi2_1_1<=pb3_1_1 & 2<=pil1_1_1]]]]]]] & [pi1_1_1<=pb1_1_1 & ~ [EX [~ [[pb3_1_1<=5 | 6<=pi3_1_1]]]]]]]]]]

abstracting: (6<=pi3_1_1)
states: 0
abstracting: (pb3_1_1<=5)
states: 21,312 (4)
.abstracting: (pi1_1_1<=pb1_1_1)
states: 107,712 (5)
abstracting: (2<=pil1_1_1)
states: 0
abstracting: (pi2_1_1<=pb3_1_1)
states: 107,712 (5)
abstracting: (pol1_1_1<=3)
states: 109,552 (5)
abstracting: (pol1_1_1<=3)
states: 109,552 (5)
abstracting: (pol1_1_1<=3)
states: 109,552 (5)

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

FORMULA TriangularGrid-PT-1200-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: EF [A [AX [[[EF [12<=pil1_1_1] & EG [5<=pb3_1_1]] | [[20<=po2_1_1 & pi3_1_1<=pb1_1_1] & AF [pol2_1_1<=pol1_1_1]]]] U 4<=pi3_1_1]]
normalized: E [true U [~ [EG [~ [4<=pi3_1_1]]] & ~ [E [~ [4<=pi3_1_1] U [EX [~ [[[~ [EG [~ [pol2_1_1<=pol1_1_1]]] & [20<=po2_1_1 & pi3_1_1<=pb1_1_1]] | [EG [5<=pb3_1_1] & E [true U 12<=pil1_1_1]]]]] & ~ [4<=pi3_1_1]]]]]]

abstracting: (4<=pi3_1_1)
states: 0
abstracting: (12<=pil1_1_1)
states: 0
abstracting: (5<=pb3_1_1)
states: 91,632 (4)
.
EG iterations: 1
abstracting: (pi3_1_1<=pb1_1_1)
states: 107,712 (5)
abstracting: (20<=po2_1_1)
states: 0
abstracting: (pol2_1_1<=pol1_1_1)
states: 82,168 (4)
.....................................................................................................................................................................................
EG iterations: 181
.abstracting: (4<=pi3_1_1)
states: 0
abstracting: (4<=pi3_1_1)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.729sec

checking: AG [[EG [11<=pi1_1_1] & AF [[E [[pi3_1_1<=14 & 8<=po2_1_1] U [pil1_1_1<=pb1_1_1 | po1_1_1<=20]] & [EG [4<=po3_1_1] & pbl_1_1<=3]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[E [[pi3_1_1<=14 & 8<=po2_1_1] U [pil1_1_1<=pb1_1_1 | po1_1_1<=20]] & [pbl_1_1<=3 & EG [4<=po3_1_1]]]]]] & EG [11<=pi1_1_1]]]]]

abstracting: (11<=pi1_1_1)
states: 0
.
EG iterations: 1
abstracting: (4<=po3_1_1)
states: 0
.
EG iterations: 1
abstracting: (pbl_1_1<=3)
states: 73,641 (4)
abstracting: (po1_1_1<=20)
states: 109,552 (5)
abstracting: (pil1_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (8<=po2_1_1)
states: 0
abstracting: (pi3_1_1<=14)
states: 109,552 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AF [EF [[[AX [14<=pil1_1_1] & 4<=pb2_1_1] & ~ [AG [20<=pol1_1_1]]]]] | A [AG [EX [~ [1<=pol3_1_1]]] U EG [[pil1_1_1<=pi2_1_1 & E [pi2_1_1<=14 U [po3_1_1<=pi2_1_1 & pol1_1_1<=14]]]]]]
normalized: [[~ [EG [~ [EG [[pil1_1_1<=pi2_1_1 & E [pi2_1_1<=14 U [po3_1_1<=pi2_1_1 & pol1_1_1<=14]]]]]]] & ~ [E [~ [EG [[pil1_1_1<=pi2_1_1 & E [pi2_1_1<=14 U [po3_1_1<=pi2_1_1 & pol1_1_1<=14]]]]] U [E [true U ~ [EX [~ [1<=pol3_1_1]]]] & ~ [EG [[pil1_1_1<=pi2_1_1 & E [pi2_1_1<=14 U [po3_1_1<=pi2_1_1 & pol1_1_1<=14]]]]]]]]] | ~ [EG [~ [E [true U [E [true U ~ [20<=pol1_1_1]] & [4<=pb2_1_1 & ~ [EX [~ [14<=pil1_1_1]]]]]]]]]]

abstracting: (14<=pil1_1_1)
states: 0
.abstracting: (4<=pb2_1_1)
states: 95,088 (4)
abstracting: (20<=pol1_1_1)
states: 0

EG iterations: 0
abstracting: (pol1_1_1<=14)
states: 109,552 (5)
abstracting: (po3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (pi2_1_1<=14)
states: 109,552 (5)
abstracting: (pil1_1_1<=pi2_1_1)
states: 81,224 (4)
...
EG iterations: 3
abstracting: (1<=pol3_1_1)
states: 55,712 (4)
.abstracting: (pol1_1_1<=14)
states: 109,552 (5)
abstracting: (po3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (pi2_1_1<=14)
states: 109,552 (5)
abstracting: (pil1_1_1<=pi2_1_1)
states: 81,224 (4)
...
EG iterations: 3
abstracting: (pol1_1_1<=14)
states: 109,552 (5)
abstracting: (po3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (pi2_1_1<=14)
states: 109,552 (5)
abstracting: (pil1_1_1<=pi2_1_1)
states: 81,224 (4)
...
EG iterations: 3
..................................................................................................................................................................................
EG iterations: 178
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.881sec

checking: [~ [AF [AG [[7<=pil3_1_1 | EG [pil2_1_1<=2]]]]] & [~ [EG [AG [[[pil1_1_1<=13 | 9<=pol1_1_1] | A [pol1_1_1<=17 U 10<=pbl_1_1]]]]] | AX [[[A [po3_1_1<=10 U pil2_1_1<=19] & pi1_1_1<=15] & EF [E [pol1_1_1<=2 U 20<=pi2_1_1]]]]]]
normalized: [[~ [EX [~ [[[pi1_1_1<=15 & [~ [EG [~ [pil2_1_1<=19]]] & ~ [E [~ [pil2_1_1<=19] U [~ [po3_1_1<=10] & ~ [pil2_1_1<=19]]]]]] & E [true U E [pol1_1_1<=2 U 20<=pi2_1_1]]]]]] | ~ [EG [~ [E [true U ~ [[[~ [EG [~ [10<=pbl_1_1]]] & ~ [E [~ [10<=pbl_1_1] U [~ [pol1_1_1<=17] & ~ [10<=pbl_1_1]]]]] | [pil1_1_1<=13 | 9<=pol1_1_1]]]]]]]] & EG [E [true U ~ [[7<=pil3_1_1 | EG [pil2_1_1<=2]]]]]]

abstracting: (pil2_1_1<=2)
states: 109,552 (5)

EG iterations: 0
abstracting: (7<=pil3_1_1)
states: 0
.
EG iterations: 1
abstracting: (9<=pol1_1_1)
states: 0
abstracting: (pil1_1_1<=13)
states: 109,552 (5)
abstracting: (10<=pbl_1_1)
states: 0
abstracting: (pol1_1_1<=17)
states: 109,552 (5)
abstracting: (10<=pbl_1_1)
states: 0
abstracting: (10<=pbl_1_1)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (20<=pi2_1_1)
states: 0
abstracting: (pol1_1_1<=2)
states: 109,552 (5)
abstracting: (pil2_1_1<=19)
states: 109,552 (5)
abstracting: (po3_1_1<=10)
states: 109,552 (5)
abstracting: (pil2_1_1<=19)
states: 109,552 (5)
abstracting: (pil2_1_1<=19)
states: 109,552 (5)
.
EG iterations: 1
abstracting: (pi1_1_1<=15)
states: 109,552 (5)
.-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [[E [E [[~ [po3_1_1<=10] & [pol2_1_1<=po1_1_1 & pil3_1_1<=pol2_1_1]] U EF [po1_1_1<=pol3_1_1]] U 16<=pi1_1_1] & ~ [[A [[A [po1_1_1<=15 U pb3_1_1<=3] | ~ [pol3_1_1<=pil2_1_1]] U [[6<=po2_1_1 | pi1_1_1<=4] & ~ [pil2_1_1<=17]]] & AF [pi1_1_1<=pol3_1_1]]]]]
normalized: EG [[~ [[~ [EG [~ [pi1_1_1<=pol3_1_1]]] & [~ [EG [~ [[~ [pil2_1_1<=17] & [6<=po2_1_1 | pi1_1_1<=4]]]]] & ~ [E [~ [[~ [pil2_1_1<=17] & [6<=po2_1_1 | pi1_1_1<=4]]] U [~ [[~ [pol3_1_1<=pil2_1_1] | [~ [EG [~ [pb3_1_1<=3]]] & ~ [E [~ [pb3_1_1<=3] U [~ [po1_1_1<=15] & ~ [pb3_1_1<=3]]]]]]] & ~ [[~ [pil2_1_1<=17] & [6<=po2_1_1 | pi1_1_1<=4]]]]]]]]] & E [E [[[pol2_1_1<=po1_1_1 & pil3_1_1<=pol2_1_1] & ~ [po3_1_1<=10]] U E [true U po1_1_1<=pol3_1_1]] U 16<=pi1_1_1]]]

abstracting: (16<=pi1_1_1)
states: 0
abstracting: (po1_1_1<=pol3_1_1)
states: 83,096 (4)
abstracting: (po3_1_1<=10)
states: 109,552 (5)
abstracting: (pil3_1_1<=pol2_1_1)
states: 82,168 (4)
abstracting: (pol2_1_1<=po1_1_1)
states: 81,224 (4)
abstracting: (pi1_1_1<=4)
states: 109,552 (5)
abstracting: (6<=po2_1_1)
states: 0
abstracting: (pil2_1_1<=17)
states: 109,552 (5)
abstracting: (pb3_1_1<=3)
states: 14,464 (4)
abstracting: (po1_1_1<=15)
states: 109,552 (5)
abstracting: (pb3_1_1<=3)
states: 14,464 (4)
abstracting: (pb3_1_1<=3)
states: 14,464 (4)
.
EG iterations: 1
abstracting: (pol3_1_1<=pil2_1_1)
states: 82,168 (4)
abstracting: (pi1_1_1<=4)
states: 109,552 (5)
abstracting: (6<=po2_1_1)
states: 0
abstracting: (pil2_1_1<=17)
states: 109,552 (5)
abstracting: (pi1_1_1<=4)
states: 109,552 (5)
abstracting: (6<=po2_1_1)
states: 0
abstracting: (pil2_1_1<=17)
states: 109,552 (5)

EG iterations: 0
abstracting: (pi1_1_1<=pol3_1_1)
states: 83,096 (4)
..................................................................................................................................................................................
EG iterations: 178
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.420sec

checking: [~ [AF [EG [AG [[pil1_1_1<=19 | pb2_1_1<=pil1_1_1]]]]] | [EX [~ [11<=pol3_1_1]] & E [AG [[A [pb1_1_1<=pi1_1_1 U 19<=pb1_1_1] & E [12<=pbl_1_1 U pi2_1_1<=pi3_1_1]]] U [[[AF [pbl_1_1<=10] | 4<=pb1_1_1] | [~ [A [17<=pil1_1_1 U pb1_1_1<=3]] | [EX [po1_1_1<=6] & ~ [po1_1_1<=13]]]] & E [~ [EG [pb3_1_1<=pi2_1_1]] U ~ [AG [10<=pb2_1_1]]]]]]]
normalized: [[E [~ [E [true U ~ [[E [12<=pbl_1_1 U pi2_1_1<=pi3_1_1] & [~ [EG [~ [19<=pb1_1_1]]] & ~ [E [~ [19<=pb1_1_1] U [~ [pb1_1_1<=pi1_1_1] & ~ [19<=pb1_1_1]]]]]]]]] U [E [~ [EG [pb3_1_1<=pi2_1_1]] U E [true U ~ [10<=pb2_1_1]]] & [[[~ [po1_1_1<=13] & EX [po1_1_1<=6]] | ~ [[~ [EG [~ [pb1_1_1<=3]]] & ~ [E [~ [pb1_1_1<=3] U [~ [17<=pil1_1_1] & ~ [pb1_1_1<=3]]]]]]] | [4<=pb1_1_1 | ~ [EG [~ [pbl_1_1<=10]]]]]]] & EX [~ [11<=pol3_1_1]]] | EG [~ [EG [~ [E [true U ~ [[pil1_1_1<=19 | pb2_1_1<=pil1_1_1]]]]]]]]

abstracting: (pb2_1_1<=pil1_1_1)
states: 5,552 (3)
abstracting: (pil1_1_1<=19)
states: 109,552 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (11<=pol3_1_1)
states: 0
.abstracting: (pbl_1_1<=10)
states: 109,552 (5)
.
EG iterations: 1
abstracting: (4<=pb1_1_1)
states: 95,088 (4)
abstracting: (pb1_1_1<=3)
states: 14,464 (4)
abstracting: (17<=pil1_1_1)
states: 0
abstracting: (pb1_1_1<=3)
states: 14,464 (4)
abstracting: (pb1_1_1<=3)
states: 14,464 (4)
.
EG iterations: 1
abstracting: (po1_1_1<=6)
states: 109,552 (5)
.abstracting: (po1_1_1<=13)
states: 109,552 (5)
abstracting: (10<=pb2_1_1)
states: 75,312 (4)
abstracting: (pb3_1_1<=pi2_1_1)
states: 5,520 (3)
.
EG iterations: 1
abstracting: (19<=pb1_1_1)
states: 49,968 (4)
abstracting: (pb1_1_1<=pi1_1_1)
states: 5,520 (3)
abstracting: (19<=pb1_1_1)
states: 49,968 (4)
abstracting: (19<=pb1_1_1)
states: 49,968 (4)
.
EG iterations: 1
abstracting: (pi2_1_1<=pi3_1_1)
states: 82,168 (4)
abstracting: (12<=pbl_1_1)
states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

totally nodes used: 338596 (3.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14916698 958707 15875405
used/not used/entry size/cache size: 1225572 65883292 16 1024MB
basic ops cache: hits/miss/sum: 3804900 367306 4172206
used/not used/entry size/cache size: 714707 16062509 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: 96160 7515 103675
used/not used/entry size/cache size: 7512 8381096 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 66882004
1 176171
2 24661
3 14242
4 4297
5 3014
6 2235
7 1497
8 437
9 139
>= 10 167

Total processing time: 0m 7.087sec


BK_STOP 1679863970731

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


iterations count:1232 (102), effective:320 (26)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

iterations count:452 (37), effective:120 (10)

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

iterations count:276 (23), effective:72 (6)

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

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

iterations count:1208 (100), effective:164 (13)

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

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

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

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

iterations count:41 (3), effective:7 (0)

iterations count:1328 (110), effective:356 (29)

iterations count:41 (3), effective:7 (0)

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

iterations count:41 (3), effective:7 (0)

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

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

iterations count:100 (8), effective:24 (2)

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

iterations count:714 (59), effective:150 (12)

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

iterations count:53 (4), effective:9 (0)

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

iterations count:301 (25), effective:123 (10)

iterations count:12 (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="TriangularGrid-PT-1200"
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 TriangularGrid-PT-1200, 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-167912692300705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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