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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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
-rw-r--r-- 1 mcc users 2.2K 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 Sudoku-PT-BN01-CTLCardinality-00
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-01
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-02
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-03
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-04
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-05
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-06
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-07
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-08
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-09
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-10
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-11
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-12
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-13
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-14
FORMULA_NAME Sudoku-PT-BN01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679157146607

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=Sudoku-PT-BN01
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: Sudoku_PT_BN01
(NrP: 5 NrTr: 1 NrArc: 5)

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

net check time: 0m 0.000sec

init dd package: 0m 2.845sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 9 (9.0e+00) #states 2



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

checking: ~ [[EG [AX [~ [AG [Board_0_0_0<=Cells_0_0]]]] & EG [AF [AX [~ [Rows_0_0<=11]]]]]]
normalized: ~ [[EG [~ [EG [EX [Rows_0_0<=11]]]] & EG [~ [EX [~ [E [true U ~ [Board_0_0_0<=Cells_0_0]]]]]]]]

abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
.
EG iterations: 0
abstracting: (Rows_0_0<=11)
states: 2
...
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [AF [AX [[1<=Board_0_0_0 | ~ [Columns_0_0<=Board_0_0_0]]]]] & EG [Rows_0_0<=1]]
normalized: [EG [Rows_0_0<=1] & EX [~ [EG [EX [~ [[~ [Columns_0_0<=Board_0_0_0] | 1<=Board_0_0_0]]]]]]]

abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
..
EG iterations: 1
.abstracting: (Rows_0_0<=1)
states: 2

EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AF [A [~ [[[Columns_0_0<=2 | 40<=Regions_0_0] & ~ [Regions_0_0<=Rows_0_0]]] U EG [~ [Cells_0_0<=Columns_0_0]]]]]
normalized: EG [~ [[~ [EG [~ [EG [~ [Cells_0_0<=Columns_0_0]]]]] & ~ [E [~ [EG [~ [Cells_0_0<=Columns_0_0]]] U [[~ [Regions_0_0<=Rows_0_0] & [Columns_0_0<=2 | 40<=Regions_0_0]] & ~ [EG [~ [Cells_0_0<=Columns_0_0]]]]]]]]]

abstracting: (Cells_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1
abstracting: (40<=Regions_0_0)
states: 0
abstracting: (Columns_0_0<=2)
states: 2
abstracting: (Regions_0_0<=Rows_0_0)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EG [EG [[[EF [1<=Regions_0_0] | [~ [Rows_0_0<=0] | 1<=Columns_0_0]] | [AG [1<=Cells_0_0] | Regions_0_0<=Rows_0_0]]]]]
normalized: ~ [EG [EG [[[~ [E [true U ~ [1<=Cells_0_0]]] | Regions_0_0<=Rows_0_0] | [[~ [Rows_0_0<=0] | 1<=Columns_0_0] | E [true U 1<=Regions_0_0]]]]]]

abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Rows_0_0)
states: 2
abstracting: (1<=Cells_0_0)
states: 1

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [~ [EG [[[[Board_0_0_0<=0 & Board_0_0_0<=Columns_0_0] & [Board_0_0_0<=0 & Cells_0_0<=Rows_0_0]] | EF [Regions_0_0<=Board_0_0_0]]]]]
normalized: EX [~ [EG [[E [true U Regions_0_0<=Board_0_0_0] | [[Board_0_0_0<=0 & Cells_0_0<=Rows_0_0] & [Board_0_0_0<=0 & Board_0_0_0<=Columns_0_0]]]]]]

abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Board_0_0_0)
states: 1

EG iterations: 0
.-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [EX [[Columns_0_0<=0 | ~ [[Columns_0_0<=Rows_0_0 | [AX [Board_0_0_0<=Rows_0_0] | Board_0_0_0<=Cells_0_0]]]]] U EX [AF [EG [~ [Board_0_0_0<=Regions_0_0]]]]]
normalized: [~ [EG [~ [EX [~ [EG [~ [EG [~ [Board_0_0_0<=Regions_0_0]]]]]]]]] & ~ [E [~ [EX [~ [EG [~ [EG [~ [Board_0_0_0<=Regions_0_0]]]]]]] U [~ [EX [[~ [[[~ [EX [~ [Board_0_0_0<=Rows_0_0]]] | Board_0_0_0<=Cells_0_0] | Columns_0_0<=Rows_0_0]] | Columns_0_0<=0]]] & ~ [EX [~ [EG [~ [EG [~ [Board_0_0_0<=Regions_0_0]]]]]]]]]]]

abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
.abstracting: (Columns_0_0<=0)
states: 1
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
..abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
.abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[AX [~ [[AX [[34<=Rows_0_0 & 67<=Board_0_0_0]] | AG [~ [23<=Cells_0_0]]]]] | [~ [[~ [AF [15<=Board_0_0_0]] & [AF [~ [Board_0_0_0<=Columns_0_0]] | EX [A [Columns_0_0<=Cells_0_0 U Rows_0_0<=Cells_0_0]]]]] & EX [AF [AX [Board_0_0_0<=86]]]]]]
normalized: ~ [[[~ [[[EX [[~ [EG [~ [Rows_0_0<=Cells_0_0]]] & ~ [E [~ [Rows_0_0<=Cells_0_0] U [~ [Columns_0_0<=Cells_0_0] & ~ [Rows_0_0<=Cells_0_0]]]]]] | ~ [EG [Board_0_0_0<=Columns_0_0]]] & EG [~ [15<=Board_0_0_0]]]] & EX [~ [EG [EX [~ [Board_0_0_0<=86]]]]]] | ~ [EX [[~ [E [true U 23<=Cells_0_0]] | ~ [EX [~ [[34<=Rows_0_0 & 67<=Board_0_0_0]]]]]]]]]

abstracting: (67<=Board_0_0_0)
states: 0
abstracting: (34<=Rows_0_0)
states: 0
.abstracting: (23<=Cells_0_0)
states: 0
.abstracting: (Board_0_0_0<=86)
states: 2
..
EG iterations: 1
.abstracting: (15<=Board_0_0_0)
states: 0

EG iterations: 0
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
..
EG iterations: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [E [~ [[AG [Rows_0_0<=Regions_0_0] | [[81<=Columns_0_0 | Columns_0_0<=78] & Columns_0_0<=Rows_0_0]]] U [Columns_0_0<=15 | A [[14<=Regions_0_0 | Cells_0_0<=Cells_0_0] U [8<=Columns_0_0 & 68<=Board_0_0_0]]]]] & AF [EG [AX [[~ [14<=Cells_0_0] & ~ [5<=Rows_0_0]]]]]]
normalized: [~ [EX [~ [E [~ [[[[81<=Columns_0_0 | Columns_0_0<=78] & Columns_0_0<=Rows_0_0] | ~ [E [true U ~ [Rows_0_0<=Regions_0_0]]]]] U [[~ [EG [~ [[8<=Columns_0_0 & 68<=Board_0_0_0]]]] & ~ [E [~ [[8<=Columns_0_0 & 68<=Board_0_0_0]] U [~ [[14<=Regions_0_0 | Cells_0_0<=Cells_0_0]] & ~ [[8<=Columns_0_0 & 68<=Board_0_0_0]]]]]] | Columns_0_0<=15]]]]] & ~ [EG [~ [EG [~ [EX [~ [[~ [5<=Rows_0_0] & ~ [14<=Cells_0_0]]]]]]]]]]

