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.r257-smll-167863532200009.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 NQueens-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532200009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.2K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NQueens-PT-05-CTLCardinality-00
FORMULA_NAME NQueens-PT-05-CTLCardinality-01
FORMULA_NAME NQueens-PT-05-CTLCardinality-02
FORMULA_NAME NQueens-PT-05-CTLCardinality-03
FORMULA_NAME NQueens-PT-05-CTLCardinality-04
FORMULA_NAME NQueens-PT-05-CTLCardinality-05
FORMULA_NAME NQueens-PT-05-CTLCardinality-06
FORMULA_NAME NQueens-PT-05-CTLCardinality-07
FORMULA_NAME NQueens-PT-05-CTLCardinality-08
FORMULA_NAME NQueens-PT-05-CTLCardinality-09
FORMULA_NAME NQueens-PT-05-CTLCardinality-10
FORMULA_NAME NQueens-PT-05-CTLCardinality-11
FORMULA_NAME NQueens-PT-05-CTLCardinality-12
FORMULA_NAME NQueens-PT-05-CTLCardinality-13
FORMULA_NAME NQueens-PT-05-CTLCardinality-14
FORMULA_NAME NQueens-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678648388354

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=NQueens-PT-05
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: NQueens_PT_05
(NrP: 55 NrTr: 25 NrArc: 125)

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

net check time: 0m 0.000sec

init dd package: 0m 4.085sec


RS generation: 0m 0.024sec


-> reachability set: #nodes 2972 (3.0e+03) #states 462



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

checking: EG [1<=cX_4]
normalized: EG [1<=cX_4]

abstracting: (1<=cX_4)
states: 185
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EG [1<=cX_0]
normalized: EG [1<=cX_0]

abstracting: (1<=cX_0)
states: 185
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AF [~ [E [EX [AX [1<=P_3_0]] U cX_1<=0]]]
normalized: ~ [EG [E [EX [~ [EX [~ [1<=P_3_0]]]] U cX_1<=0]]]

abstracting: (cX_1<=0)
states: 255
abstracting: (1<=P_3_0)
states: 59
...
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EG [~ [AF [[EG [1<=R_0] & AG [P_0_1<=P_3_0]]]]]
normalized: EG [EG [~ [[~ [E [true U ~ [P_0_1<=P_3_0]]] & EG [1<=R_0]]]]]

abstracting: (1<=R_0)
states: 462

EG iterations: 0
abstracting: (P_0_1<=P_3_0)
states: 419
.....
EG iterations: 5
.
EG iterations: 1
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EG [~ [AG [[~ [[EX [P_2_0<=1] | [R_9<=P_1_1 | 1<=P_2_0]]] | 1<=R_4]]]]
normalized: EG [E [true U ~ [[1<=R_4 | ~ [[[R_9<=P_1_1 | 1<=P_2_0] | EX [P_2_0<=1]]]]]]]

abstracting: (P_2_0<=1)
states: 462
.abstracting: (1<=P_2_0)
states: 57
abstracting: (R_9<=P_1_1)
states: 98
abstracting: (1<=R_4)
states: 258
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [~ [[L_1<=1 | [EX [[~ [L_9<=cX_1] & 1<=R_1]] & ~ [1<=cY_0]]]]]
normalized: EG [~ [[L_1<=1 | [~ [1<=cY_0] & EX [[1<=R_1 & ~ [L_9<=cX_1]]]]]]]

abstracting: (L_9<=cX_1)
states: 207
abstracting: (1<=R_1)
states: 411
.abstracting: (1<=cY_0)
states: 185
abstracting: (L_1<=1)
states: 462
.
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: ~ [AF [~ [E [AX [~ [R_3<=1]] U E [A [R_7<=R_0 U 1<=P_4_4] U E [R_3<=0 U 1<=R_3]]]]]]
normalized: EG [E [~ [EX [R_3<=1]] U E [[~ [EG [~ [1<=P_4_4]]] & ~ [E [~ [1<=P_4_4] U [~ [R_7<=R_0] & ~ [1<=P_4_4]]]]] U E [R_3<=0 U 1<=R_3]]]]

