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-167912691600161.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691600161
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-01
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-02
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-03
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-04
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-05
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-06
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-07
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-08
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-09
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-10
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-11
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-12
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-13
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-14
FORMULA_NAME Sudoku-PT-AN01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679146288041

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-AN01
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_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.835sec


RS generation: 0m 0.000sec


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



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

checking: EG [Board_0_0_0<=27]
normalized: EG [Board_0_0_0<=27]

abstracting: (Board_0_0_0<=27)
states: 2

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AF [EG [1<=Cells_0_0]]
normalized: ~ [EG [~ [EG [1<=Cells_0_0]]]]

abstracting: (1<=Cells_0_0)
states: 1
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [EG [Rows_0_0<=Rows_0_0]]
normalized: ~ [EG [Rows_0_0<=Rows_0_0]]

abstracting: (Rows_0_0<=Rows_0_0)
states: 2

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EG [AF [Cells_0_0<=Rows_0_0]]
normalized: EG [~ [EG [~ [Cells_0_0<=Rows_0_0]]]]

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

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [A [[A [99<=Columns_0_0 U AG [Rows_0_0<=78]] & Columns_0_0<=6] U AF [EG [EF [94<=Rows_0_0]]]]]
normalized: ~ [[~ [EG [EG [~ [EG [E [true U 94<=Rows_0_0]]]]]] & ~ [E [EG [~ [EG [E [true U 94<=Rows_0_0]]]] U [~ [[[~ [EG [E [true U ~ [Rows_0_0<=78]]]] & ~ [E [E [true U ~ [Rows_0_0<=78]] U [~ [99<=Columns_0_0] & E [true U ~ [Rows_0_0<=78]]]]]] & Columns_0_0<=6]] & EG [~ [EG [E [true U 94<=Rows_0_0]]]]]]]]]

abstracting: (94<=Rows_0_0)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (Columns_0_0<=6)
states: 2
abstracting: (Rows_0_0<=78)
states: 2
abstracting: (99<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=78)
states: 2
abstracting: (Rows_0_0<=78)
states: 2
.
EG iterations: 1
abstracting: (94<=Rows_0_0)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (94<=Rows_0_0)
states: 0
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

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

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [AF [[~ [AG [[[Cells_0_0<=Rows_0_0 | 82<=Board_0_0_0] | [Columns_0_0<=45 & 28<=Columns_0_0]]]] | 21<=Rows_0_0]]]
normalized: EG [~ [[E [true U ~ [[[Columns_0_0<=45 & 28<=Columns_0_0] | [Cells_0_0<=Rows_0_0 | 82<=Board_0_0_0]]]] | 21<=Rows_0_0]]]

abstracting: (21<=Rows_0_0)
states: 0
abstracting: (82<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=Rows_0_0)
states: 2
abstracting: (28<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=45)
states: 2

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

EG iterations: 0
...
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [EG [[[AX [Columns_0_0<=Columns_0_0] & ~ [[A [Board_0_0_0<=33 U Board_0_0_0<=76] | [Columns_0_0<=73 | 9<=Board_0_0_0]]]] & Rows_0_0<=Columns_0_0]]]
normalized: ~ [EG [~ [EG [[[~ [[[Columns_0_0<=73 | 9<=Board_0_0_0] | [~ [EG [~ [Board_0_0_0<=76]]] & ~ [E [~ [Board_0_0_0<=76] U [~ [Board_0_0_0<=33] & ~ [Board_0_0_0<=76]]]]]]] & ~ [EX [~ [Columns_0_0<=Columns_0_0]]]] & Rows_0_0<=Columns_0_0]]]]]

abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=Columns_0_0)
states: 2
.abstracting: (Board_0_0_0<=76)
states: 2
abstracting: (Board_0_0_0<=33)
states: 2
abstracting: (Board_0_0_0<=76)
states: 2
abstracting: (Board_0_0_0<=76)
states: 2
.
EG iterations: 1
abstracting: (9<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=73)
states: 2
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [A [AX [~ [[[Columns_0_0<=97 & E [Cells_0_0<=55 U 23<=Columns_0_0]] | Cells_0_0<=31]]] U EX [EG [A [Columns_0_0<=Board_0_0_0 U Board_0_0_0<=69]]]] & AG [AG [[[A [Columns_0_0<=Board_0_0_0 U Cells_0_0<=Rows_0_0] & AG [Cells_0_0<=Rows_0_0]] & Board_0_0_0<=13]]]]
normalized: [~ [E [true U E [true U ~ [[[[~ [EG [~ [Cells_0_0<=Rows_0_0]]] & ~ [E [~ [Cells_0_0<=Rows_0_0] U [~ [Columns_0_0<=Board_0_0_0] & ~ [Cells_0_0<=Rows_0_0]]]]] & ~ [E [true U ~ [Cells_0_0<=Rows_0_0]]]] & Board_0_0_0<=13]]]]] & [~ [EG [~ [EX [EG [[~ [EG [~ [Board_0_0_0<=69]]] & ~ [E [~ [Board_0_0_0<=69] U [~ [Columns_0_0<=Board_0_0_0] & ~ [Board_0_0_0<=69]]]]]]]]]] & ~ [E [~ [EX [EG [[~ [EG [~ [Board_0_0_0<=69]]] & ~ [E [~ [Board_0_0_0<=69] U [~ [Columns_0_0<=Board_0_0_0] & ~ [Board_0_0_0<=69]]]]]]]] U [EX [[[E [Cells_0_0<=55 U 23<=Columns_0_0] & Columns_0_0<=97] | Cells_0_0<=31]] & ~ [EX [EG [[~ [EG [~ [Board_0_0_0<=69]]] & ~ [E [~ [Board_0_0_0<=69] U [~ [Columns_0_0<=Board_0_0_0] & ~ [Board_0_0_0<=69]]]]]]]]]]]]]

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

