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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 09:33 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 3.6K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 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 1.9K 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-AN01-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN01-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679146291396

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN01
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Sudoku_PT_AN01
(NrP: 4 NrTr: 1 NrArc: 4)

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

net check time: 0m 0.000sec

init dd package: 0m 2.894sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 7 (7.0e+00) #states 2



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

checking: EF [Columns_0_0<=23]
normalized: E [true U Columns_0_0<=23]

abstracting: (Columns_0_0<=23)
states: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=Board_0_0_0]
normalized: E [true U 1<=Board_0_0_0]

abstracting: (1<=Board_0_0_0)
states: 1
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [Cells_0_0<=1]
normalized: ~ [E [true U ~ [Cells_0_0<=1]]]

abstracting: (Cells_0_0<=1)
states: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [1<=Board_0_0_0]]
normalized: ~ [E [true U 1<=Board_0_0_0]]

abstracting: (1<=Board_0_0_0)
states: 1
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [Columns_0_0<=Cells_0_0]
normalized: ~ [E [true U ~ [Columns_0_0<=Cells_0_0]]]

abstracting: (Columns_0_0<=Cells_0_0)
states: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [Cells_0_0<=Columns_0_0]
normalized: E [true U Cells_0_0<=Columns_0_0]

abstracting: (Cells_0_0<=Columns_0_0)
states: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[1<=Board_0_0_0 | ~ [1<=Cells_0_0]]]
normalized: E [true U [~ [1<=Cells_0_0] | 1<=Board_0_0_0]]

abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[Cells_0_0<=1 & ~ [Cells_0_0<=1]]]
normalized: E [true U [~ [Cells_0_0<=1] & Cells_0_0<=1]]

abstracting: (Cells_0_0<=1)
states: 2
abstracting: (Cells_0_0<=1)
states: 2
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[Columns_0_0<=98 | Rows_0_0<=Board_0_0_0] | [Columns_0_0<=28 | [[[~ [[Cells_0_0<=97 | Cells_0_0<=Cells_0_0]] & ~ [[Columns_0_0<=51 & 44<=Columns_0_0]]] | [~ [Board_0_0_0<=36] | Cells_0_0<=72]] | [[Rows_0_0<=14 & ~ [26<=Board_0_0_0]] & [[Cells_0_0<=83 & [44<=Rows_0_0 & Rows_0_0<=Cells_0_0]] | ~ [[Cells_0_0<=77 | Columns_0_0<=Board_0_0_0]]]]]]]]]
normalized: E [true U ~ [[[Columns_0_0<=28 | [[[~ [[Cells_0_0<=77 | Columns_0_0<=Board_0_0_0]] | [[44<=Rows_0_0 & Rows_0_0<=Cells_0_0] & Cells_0_0<=83]] & [~ [26<=Board_0_0_0] & Rows_0_0<=14]] | [[~ [Board_0_0_0<=36] | Cells_0_0<=72] | [~ [[Columns_0_0<=51 & 44<=Columns_0_0]] & ~ [[Cells_0_0<=97 | Cells_0_0<=Cells_0_0]]]]]] | [Columns_0_0<=98 | Rows_0_0<=Board_0_0_0]]]]

abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Columns_0_0<=98)
states: 2
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (Cells_0_0<=97)
states: 2
abstracting: (44<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=51)
states: 2
abstracting: (Cells_0_0<=72)
states: 2
abstracting: (Board_0_0_0<=36)
states: 2
abstracting: (Rows_0_0<=14)
states: 2
abstracting: (26<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=83)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (44<=Rows_0_0)
states: 0
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=77)
states: 2
abstracting: (Columns_0_0<=28)
states: 2
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[~ [[[59<=Columns_0_0 & [Cells_0_0<=Rows_0_0 & ~ [Cells_0_0<=81]]] | [~ [Rows_0_0<=83] & [[Cells_0_0<=46 & 37<=Board_0_0_0] & Columns_0_0<=5]]]] | [[[[[[Columns_0_0<=Board_0_0_0 | Board_0_0_0<=Board_0_0_0] | [Cells_0_0<=83 & Board_0_0_0<=Columns_0_0]] & 11<=Rows_0_0] & ~ [[[Cells_0_0<=Rows_0_0 | Columns_0_0<=21] | [Board_0_0_0<=Board_0_0_0 & 53<=Columns_0_0]]]] & [~ [[~ [Cells_0_0<=90] & [Columns_0_0<=43 | 63<=Cells_0_0]]] & ~ [[Rows_0_0<=Rows_0_0 & [99<=Rows_0_0 & Board_0_0_0<=Board_0_0_0]]]]] & ~ [Rows_0_0<=Cells_0_0]]] | Cells_0_0<=17]]]
normalized: E [true U ~ [[[[[[~ [[[99<=Rows_0_0 & Board_0_0_0<=Board_0_0_0] & Rows_0_0<=Rows_0_0]] & ~ [[[Columns_0_0<=43 | 63<=Cells_0_0] & ~ [Cells_0_0<=90]]]] & [~ [[[Board_0_0_0<=Board_0_0_0 & 53<=Columns_0_0] | [Cells_0_0<=Rows_0_0 | Columns_0_0<=21]]] & [[[Cells_0_0<=83 & Board_0_0_0<=Columns_0_0] | [Columns_0_0<=Board_0_0_0 | Board_0_0_0<=Board_0_0_0]] & 11<=Rows_0_0]]] & ~ [Rows_0_0<=Cells_0_0]] | ~ [[[[[Cells_0_0<=46 & 37<=Board_0_0_0] & Columns_0_0<=5] & ~ [Rows_0_0<=83]] | [[~ [Cells_0_0<=81] & Cells_0_0<=Rows_0_0] & 59<=Columns_0_0]]]] | Cells_0_0<=17]]]

abstracting: (Cells_0_0<=17)
states: 2
abstracting: (59<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (Cells_0_0<=81)
states: 2
abstracting: (Rows_0_0<=83)
states: 2
abstracting: (Columns_0_0<=5)
states: 2
abstracting: (37<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=46)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (11<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Cells_0_0<=83)
states: 2
abstracting: (Columns_0_0<=21)
states: 2
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (53<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Cells_0_0<=90)
states: 2
abstracting: (63<=Cells_0_0)
states: 0
abstracting: (Columns_0_0<=43)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (99<=Rows_0_0)
states: 0
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [[[[~ [96<=Columns_0_0] | [[Rows_0_0<=Cells_0_0 | Columns_0_0<=Rows_0_0] | ~ [91<=Cells_0_0]]] | [[Board_0_0_0<=Columns_0_0 | [32<=Cells_0_0 | 55<=Cells_0_0]] | [~ [Rows_0_0<=8] | [47<=Board_0_0_0 | Cells_0_0<=Rows_0_0]]]] | 1<=Board_0_0_0]] | [[[~ [Rows_0_0<=Columns_0_0] & [[15<=Columns_0_0 & [Cells_0_0<=Board_0_0_0 & [Rows_0_0<=27 & Rows_0_0<=95]]] & Rows_0_0<=40]] & [[[51<=Columns_0_0 | 35<=Board_0_0_0] & ~ [Board_0_0_0<=Rows_0_0]] & ~ [[[Board_0_0_0<=57 & [Columns_0_0<=98 & 93<=Rows_0_0]] & Cells_0_0<=18]]]] | Cells_0_0<=95]] & Board_0_0_0<=Columns_0_0]]
normalized: ~ [E [true U ~ [[[[[[~ [Rows_0_0<=Columns_0_0] & [[[[Rows_0_0<=27 & Rows_0_0<=95] & Cells_0_0<=Board_0_0_0] & 15<=Columns_0_0] & Rows_0_0<=40]] & [~ [[[[Columns_0_0<=98 & 93<=Rows_0_0] & Board_0_0_0<=57] & Cells_0_0<=18]] & [~ [Board_0_0_0<=Rows_0_0] & [51<=Columns_0_0 | 35<=Board_0_0_0]]]] | Cells_0_0<=95] | ~ [[[[[[47<=Board_0_0_0 | Cells_0_0<=Rows_0_0] | ~ [Rows_0_0<=8]] | [[32<=Cells_0_0 | 55<=Cells_0_0] | Board_0_0_0<=Columns_0_0]] | [[~ [91<=Cells_0_0] | [Rows_0_0<=Cells_0_0 | Columns_0_0<=Rows_0_0]] | ~ [96<=Columns_0_0]]] | 1<=Board_0_0_0]]] & Board_0_0_0<=Columns_0_0]]]]

abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (96<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (91<=Cells_0_0)
states: 0
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (55<=Cells_0_0)
states: 0
abstracting: (32<=Cells_0_0)
states: 0
abstracting: (Rows_0_0<=8)
states: 2
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (47<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=95)
states: 2
abstracting: (35<=Board_0_0_0)
states: 0
abstracting: (51<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Cells_0_0<=18)
states: 2
abstracting: (Board_0_0_0<=57)
states: 2
abstracting: (93<=Rows_0_0)
states: 0
abstracting: (Columns_0_0<=98)
states: 2
abstracting: (Rows_0_0<=40)
states: 2
abstracting: (15<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Rows_0_0<=95)
states: 2
abstracting: (Rows_0_0<=27)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [[[~ [[[[~ [Rows_0_0<=Board_0_0_0] | [Cells_0_0<=25 | Rows_0_0<=96]] | [~ [Rows_0_0<=33] & ~ [Rows_0_0<=Rows_0_0]]] & ~ [Cells_0_0<=89]]] | [[[[~ [Cells_0_0<=Columns_0_0] & Columns_0_0<=57] | Board_0_0_0<=43] & [Columns_0_0<=35 | [[Cells_0_0<=66 & Board_0_0_0<=24] | [Board_0_0_0<=100 | Board_0_0_0<=87]]]] | [Columns_0_0<=25 | Rows_0_0<=0]]] & [[[[[[Rows_0_0<=90 | 69<=Columns_0_0] & [86<=Columns_0_0 | Board_0_0_0<=42]] | [[Cells_0_0<=76 | Columns_0_0<=96] & [Rows_0_0<=Cells_0_0 | Board_0_0_0<=28]]] & [55<=Cells_0_0 & ~ [Columns_0_0<=89]]] | Board_0_0_0<=22] & [[[[[76<=Columns_0_0 | Board_0_0_0<=Cells_0_0] | [20<=Rows_0_0 | Board_0_0_0<=Rows_0_0]] & [~ [44<=Cells_0_0] | ~ [59<=Board_0_0_0]]] | [[[56<=Rows_0_0 & Cells_0_0<=Board_0_0_0] | [Board_0_0_0<=Columns_0_0 | 79<=Rows_0_0]] & [[Board_0_0_0<=Columns_0_0 & Cells_0_0<=55] | [55<=Board_0_0_0 & Rows_0_0<=86]]]] | [~ [[~ [Rows_0_0<=47] | Board_0_0_0<=49]] | [87<=Rows_0_0 | Rows_0_0<=58]]]]]]]
normalized: E [true U ~ [[[[[[87<=Rows_0_0 | Rows_0_0<=58] | ~ [[~ [Rows_0_0<=47] | Board_0_0_0<=49]]] | [[[[55<=Board_0_0_0 & Rows_0_0<=86] | [Board_0_0_0<=Columns_0_0 & Cells_0_0<=55]] & [[Board_0_0_0<=Columns_0_0 | 79<=Rows_0_0] | [56<=Rows_0_0 & Cells_0_0<=Board_0_0_0]]] | [[~ [59<=Board_0_0_0] | ~ [44<=Cells_0_0]] & [[20<=Rows_0_0 | Board_0_0_0<=Rows_0_0] | [76<=Columns_0_0 | Board_0_0_0<=Cells_0_0]]]]] & [[[~ [Columns_0_0<=89] & 55<=Cells_0_0] & [[[Rows_0_0<=Cells_0_0 | Board_0_0_0<=28] & [Cells_0_0<=76 | Columns_0_0<=96]] | [[86<=Columns_0_0 | Board_0_0_0<=42] & [Rows_0_0<=90 | 69<=Columns_0_0]]]] | Board_0_0_0<=22]] & [[[Columns_0_0<=25 | Rows_0_0<=0] | [[[[Board_0_0_0<=100 | Board_0_0_0<=87] | [Cells_0_0<=66 & Board_0_0_0<=24]] | Columns_0_0<=35] & [[~ [Cells_0_0<=Columns_0_0] & Columns_0_0<=57] | Board_0_0_0<=43]]] | ~ [[~ [Cells_0_0<=89] & [[~ [Rows_0_0<=Rows_0_0] & ~ [Rows_0_0<=33]] | [[Cells_0_0<=25 | Rows_0_0<=96] | ~ [Rows_0_0<=Board_0_0_0]]]]]]]]]

abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Rows_0_0<=96)
states: 2
abstracting: (Cells_0_0<=25)
states: 2
abstracting: (Rows_0_0<=33)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Cells_0_0<=89)
states: 2
abstracting: (Board_0_0_0<=43)
states: 2
abstracting: (Columns_0_0<=57)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=35)
states: 2
abstracting: (Board_0_0_0<=24)
states: 2
abstracting: (Cells_0_0<=66)
states: 2
abstracting: (Board_0_0_0<=87)
states: 2
abstracting: (Board_0_0_0<=100)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Columns_0_0<=25)
states: 2
abstracting: (Board_0_0_0<=22)
states: 2
abstracting: (69<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=90)
states: 2
abstracting: (Board_0_0_0<=42)
states: 2
abstracting: (86<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=96)
states: 2
abstracting: (Cells_0_0<=76)
states: 2
abstracting: (Board_0_0_0<=28)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (55<=Cells_0_0)
states: 0
abstracting: (Columns_0_0<=89)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (76<=Columns_0_0)
states: 0
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (20<=Rows_0_0)
states: 0
abstracting: (44<=Cells_0_0)
states: 0
abstracting: (59<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (56<=Rows_0_0)
states: 0
abstracting: (79<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Cells_0_0<=55)
states: 2
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Rows_0_0<=86)
states: 2
abstracting: (55<=Board_0_0_0)
states: 0
abstracting: (Board_0_0_0<=49)
states: 2
abstracting: (Rows_0_0<=47)
states: 2
abstracting: (Rows_0_0<=58)
states: 2
abstracting: (87<=Rows_0_0)
states: 0
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[[Rows_0_0<=Board_0_0_0 | [Rows_0_0<=72 & ~ [Cells_0_0<=48]]] & ~ [[52<=Columns_0_0 | [[~ [[93<=Rows_0_0 & Columns_0_0<=Columns_0_0]] & ~ [[Rows_0_0<=Columns_0_0 & Columns_0_0<=91]]] & [[[Cells_0_0<=Board_0_0_0 & Columns_0_0<=Cells_0_0] & [50<=Rows_0_0 | Cells_0_0<=Rows_0_0]] & [~ [Cells_0_0<=93] & 14<=Rows_0_0]]]]]] | [Rows_0_0<=92 & [[Cells_0_0<=100 & [~ [[[Cells_0_0<=Board_0_0_0 | 21<=Columns_0_0] & ~ [Cells_0_0<=Cells_0_0]]] | [Rows_0_0<=56 & [~ [Cells_0_0<=0] & ~ [Columns_0_0<=Board_0_0_0]]]]] | ~ [[~ [[[Board_0_0_0<=Cells_0_0 | Columns_0_0<=Board_0_0_0] | ~ [Rows_0_0<=Cells_0_0]]] | Cells_0_0<=41]]]]] & [~ [[[~ [88<=Columns_0_0] | [~ [76<=Board_0_0_0] & [~ [Cells_0_0<=11] | [[Columns_0_0<=Board_0_0_0 & Rows_0_0<=Cells_0_0] | [73<=Board_0_0_0 & Cells_0_0<=Cells_0_0]]]]] & [[[19<=Cells_0_0 & [Columns_0_0<=Columns_0_0 & [Rows_0_0<=Rows_0_0 & 96<=Board_0_0_0]]] & [~ [33<=Cells_0_0] & [[Board_0_0_0<=Cells_0_0 & Cells_0_0<=28] | [Cells_0_0<=Columns_0_0 | 39<=Board_0_0_0]]]] & ~ [[[[Rows_0_0<=Columns_0_0 | Cells_0_0<=39] & [100<=Rows_0_0 & Columns_0_0<=Rows_0_0]] & Rows_0_0<=Cells_0_0]]]]] | ~ [[[~ [[Rows_0_0<=83 & ~ [Rows_0_0<=48]]] & ~ [[[[Cells_0_0<=Cells_0_0 | 29<=Rows_0_0] | ~ [48<=Board_0_0_0]] | 88<=Columns_0_0]]] | ~ [[Cells_0_0<=1 | 88<=Cells_0_0]]]]]]]
normalized: E [true U [[~ [[~ [[Cells_0_0<=1 | 88<=Cells_0_0]] | [~ [[[~ [48<=Board_0_0_0] | [Cells_0_0<=Cells_0_0 | 29<=Rows_0_0]] | 88<=Columns_0_0]] & ~ [[~ [Rows_0_0<=48] & Rows_0_0<=83]]]]] | ~ [[[~ [[[[100<=Rows_0_0 & Columns_0_0<=Rows_0_0] & [Rows_0_0<=Columns_0_0 | Cells_0_0<=39]] & Rows_0_0<=Cells_0_0]] & [[[[Cells_0_0<=Columns_0_0 | 39<=Board_0_0_0] | [Board_0_0_0<=Cells_0_0 & Cells_0_0<=28]] & ~ [33<=Cells_0_0]] & [[[Rows_0_0<=Rows_0_0 & 96<=Board_0_0_0] & Columns_0_0<=Columns_0_0] & 19<=Cells_0_0]]] & [[[[[73<=Board_0_0_0 & Cells_0_0<=Cells_0_0] | [Columns_0_0<=Board_0_0_0 & Rows_0_0<=Cells_0_0]] | ~ [Cells_0_0<=11]] & ~ [76<=Board_0_0_0]] | ~ [88<=Columns_0_0]]]]] & [[[~ [[~ [[~ [Rows_0_0<=Cells_0_0] | [Board_0_0_0<=Cells_0_0 | Columns_0_0<=Board_0_0_0]]] | Cells_0_0<=41]] | [[[[~ [Columns_0_0<=Board_0_0_0] & ~ [Cells_0_0<=0]] & Rows_0_0<=56] | ~ [[~ [Cells_0_0<=Cells_0_0] & [Cells_0_0<=Board_0_0_0 | 21<=Columns_0_0]]]] & Cells_0_0<=100]] & Rows_0_0<=92] | [~ [[[[[~ [Cells_0_0<=93] & 14<=Rows_0_0] & [[50<=Rows_0_0 | Cells_0_0<=Rows_0_0] & [Cells_0_0<=Board_0_0_0 & Columns_0_0<=Cells_0_0]]] & [~ [[Rows_0_0<=Columns_0_0 & Columns_0_0<=91]] & ~ [[93<=Rows_0_0 & Columns_0_0<=Columns_0_0]]]] | 52<=Columns_0_0]] & [[~ [Cells_0_0<=48] & Rows_0_0<=72] | Rows_0_0<=Board_0_0_0]]]]]

abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Rows_0_0<=72)
states: 2
abstracting: (Cells_0_0<=48)
states: 2
abstracting: (52<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
abstracting: (93<=Rows_0_0)
states: 0
abstracting: (Columns_0_0<=91)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (50<=Rows_0_0)
states: 0
abstracting: (14<=Rows_0_0)
states: 0
abstracting: (Cells_0_0<=93)
states: 2
abstracting: (Rows_0_0<=92)
states: 2
abstracting: (Cells_0_0<=100)
states: 2
abstracting: (21<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=56)
states: 2
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=41)
states: 2
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (88<=Columns_0_0)
states: 0
abstracting: (76<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=11)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (73<=Board_0_0_0)
states: 0
abstracting: (19<=Cells_0_0)
states: 0
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
abstracting: (96<=Board_0_0_0)
states: 0
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (33<=Cells_0_0)
states: 0
abstracting: (Cells_0_0<=28)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (39<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Cells_0_0<=39)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
abstracting: (100<=Rows_0_0)
states: 0
abstracting: (Rows_0_0<=83)
states: 2
abstracting: (Rows_0_0<=48)
states: 2
abstracting: (88<=Columns_0_0)
states: 0
abstracting: (29<=Rows_0_0)
states: 0
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (48<=Board_0_0_0)
states: 0
abstracting: (88<=Cells_0_0)
states: 0
abstracting: (Cells_0_0<=1)
states: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN01-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 160 (1.6e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12 10 22
used/not used/entry size/cache size: 13 67108851 16 1024MB
basic ops cache: hits/miss/sum: 135 539 674
used/not used/entry size/cache size: 641 16776575 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 9 255
used/not used/entry size/cache size: 9 8388599 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 67108813
1 42
2 1
3 0
4 0
5 0
6 0
7 0
8 0
9 1
>= 10 7

Total processing time: 0m 4.468sec


BK_STOP 1679146295909

--------------------
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: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: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)

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-AN01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is Sudoku-PT-AN01, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912691600166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN01.tgz
mv Sudoku-PT-AN01 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;