abstracting: (14<=Cells_0_0)
states: 0
abstracting: (5<=Rows_0_0)
states: 0
.
EG iterations: 0
.
EG iterations: 1
abstracting: (Columns_0_0<=15)
states: 2
abstracting: (68<=Board_0_0_0)
states: 0
abstracting: (8<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (14<=Regions_0_0)
states: 0
abstracting: (68<=Board_0_0_0)
states: 0
abstracting: (8<=Columns_0_0)
states: 0
abstracting: (68<=Board_0_0_0)
states: 0
abstracting: (8<=Columns_0_0)
states: 0

EG iterations: 0
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
abstracting: (Columns_0_0<=78)
states: 2
abstracting: (81<=Columns_0_0)
states: 0
.-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [[[[EG [[Regions_0_0<=Regions_0_0 & 1<=Regions_0_0]] | Cells_0_0<=0] | Rows_0_0<=Board_0_0_0] & A [~ [EG [1<=Rows_0_0]] U [[EX [1<=Columns_0_0] & 1<=Rows_0_0] & ~ [1<=Rows_0_0]]]]] | EX [[[EX [Cells_0_0<=Columns_0_0] & Board_0_0_0<=0] | ~ [AX [Columns_0_0<=0]]]]]
normalized: [EX [[EX [~ [Columns_0_0<=0]] | [EX [Cells_0_0<=Columns_0_0] & Board_0_0_0<=0]]] | ~ [EX [~ [[[~ [EG [~ [[~ [1<=Rows_0_0] & [EX [1<=Columns_0_0] & 1<=Rows_0_0]]]]] & ~ [E [~ [[~ [1<=Rows_0_0] & [EX [1<=Columns_0_0] & 1<=Rows_0_0]]] U [EG [1<=Rows_0_0] & ~ [[~ [1<=Rows_0_0] & [EX [1<=Columns_0_0] & 1<=Rows_0_0]]]]]]] & [[EG [[Regions_0_0<=Regions_0_0 & 1<=Regions_0_0]] | Cells_0_0<=0] | Rows_0_0<=Board_0_0_0]]]]]]

abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
..
EG iterations: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
.abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
..
EG iterations: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
.abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
.abstracting: (1<=Rows_0_0)
states: 1

EG iterations: 0
.abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
.abstracting: (Columns_0_0<=0)
states: 1
..-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [~ [EG [[~ [[EF [Columns_0_0<=Board_0_0_0] & [Columns_0_0<=Columns_0_0 & Board_0_0_0<=18]]] | 7<=Board_0_0_0]]] & A [[Board_0_0_0<=28 | [~ [[EF [Columns_0_0<=61] | [~ [Regions_0_0<=57] & [Board_0_0_0<=Board_0_0_0 | 37<=Cells_0_0]]]] & EX [EG [97<=Regions_0_0]]]] U [~ [Rows_0_0<=84] & EX [EX [AF [Rows_0_0<=Rows_0_0]]]]]]
normalized: [[~ [EG [~ [[EX [EX [~ [EG [~ [Rows_0_0<=Rows_0_0]]]]] & ~ [Rows_0_0<=84]]]]] & ~ [E [~ [[EX [EX [~ [EG [~ [Rows_0_0<=Rows_0_0]]]]] & ~ [Rows_0_0<=84]]] U [~ [[[EX [EG [97<=Regions_0_0]] & ~ [[[[Board_0_0_0<=Board_0_0_0 | 37<=Cells_0_0] & ~ [Regions_0_0<=57]] | E [true U Columns_0_0<=61]]]] | Board_0_0_0<=28]] & ~ [[EX [EX [~ [EG [~ [Rows_0_0<=Rows_0_0]]]]] & ~ [Rows_0_0<=84]]]]]]] & ~ [EG [[~ [[[Columns_0_0<=Columns_0_0 & Board_0_0_0<=18] & E [true U Columns_0_0<=Board_0_0_0]]] | 7<=Board_0_0_0]]]]

abstracting: (7<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=18)
states: 2
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1
abstracting: (Rows_0_0<=84)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
.
EG iterations: 1
..abstracting: (Board_0_0_0<=28)
states: 2
abstracting: (Columns_0_0<=61)
states: 2
abstracting: (Regions_0_0<=57)
states: 2
abstracting: (37<=Cells_0_0)
states: 0
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (97<=Regions_0_0)
states: 0
.
EG iterations: 1
.abstracting: (Rows_0_0<=84)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
.
EG iterations: 1
..abstracting: (Rows_0_0<=84)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
.
EG iterations: 1
..
EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [A [[[1<=Columns_0_0 | Rows_0_0<=Cells_0_0] | [[~ [[Cells_0_0<=1 | Columns_0_0<=Rows_0_0]] | EG [Cells_0_0<=Cells_0_0]] | [[~ [Board_0_0_0<=Regions_0_0] & 1<=Board_0_0_0] | [[1<=Board_0_0_0 & 1<=Cells_0_0] & [Board_0_0_0<=0 & Regions_0_0<=Board_0_0_0]]]]] U 1<=Regions_0_0]]
normalized: EX [[~ [EG [~ [1<=Regions_0_0]]] & ~ [E [~ [1<=Regions_0_0] U [~ [[[[[[Board_0_0_0<=0 & Regions_0_0<=Board_0_0_0] & [1<=Board_0_0_0 & 1<=Cells_0_0]] | [~ [Board_0_0_0<=Regions_0_0] & 1<=Board_0_0_0]] | [EG [Cells_0_0<=Cells_0_0] | ~ [[Cells_0_0<=1 | Columns_0_0<=Rows_0_0]]]] | [1<=Columns_0_0 | Rows_0_0<=Cells_0_0]]] & ~ [1<=Regions_0_0]]]]]]