abstracting: (1<=R_3)
states: 301
abstracting: (R_3<=0)
states: 161
abstracting: (1<=P_4_4)
states: 51
abstracting: (R_7<=R_0)
states: 462
abstracting: (1<=P_4_4)
states: 51
abstracting: (1<=P_4_4)
states: 51
...
EG iterations: 3
abstracting: (R_3<=1)
states: 462
.....
EG iterations: 4
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [EG [[EG [1<=cX_4] & EG [cX_0<=1]]] & EG [AX [AX [[A [cX_3<=1 U P_1_1<=R_1] | [cY_4<=1 & 1<=R_9]]]]]]
normalized: [EG [~ [EX [EX [~ [[[cY_4<=1 & 1<=R_9] | [~ [EG [~ [P_1_1<=R_1]]] & ~ [E [~ [P_1_1<=R_1] U [~ [cX_3<=1] & ~ [P_1_1<=R_1]]]]]]]]]]] & EG [[EG [cX_0<=1] & EG [1<=cX_4]]]]

abstracting: (1<=cX_4)
states: 185
.....
EG iterations: 5
abstracting: (cX_0<=1)
states: 462

EG iterations: 0
.
EG iterations: 1
abstracting: (P_1_1<=R_1)
states: 462
abstracting: (cX_3<=1)
states: 462
abstracting: (P_1_1<=R_1)
states: 462
abstracting: (P_1_1<=R_1)
states: 462
.
EG iterations: 1
abstracting: (1<=R_9)
states: 411
abstracting: (cY_4<=1)
states: 462
..
EG iterations: 0
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: A [AG [EX [EX [[1<=R_7 & 1<=R_5]]]] U EG [[[EF [[cY_4<=R_4 & 1<=P_1_0]] | P_3_1<=0] | EF [~ [E [R_1<=1 U P_3_1<=cY_1]]]]]]
normalized: [~ [EG [~ [EG [[E [true U ~ [E [R_1<=1 U P_3_1<=cY_1]]] | [P_3_1<=0 | E [true U [cY_4<=R_4 & 1<=P_1_0]]]]]]]] & ~ [E [~ [EG [[E [true U ~ [E [R_1<=1 U P_3_1<=cY_1]]] | [P_3_1<=0 | E [true U [cY_4<=R_4 & 1<=P_1_0]]]]]] U [E [true U ~ [EX [EX [[1<=R_7 & 1<=R_5]]]]] & ~ [EG [[E [true U ~ [E [R_1<=1 U P_3_1<=cY_1]]] | [P_3_1<=0 | E [true U [cY_4<=R_4 & 1<=P_1_0]]]]]]]]]]

abstracting: (1<=P_1_0)
states: 59
abstracting: (cY_4<=R_4)
states: 381
abstracting: (P_3_1<=0)
states: 415
abstracting: (P_3_1<=cY_1)
states: 415
abstracting: (R_1<=1)
states: 462

EG iterations: 0
abstracting: (1<=R_5)
states: 235
abstracting: (1<=R_7)
states: 301
..abstracting: (1<=P_1_0)
states: 59
abstracting: (cY_4<=R_4)
states: 381
abstracting: (P_3_1<=0)
states: 415
abstracting: (P_3_1<=cY_1)
states: 415
abstracting: (R_1<=1)
states: 462

EG iterations: 0
abstracting: (1<=P_1_0)
states: 59
abstracting: (cY_4<=R_4)
states: 381
abstracting: (P_3_1<=0)
states: 415
abstracting: (P_3_1<=cY_1)
states: 415
abstracting: (R_1<=1)
states: 462

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

FORMULA NQueens-PT-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AF [[[L_2<=R_8 | EF [AX [AF [cX_1<=L_7]]]] & ~ [[AX [[EX [L_0<=P_4_4] & ~ [R_1<=P_3_4]]] & cY_4<=P_3_1]]]]
normalized: ~ [EG [~ [[~ [[cY_4<=P_3_1 & ~ [EX [~ [[~ [R_1<=P_3_4] & EX [L_0<=P_4_4]]]]]]] & [L_2<=R_8 | E [true U ~ [EX [EG [~ [cX_1<=L_7]]]]]]]]]]