EG iterations: 0
.abstracting: (Cells_0_0<=31)
states: 2
abstracting: (Columns_0_0<=97)
states: 2
abstracting: (23<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=55)
states: 2
.abstracting: (Board_0_0_0<=69)
states: 2
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=69)
states: 2
abstracting: (Board_0_0_0<=69)
states: 2
.
EG iterations: 1

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-AN01-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

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

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

FORMULA Sudoku-PT-AN01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [E [EX [[[[Columns_0_0<=4 & 29<=Rows_0_0] | Board_0_0_0<=14] & 76<=Rows_0_0]] U Columns_0_0<=94] U [[~ [[[~ [[Columns_0_0<=Cells_0_0 & 41<=Board_0_0_0]] | E [13<=Cells_0_0 U Rows_0_0<=Columns_0_0]] & Cells_0_0<=Board_0_0_0]] & [[33<=Rows_0_0 | ~ [EF [Rows_0_0<=Columns_0_0]]] | [AX [AF [Cells_0_0<=48]] & ~ [[Board_0_0_0<=Rows_0_0 | Rows_0_0<=63]]]]] & EX [Columns_0_0<=Rows_0_0]]]
normalized: [~ [EG [~ [[EX [Columns_0_0<=Rows_0_0] & [[[~ [[Board_0_0_0<=Rows_0_0 | Rows_0_0<=63]] & ~ [EX [EG [~ [Cells_0_0<=48]]]]] | [~ [E [true U Rows_0_0<=Columns_0_0]] | 33<=Rows_0_0]] & ~ [[[E [13<=Cells_0_0 U Rows_0_0<=Columns_0_0] | ~ [[Columns_0_0<=Cells_0_0 & 41<=Board_0_0_0]]] & Cells_0_0<=Board_0_0_0]]]]]]] & ~ [E [~ [[EX [Columns_0_0<=Rows_0_0] & [[[~ [[Board_0_0_0<=Rows_0_0 | Rows_0_0<=63]] & ~ [EX [EG [~ [Cells_0_0<=48]]]]] | [~ [E [true U Rows_0_0<=Columns_0_0]] | 33<=Rows_0_0]] & ~ [[[E [13<=Cells_0_0 U Rows_0_0<=Columns_0_0] | ~ [[Columns_0_0<=Cells_0_0 & 41<=Board_0_0_0]]] & Cells_0_0<=Board_0_0_0]]]]] U [~ [E [EX [[[[Columns_0_0<=4 & 29<=Rows_0_0] | Board_0_0_0<=14] & 76<=Rows_0_0]] U Columns_0_0<=94]] & ~ [[EX [Columns_0_0<=Rows_0_0] & [[[~ [[Board_0_0_0<=Rows_0_0 | Rows_0_0<=63]] & ~ [EX [EG [~ [Cells_0_0<=48]]]]] | [~ [E [true U Rows_0_0<=Columns_0_0]] | 33<=Rows_0_0]] & ~ [[[E [13<=Cells_0_0 U Rows_0_0<=Columns_0_0] | ~ [[Columns_0_0<=Cells_0_0 & 41<=Board_0_0_0]]] & Cells_0_0<=Board_0_0_0]]]]]]]]]

abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (41<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (13<=Cells_0_0)
states: 0
abstracting: (33<=Rows_0_0)
states: 0
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=48)
states: 2
.
EG iterations: 1
.abstracting: (Rows_0_0<=63)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
.abstracting: (Columns_0_0<=94)
states: 2
abstracting: (76<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=14)
states: 2
abstracting: (29<=Rows_0_0)
states: 0
abstracting: (Columns_0_0<=4)
states: 2
.abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (41<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (13<=Cells_0_0)
states: 0
abstracting: (33<=Rows_0_0)
states: 0
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=48)
states: 2
.
EG iterations: 1
.abstracting: (Rows_0_0<=63)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
.abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (41<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (13<=Cells_0_0)
states: 0
abstracting: (33<=Rows_0_0)
states: 0
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=48)
states: 2
.
EG iterations: 1
.abstracting: (Rows_0_0<=63)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Columns_0_0<=Rows_0_0)
states: 2
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

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

FORMULA Sudoku-PT-AN01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 85 (8.5e+01)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 68 14 82
used/not used/entry size/cache size: 19 67108845 16 1024MB
basic ops cache: hits/miss/sum: 214 238 452
used/not used/entry size/cache size: 337 16776879 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: 214 9 223
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 2
3 0
4 3
5 1
6 1
7 0
8 2
9 0
>= 10 0

Total processing time: 0m 4.505sec


BK_STOP 1679146292591

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

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="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-AN01, 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-167912691600161"
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 [ "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 ;