abstracting: (1<=Regions_0_0)
states: 1
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
abstracting: (Cells_0_0<=1)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2

EG iterations: 0
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [A [Rows_0_0<=Cells_0_0 U [[~ [Rows_0_0<=0] | [Regions_0_0<=Regions_0_0 | [[EF [1<=Columns_0_0] & [Rows_0_0<=1 & Regions_0_0<=0]] | 1<=Rows_0_0]]] & [[EG [E [Rows_0_0<=1 U 1<=Rows_0_0]] & [[~ [Regions_0_0<=1] & [1<=Cells_0_0 & 1<=Columns_0_0]] & AG [Board_0_0_0<=Board_0_0_0]]] | ~ [A [Columns_0_0<=1 U EX [Cells_0_0<=Cells_0_0]]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [[~ [EG [~ [EX [Cells_0_0<=Cells_0_0]]]] & ~ [E [~ [EX [Cells_0_0<=Cells_0_0]] U [~ [Columns_0_0<=1] & ~ [EX [Cells_0_0<=Cells_0_0]]]]]]] | [[~ [E [true U ~ [Board_0_0_0<=Board_0_0_0]]] & [[1<=Cells_0_0 & 1<=Columns_0_0] & ~ [Regions_0_0<=1]]] & EG [E [Rows_0_0<=1 U 1<=Rows_0_0]]]] & [[[[[Rows_0_0<=1 & Regions_0_0<=0] & E [true U 1<=Columns_0_0]] | 1<=Rows_0_0] | Regions_0_0<=Regions_0_0] | ~ [Rows_0_0<=0]]]]]] & ~ [E [~ [[[~ [[~ [EG [~ [EX [Cells_0_0<=Cells_0_0]]]] & ~ [E [~ [EX [Cells_0_0<=Cells_0_0]] U [~ [Columns_0_0<=1] & ~ [EX [Cells_0_0<=Cells_0_0]]]]]]] | [[~ [E [true U ~ [Board_0_0_0<=Board_0_0_0]]] & [[1<=Cells_0_0 & 1<=Columns_0_0] & ~ [Regions_0_0<=1]]] & EG [E [Rows_0_0<=1 U 1<=Rows_0_0]]]] & [[[[[Rows_0_0<=1 & Regions_0_0<=0] & E [true U 1<=Columns_0_0]] | 1<=Rows_0_0] | Regions_0_0<=Regions_0_0] | ~ [Rows_0_0<=0]]]] U [~ [Rows_0_0<=Cells_0_0] & ~ [[[~ [[~ [EG [~ [EX [Cells_0_0<=Cells_0_0]]]] & ~ [E [~ [EX [Cells_0_0<=Cells_0_0]] U [~ [Columns_0_0<=1] & ~ [EX [Cells_0_0<=Cells_0_0]]]]]]] | [[~ [E [true U ~ [Board_0_0_0<=Board_0_0_0]]] & [[1<=Cells_0_0 & 1<=Columns_0_0] & ~ [Regions_0_0<=1]]] & EG [E [Rows_0_0<=1 U 1<=Rows_0_0]]]] & [[[[[Rows_0_0<=1 & Regions_0_0<=0] & E [true U 1<=Columns_0_0]] | 1<=Rows_0_0] | Regions_0_0<=Regions_0_0] | ~ [Rows_0_0<=0]]]]]]]]]

abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Regions_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
..
EG iterations: 2
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Cells_0_0<=Cells_0_0)
states: 2
..
EG iterations: 1
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Regions_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
..
EG iterations: 2
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Cells_0_0<=Cells_0_0)
states: 2
..
EG iterations: 1
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Regions_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
..
EG iterations: 2
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
.abstracting: (Cells_0_0<=Cells_0_0)
states: 2
..
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EX [[A [[EX [28<=Columns_0_0] & ~ [[Rows_0_0<=97 & Board_0_0_0<=Columns_0_0]]] U ~ [A [Rows_0_0<=Board_0_0_0 U Regions_0_0<=Cells_0_0]]] & Columns_0_0<=Cells_0_0]] | [AX [~ [A [EF [Rows_0_0<=52] U [AX [Regions_0_0<=99] & Board_0_0_0<=39]]]] | EG [E [[AG [Regions_0_0<=Regions_0_0] & [[89<=Rows_0_0 & Columns_0_0<=13] | 22<=Columns_0_0]] U [[Cells_0_0<=92 | ~ [Regions_0_0<=Cells_0_0]] & Cells_0_0<=2]]]]]
normalized: [[EG [E [[[[89<=Rows_0_0 & Columns_0_0<=13] | 22<=Columns_0_0] & ~ [E [true U ~ [Regions_0_0<=Regions_0_0]]]] U [[~ [Regions_0_0<=Cells_0_0] | Cells_0_0<=92] & Cells_0_0<=2]]] | ~ [EX [[~ [EG [~ [[~ [EX [~ [Regions_0_0<=99]]] & Board_0_0_0<=39]]]] & ~ [E [~ [[~ [EX [~ [Regions_0_0<=99]]] & Board_0_0_0<=39]] U [~ [E [true U Rows_0_0<=52]] & ~ [[~ [EX [~ [Regions_0_0<=99]]] & Board_0_0_0<=39]]]]]]]]] | EX [[[~ [EG [[~ [EG [~ [Regions_0_0<=Cells_0_0]]] & ~ [E [~ [Regions_0_0<=Cells_0_0] U [~ [Rows_0_0<=Board_0_0_0] & ~ [Regions_0_0<=Cells_0_0]]]]]]] & ~ [E [[~ [EG [~ [Regions_0_0<=Cells_0_0]]] & ~ [E [~ [Regions_0_0<=Cells_0_0] U [~ [Rows_0_0<=Board_0_0_0] & ~ [Regions_0_0<=Cells_0_0]]]]] U [~ [[~ [[Rows_0_0<=97 & Board_0_0_0<=Columns_0_0]] & EX [28<=Columns_0_0]]] & [~ [EG [~ [Regions_0_0<=Cells_0_0]]] & ~ [E [~ [Regions_0_0<=Cells_0_0] U [~ [Rows_0_0<=Board_0_0_0] & ~ [Regions_0_0<=Cells_0_0]]]]]]]]] & Columns_0_0<=Cells_0_0]]]

abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
.
EG iterations: 1
abstracting: (28<=Columns_0_0)
states: 0
.abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Rows_0_0<=97)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
.
EG iterations: 1
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
.
EG iterations: 1