abstracting: (cX_1<=L_7)
states: 407
....
EG iterations: 4
.abstracting: (L_2<=R_8)
states: 382
abstracting: (L_0<=P_4_4)
states: 102
.abstracting: (R_1<=P_3_4)
states: 100
.abstracting: (cY_4<=P_3_1)
states: 296
....
EG iterations: 4
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [~ [[[~ [EF [E [P_2_2<=1 U R_3<=1]]] | ~ [E [1<=P_3_3 U EX [cX_4<=cX_3]]]] & [EX [[EF [P_3_3<=1] & [R_9<=R_6 | P_4_1<=1]]] | ~ [EX [EF [R_4<=0]]]]]]]
normalized: E [true U ~ [[[~ [EX [E [true U R_4<=0]]] | EX [[[R_9<=R_6 | P_4_1<=1] & E [true U P_3_3<=1]]]] & [~ [E [1<=P_3_3 U EX [cX_4<=cX_3]]] | ~ [E [true U E [P_2_2<=1 U R_3<=1]]]]]]]

abstracting: (R_3<=1)
states: 462
abstracting: (P_2_2<=1)
states: 462
abstracting: (cX_4<=cX_3)
states: 345
.abstracting: (1<=P_3_3)
states: 47
abstracting: (P_3_3<=1)
states: 462
abstracting: (P_4_1<=1)
states: 462
abstracting: (R_9<=R_6)
states: 278
.abstracting: (R_4<=0)
states: 204
.-> the formula is TRUE

FORMULA NQueens-PT-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AX [A [P_4_0<=P_0_2 U A [[[EF [P_3_4<=1] & P_1_0<=cX_3] | [~ [P_3_2<=1] & [R_8<=1 | L_6<=cY_4]]] U EG [[1<=R_5 | R_1<=0]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[~ [EG [~ [EG [[1<=R_5 | R_1<=0]]]]] & ~ [E [~ [EG [[1<=R_5 | R_1<=0]]] U [~ [[[[R_8<=1 | L_6<=cY_4] & ~ [P_3_2<=1]] | [P_1_0<=cX_3 & E [true U P_3_4<=1]]]] & ~ [EG [[1<=R_5 | R_1<=0]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [[1<=R_5 | R_1<=0]]]]] & ~ [E [~ [EG [[1<=R_5 | R_1<=0]]] U [~ [[[[R_8<=1 | L_6<=cY_4] & ~ [P_3_2<=1]] | [P_1_0<=cX_3 & E [true U P_3_4<=1]]]] & ~ [EG [[1<=R_5 | R_1<=0]]]]]]]] U [~ [P_4_0<=P_0_2] & ~ [[~ [EG [~ [EG [[1<=R_5 | R_1<=0]]]]] & ~ [E [~ [EG [[1<=R_5 | R_1<=0]]] U [~ [[[[R_8<=1 | L_6<=cY_4] & ~ [P_3_2<=1]] | [P_1_0<=cX_3 & E [true U P_3_4<=1]]]] & ~ [EG [[1<=R_5 | R_1<=0]]]]]]]]]]]]]]]

abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (P_3_4<=1)
states: 462
abstracting: (P_1_0<=cX_3)
states: 432
abstracting: (P_3_2<=1)
states: 462
abstracting: (L_6<=cY_4)
states: 278
abstracting: (R_8<=1)
states: 462
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
...
EG iterations: 3
abstracting: (P_4_0<=P_0_2)
states: 422
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (P_3_4<=1)
states: 462
abstracting: (P_1_0<=cX_3)
states: 432
abstracting: (P_3_2<=1)
states: 462
abstracting: (L_6<=cY_4)
states: 278
abstracting: (R_8<=1)
states: 462
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
...
EG iterations: 3
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (P_3_4<=1)
states: 462
abstracting: (P_1_0<=cX_3)
states: 432
abstracting: (P_3_2<=1)
states: 462
abstracting: (L_6<=cY_4)
states: 278
abstracting: (R_8<=1)
states: 462
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
abstracting: (R_1<=0)
states: 51
abstracting: (1<=R_5)
states: 235
....
EG iterations: 4
...
EG iterations: 3
.
EG iterations: 1
.-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: ~ [[E [EX [EF [P_1_4<=L_8]] U [~ [[~ [R_1<=1] & [cY_1<=0 & R_8<=0]]] & EG [[1<=L_6 & P_0_2<=0]]]] | [EX [EG [~ [cX_3<=0]]] & EF [[[A [cX_2<=0 U 1<=P_1_4] | cX_3<=P_1_4] | ~ [E [1<=cX_2 U P_2_2<=P_2_2]]]]]]]
normalized: ~ [[[E [true U [~ [E [1<=cX_2 U P_2_2<=P_2_2]] | [cX_3<=P_1_4 | [~ [EG [~ [1<=P_1_4]]] & ~ [E [~ [1<=P_1_4] U [~ [cX_2<=0] & ~ [1<=P_1_4]]]]]]]] & EX [EG [~ [cX_3<=0]]]] | E [EX [E [true U P_1_4<=L_8]] U [EG [[1<=L_6 & P_0_2<=0]] & ~ [[[cY_1<=0 & R_8<=0] & ~ [R_1<=1]]]]]]]

abstracting: (R_1<=1)
states: 462
abstracting: (R_8<=0)
states: 118
abstracting: (cY_1<=0)
states: 255
abstracting: (P_0_2<=0)
states: 405
abstracting: (1<=L_6)
states: 301
....
EG iterations: 4
abstracting: (P_1_4<=L_8)
states: 452
.abstracting: (cX_3<=0)
states: 255
.....
EG iterations: 5
.abstracting: (1<=P_1_4)
states: 59
abstracting: (cX_2<=0)
states: 231
abstracting: (1<=P_1_4)
states: 59
abstracting: (1<=P_1_4)
states: 59
....
EG iterations: 4
abstracting: (cX_3<=P_1_4)
states: 284
abstracting: (P_2_2<=P_2_2)
states: 462
abstracting: (1<=cX_2)
states: 231
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AF [[[~ [[~ [E [R_8<=P_2_0 U 1<=R_2]] | [EG [1<=P_0_0] | ~ [1<=R_7]]]] & [[[EX [R_0<=P_3_0] | ~ [cY_4<=1]] & AG [[R_2<=L_4 | L_2<=0]]] & P_3_1<=1]] & E [EF [E [1<=P_0_4 U 1<=cX_3]] U 1<=cY_4]]]
normalized: ~ [EG [~ [[E [E [true U E [1<=P_0_4 U 1<=cX_3]] U 1<=cY_4] & [[P_3_1<=1 & [~ [E [true U ~ [[R_2<=L_4 | L_2<=0]]]] & [~ [cY_4<=1] | EX [R_0<=P_3_0]]]] & ~ [[[~ [1<=R_7] | EG [1<=P_0_0]] | ~ [E [R_8<=P_2_0 U 1<=R_2]]]]]]]]]

abstracting: (1<=R_2)
states: 344
abstracting: (R_8<=P_2_0)
states: 162
abstracting: (1<=P_0_0)
states: 51
.
EG iterations: 1
abstracting: (1<=R_7)
states: 301
abstracting: (R_0<=P_3_0)
states: 59
.abstracting: (cY_4<=1)
states: 462
abstracting: (L_2<=0)
states: 161
abstracting: (R_2<=L_4)
states: 283
abstracting: (P_3_1<=1)
states: 462
abstracting: (1<=cY_4)
states: 185
abstracting: (1<=cX_3)
states: 207
abstracting: (1<=P_0_4)
states: 51
.
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [[E [EF [~ [cX_0<=1]] U ~ [[[[[P_4_1<=1 & 1<=L_1] | P_1_3<=0] | ~ [P_3_3<=P_0_1]] | EF [[1<=R_1 | 1<=P_4_0]]]]] & [EG [EF [P_4_0<=1]] & EF [[AX [[L_7<=P_4_0 | cY_1<=P_2_3]] | AX [EF [1<=P_4_4]]]]]] | AF [~ [[AX [~ [P_4_4<=0]] | ~ [1<=P_4_3]]]]]
normalized: [~ [EG [[~ [1<=P_4_3] | ~ [EX [P_4_4<=0]]]]] | [[E [true U [~ [EX [~ [E [true U 1<=P_4_4]]]] | ~ [EX [~ [[L_7<=P_4_0 | cY_1<=P_2_3]]]]]] & EG [E [true U P_4_0<=1]]] & E [E [true U ~ [cX_0<=1]] U ~ [[E [true U [1<=R_1 | 1<=P_4_0]] | [~ [P_3_3<=P_0_1] | [P_1_3<=0 | [P_4_1<=1 & 1<=L_1]]]]]]]]

abstracting: (1<=L_1)
states: 344
abstracting: (P_4_1<=1)
states: 462
abstracting: (P_1_3<=0)
states: 415
abstracting: (P_3_3<=P_0_1)
states: 421
abstracting: (1<=P_4_0)
states: 51
abstracting: (1<=R_1)
states: 411
abstracting: (cX_0<=1)
states: 462
abstracting: (P_4_0<=1)
states: 462