EG iterations: 0
.abstracting: (Board_0_0_0<=39)
states: 2
abstracting: (Regions_0_0<=99)
states: 2
.abstracting: (Rows_0_0<=52)
states: 2
abstracting: (Board_0_0_0<=39)
states: 2
abstracting: (Regions_0_0<=99)
states: 2
.abstracting: (Board_0_0_0<=39)
states: 2
abstracting: (Regions_0_0<=99)
states: 2
..
EG iterations: 1
.abstracting: (Cells_0_0<=2)
states: 2
abstracting: (Cells_0_0<=92)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (22<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=13)
states: 2
abstracting: (89<=Rows_0_0)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [[A [~ [EG [AX [Cells_0_0<=1]]] U A [A [Regions_0_0<=Columns_0_0 U Board_0_0_0<=Rows_0_0] U AG [1<=Columns_0_0]]] | [AF [~ [[Rows_0_0<=1 & Cells_0_0<=0]]] | [A [Regions_0_0<=1 U [[1<=Rows_0_0 | Columns_0_0<=Columns_0_0] & ~ [Rows_0_0<=Columns_0_0]]] & [AF [[Regions_0_0<=Board_0_0_0 | 1<=Cells_0_0]] & [[~ [Cells_0_0<=Columns_0_0] | [Rows_0_0<=0 | 1<=Rows_0_0]] | Cells_0_0<=Regions_0_0]]]]]]
normalized: ~ [EX [~ [[[[[[[[Rows_0_0<=0 | 1<=Rows_0_0] | ~ [Cells_0_0<=Columns_0_0]] | Cells_0_0<=Regions_0_0] & ~ [EG [~ [[Regions_0_0<=Board_0_0_0 | 1<=Cells_0_0]]]]] & [~ [EG [~ [[~ [Rows_0_0<=Columns_0_0] & [1<=Rows_0_0 | Columns_0_0<=Columns_0_0]]]]] & ~ [E [~ [[~ [Rows_0_0<=Columns_0_0] & [1<=Rows_0_0 | Columns_0_0<=Columns_0_0]]] U [~ [Regions_0_0<=1] & ~ [[~ [Rows_0_0<=Columns_0_0] & [1<=Rows_0_0 | Columns_0_0<=Columns_0_0]]]]]]]] | ~ [EG [[Rows_0_0<=1 & Cells_0_0<=0]]]] | [~ [EG [~ [[~ [EG [E [true U ~ [1<=Columns_0_0]]]] & ~ [E [E [true U ~ [1<=Columns_0_0]] U [~ [[~ [EG [~ [Board_0_0_0<=Rows_0_0]]] & ~ [E [~ [Board_0_0_0<=Rows_0_0] U [~ [Regions_0_0<=Columns_0_0] & ~ [Board_0_0_0<=Rows_0_0]]]]]] & E [true U ~ [1<=Columns_0_0]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [1<=Columns_0_0]]]] & ~ [E [E [true U ~ [1<=Columns_0_0]] U [~ [[~ [EG [~ [Board_0_0_0<=Rows_0_0]]] & ~ [E [~ [Board_0_0_0<=Rows_0_0] U [~ [Regions_0_0<=Columns_0_0] & ~ [Board_0_0_0<=Rows_0_0]]]]]] & E [true U ~ [1<=Columns_0_0]]]]]]] U [EG [~ [EX [~ [Cells_0_0<=1]]]] & ~ [[~ [EG [E [true U ~ [1<=Columns_0_0]]]] & ~ [E [E [true U ~ [1<=Columns_0_0]] U [~ [[~ [EG [~ [Board_0_0_0<=Rows_0_0]]] & ~ [E [~ [Board_0_0_0<=Rows_0_0] U [~ [Regions_0_0<=Columns_0_0] & ~ [Board_0_0_0<=Rows_0_0]]]]]] & E [true U ~ [1<=Columns_0_0]]]]]]]]]]]]]]]

abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
.
EG iterations: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1

EG iterations: 0
abstracting: (Cells_0_0<=1)
states: 2
.
EG iterations: 0
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
.
EG iterations: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1

EG iterations: 0
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
.
EG iterations: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1

EG iterations: 0

EG iterations: 0
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
.
EG iterations: 1
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=Columns_0_0)
states: 2