EG iterations: 0
abstracting: (cY_1<=P_2_3)
states: 280
abstracting: (L_7<=P_4_0)
states: 169
.abstracting: (1<=P_4_4)
states: 51
.abstracting: (P_4_4<=0)
states: 411
.abstracting: (1<=P_4_3)
states: 59
.
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: ~ [EG [[[[[~ [[cX_1<=P_2_2 | P_0_2<=L_6]] | A [1<=P_3_3 U L_0<=1]] & 1<=P_4_1] | [E [[cX_3<=0 | R_0<=L_6] U 1<=L_3] & [1<=cY_3 & AG [1<=P_0_3]]]] | ~ [A [[[cX_4<=1 & 1<=R_3] | [P_2_1<=R_7 & 1<=P_2_1]] U AG [P_3_4<=R_2]]]]]]
normalized: ~ [EG [[~ [[~ [EG [E [true U ~ [P_3_4<=R_2]]]] & ~ [E [E [true U ~ [P_3_4<=R_2]] U [~ [[[P_2_1<=R_7 & 1<=P_2_1] | [cX_4<=1 & 1<=R_3]]] & E [true U ~ [P_3_4<=R_2]]]]]]] | [[[1<=cY_3 & ~ [E [true U ~ [1<=P_0_3]]]] & E [[cX_3<=0 | R_0<=L_6] U 1<=L_3]] | [1<=P_4_1 & [[~ [EG [~ [L_0<=1]]] & ~ [E [~ [L_0<=1] U [~ [1<=P_3_3] & ~ [L_0<=1]]]]] | ~ [[cX_1<=P_2_2 | P_0_2<=L_6]]]]]]]]

abstracting: (P_0_2<=L_6)
states: 451
abstracting: (cX_1<=P_2_2)
states: 270
abstracting: (L_0<=1)
states: 462
abstracting: (1<=P_3_3)
states: 47
abstracting: (L_0<=1)
states: 462
abstracting: (L_0<=1)
states: 462
.
EG iterations: 1
abstracting: (1<=P_4_1)
states: 59
abstracting: (1<=L_3)
states: 258
abstracting: (R_0<=L_6)
states: 301
abstracting: (cX_3<=0)
states: 255
abstracting: (1<=P_0_3)
states: 59
abstracting: (1<=cY_3)
states: 207
abstracting: (P_3_4<=R_2)
states: 450
abstracting: (1<=R_3)
states: 301
abstracting: (cX_4<=1)
states: 462
abstracting: (1<=P_2_1)
states: 43
abstracting: (P_2_1<=R_7)
states: 442
abstracting: (P_3_4<=R_2)
states: 450
abstracting: (P_3_4<=R_2)
states: 450
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

totally nodes used: 104679 (1.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 70800 599528 670328
used/not used/entry size/cache size: 668278 66440586 16 1024MB
basic ops cache: hits/miss/sum: 19264 226284 245548
used/not used/entry size/cache size: 346607 16430609 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: 3030 22269 25299
used/not used/entry size/cache size: 22266 8366342 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 67008347
1 96528
2 3821
3 163
4 5
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.910sec


BK_STOP 1678648395339

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
R_0
L_9

The net has transition(s) that can never fire:


check for constant places
L_9
R_0
found 2 constant places
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec


iterations count:328 (13), effective:25 (1)

initing FirstDep: 0m 0.000sec


iterations count:59 (2), effective:5 (0)

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

iterations count:67 (2), effective:4 (0)

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

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

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

iterations count:60 (2), effective:3 (0)

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

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

iterations count:122 (4), effective:14 (0)

iterations count:60 (2), effective:3 (0)

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

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

iterations count:60 (2), effective:3 (0)

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

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

iterations count:212 (8), effective:17 (0)

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

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

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

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

iterations count:67 (2), effective:4 (0)

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

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

iterations count:74 (2), effective:4 (0)

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

iterations count:74 (2), effective:4 (0)

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

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

iterations count:74 (2), effective:4 (0)

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

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

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

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

iterations count:134 (5), effective:9 (0)

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

iterations count:82 (3), effective:5 (0)

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

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

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

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

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

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

iterations count:175 (7), effective:17 (0)

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

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

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

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

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

iterations count:47 (1), effective:2 (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="NQueens-PT-05"
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 NQueens-PT-05, 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 r257-smll-167863532200009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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