EG iterations: 0
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Regions_0_0<=Board_0_0_0)
states: 1
.
EG iterations: 1
abstracting: (Cells_0_0<=Regions_0_0)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Rows_0_0<=0)
states: 1
.-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [A [[E [AX [40<=Columns_0_0] U [72<=Columns_0_0 & 95<=Regions_0_0]] | A [[2<=Board_0_0_0 & ~ [[18<=Regions_0_0 | 36<=Cells_0_0]]] U EG [[Regions_0_0<=40 & Rows_0_0<=Rows_0_0]]]] U [34<=Regions_0_0 & [[2<=Columns_0_0 & [[[25<=Columns_0_0 | Cells_0_0<=9] & ~ [Rows_0_0<=69]] | Board_0_0_0<=19]] | EF [Columns_0_0<=51]]]] & E [E [AG [Board_0_0_0<=Regions_0_0] U [[AG [Columns_0_0<=75] & [[Board_0_0_0<=81 & 81<=Rows_0_0] & ~ [Board_0_0_0<=91]]] | EG [AF [Rows_0_0<=Columns_0_0]]]] U [[[AX [AF [Rows_0_0<=Columns_0_0]] | [~ [EX [Rows_0_0<=Cells_0_0]] | 85<=Columns_0_0]] & [AG [Board_0_0_0<=Cells_0_0] | Cells_0_0<=97]] | Columns_0_0<=38]]]
normalized: [E [E [~ [E [true U ~ [Board_0_0_0<=Regions_0_0]]] U [EG [~ [EG [~ [Rows_0_0<=Columns_0_0]]]] | [[~ [Board_0_0_0<=91] & [Board_0_0_0<=81 & 81<=Rows_0_0]] & ~ [E [true U ~ [Columns_0_0<=75]]]]]] U [[[~ [E [true U ~ [Board_0_0_0<=Cells_0_0]]] | Cells_0_0<=97] & [[~ [EX [Rows_0_0<=Cells_0_0]] | 85<=Columns_0_0] | ~ [EX [EG [~ [Rows_0_0<=Columns_0_0]]]]]] | Columns_0_0<=38]] & [~ [EG [~ [[[E [true U Columns_0_0<=51] | [[[~ [Rows_0_0<=69] & [25<=Columns_0_0 | Cells_0_0<=9]] | Board_0_0_0<=19] & 2<=Columns_0_0]] & 34<=Regions_0_0]]]] & ~ [E [~ [[[E [true U Columns_0_0<=51] | [[[~ [Rows_0_0<=69] & [25<=Columns_0_0 | Cells_0_0<=9]] | Board_0_0_0<=19] & 2<=Columns_0_0]] & 34<=Regions_0_0]] U [~ [[[~ [EG [~ [EG [[Regions_0_0<=40 & Rows_0_0<=Rows_0_0]]]]] & ~ [E [~ [EG [[Regions_0_0<=40 & Rows_0_0<=Rows_0_0]]] U [~ [[~ [[18<=Regions_0_0 | 36<=Cells_0_0]] & 2<=Board_0_0_0]] & ~ [EG [[Regions_0_0<=40 & Rows_0_0<=Rows_0_0]]]]]]] | E [~ [EX [~ [40<=Columns_0_0]]] U [72<=Columns_0_0 & 95<=Regions_0_0]]]] & ~ [[[E [true U Columns_0_0<=51] | [[[~ [Rows_0_0<=69] & [25<=Columns_0_0 | Cells_0_0<=9]] | Board_0_0_0<=19] & 2<=Columns_0_0]] & 34<=Regions_0_0]]]]]]]

abstracting: (34<=Regions_0_0)
states: 0
abstracting: (2<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=19)
states: 2
abstracting: (Cells_0_0<=9)
states: 2
abstracting: (25<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=69)
states: 2
abstracting: (Columns_0_0<=51)
states: 2
abstracting: (95<=Regions_0_0)
states: 0
abstracting: (72<=Columns_0_0)
states: 0
abstracting: (40<=Columns_0_0)
states: 0
.abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Regions_0_0<=40)
states: 2

EG iterations: 0
abstracting: (2<=Board_0_0_0)
states: 0
abstracting: (36<=Cells_0_0)
states: 0
abstracting: (18<=Regions_0_0)
states: 0
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Regions_0_0<=40)
states: 2

EG iterations: 0
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Regions_0_0<=40)
states: 2

EG iterations: 0
.
EG iterations: 1
abstracting: (34<=Regions_0_0)
states: 0
abstracting: (2<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=19)
states: 2
abstracting: (Cells_0_0<=9)
states: 2
abstracting: (25<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=69)
states: 2
abstracting: (Columns_0_0<=51)
states: 2
abstracting: (34<=Regions_0_0)
states: 0
abstracting: (2<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=19)
states: 2
abstracting: (Cells_0_0<=9)
states: 2
abstracting: (25<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=69)
states: 2
abstracting: (Columns_0_0<=51)
states: 2

EG iterations: 0
abstracting: (Columns_0_0<=38)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1
.abstracting: (85<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
.abstracting: (Cells_0_0<=97)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (Columns_0_0<=75)
states: 2
abstracting: (81<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=81)
states: 2
abstracting: (Board_0_0_0<=91)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
.
EG iterations: 1

EG iterations: 0
abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
-> the formula is FALSE

FORMULA Sudoku-PT-BN01-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[[[[EX [AG [Regions_0_0<=Cells_0_0]] | [EF [Board_0_0_0<=Rows_0_0] & [AX [52<=Regions_0_0] | [Board_0_0_0<=13 | 89<=Regions_0_0]]]] | [A [EG [35<=Cells_0_0] U ~ [Rows_0_0<=Cells_0_0]] | [[~ [Cells_0_0<=Columns_0_0] | ~ [25<=Board_0_0_0]] | Board_0_0_0<=Columns_0_0]]] | [~ [AG [[Rows_0_0<=Regions_0_0 & 95<=Columns_0_0]]] & [40<=Columns_0_0 | [~ [[Columns_0_0<=58 & Cells_0_0<=9]] | [EX [Board_0_0_0<=Board_0_0_0] | [12<=Columns_0_0 | Regions_0_0<=95]]]]]] & [EX [Rows_0_0<=49] & [EG [Cells_0_0<=Cells_0_0] | [[Cells_0_0<=35 & E [Regions_0_0<=Rows_0_0 U 58<=Cells_0_0]] & ~ [[[Board_0_0_0<=62 & 81<=Rows_0_0] | [Cells_0_0<=Rows_0_0 & Regions_0_0<=Columns_0_0]]]]]]]]
normalized: ~ [EG [~ [[[[[[E [true U Board_0_0_0<=Rows_0_0] & [[Board_0_0_0<=13 | 89<=Regions_0_0] | ~ [EX [~ [52<=Regions_0_0]]]]] | EX [~ [E [true U ~ [Regions_0_0<=Cells_0_0]]]]] | [[[~ [25<=Board_0_0_0] | ~ [Cells_0_0<=Columns_0_0]] | Board_0_0_0<=Columns_0_0] | [~ [EG [Rows_0_0<=Cells_0_0]] & ~ [E [Rows_0_0<=Cells_0_0 U [~ [EG [35<=Cells_0_0]] & Rows_0_0<=Cells_0_0]]]]]] | [[[[[12<=Columns_0_0 | Regions_0_0<=95] | EX [Board_0_0_0<=Board_0_0_0]] | ~ [[Columns_0_0<=58 & Cells_0_0<=9]]] | 40<=Columns_0_0] & E [true U ~ [[Rows_0_0<=Regions_0_0 & 95<=Columns_0_0]]]]] & [[[~ [[[Cells_0_0<=Rows_0_0 & Regions_0_0<=Columns_0_0] | [Board_0_0_0<=62 & 81<=Rows_0_0]]] & [E [Regions_0_0<=Rows_0_0 U 58<=Cells_0_0] & Cells_0_0<=35]] | EG [Cells_0_0<=Cells_0_0]] & EX [Rows_0_0<=49]]]]]]

abstracting: (Rows_0_0<=49)
states: 2
.abstracting: (Cells_0_0<=Cells_0_0)
states: 2

EG iterations: 0
abstracting: (Cells_0_0<=35)
states: 2
abstracting: (58<=Cells_0_0)
states: 0
abstracting: (Regions_0_0<=Rows_0_0)
states: 2
abstracting: (81<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=62)
states: 2
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (95<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (40<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=9)
states: 2
abstracting: (Columns_0_0<=58)
states: 2
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
.abstracting: (Regions_0_0<=95)
states: 2
abstracting: (12<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (35<=Cells_0_0)
states: 0
.
EG iterations: 1
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2

EG iterations: 0
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (25<=Board_0_0_0)
states: 0
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
.abstracting: (52<=Regions_0_0)
states: 0
.abstracting: (89<=Regions_0_0)
states: 0
abstracting: (Board_0_0_0<=13)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-PT-BN01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 149 (1.5e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 122 11 133
used/not used/entry size/cache size: 17 67108847 16 1024MB
basic ops cache: hits/miss/sum: 308 506 814
used/not used/entry size/cache size: 656 16776560 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: 246 11 257
used/not used/entry size/cache size: 11 8388597 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 67108789
1 64
2 1
3 0
4 0
5 1
6 1
7 3
8 1
9 1
>= 10 3

Total processing time: 0m 4.521sec


BK_STOP 1679157151176

--------------------
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:2 (2), effective:1 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:1 (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="Sudoku-PT-BN01"
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 Sudoku-PT-BN01, 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-167912691800289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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