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.r266-smll-167863540300010.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 marciexred
Input is NQueens-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540300010
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678730419539

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:00:22] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-13 18:00:22] [INFO ] Transformed 55 places.
[2023-03-13 18:00:22] [INFO ] Transformed 25 transitions.
[2023-03-13 18:00:22] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 6 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 28 transition count 25
Applied a total of 25 rules in 17 ms. Remains 28 /53 variables (removed 25) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 18:00:22] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-13 18:00:22] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-13 18:00:22] [INFO ] Invariant cache hit.
[2023-03-13 18:00:22] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/53 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 27/53 places, 25/25 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 29 ms
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:00:22] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 22 steps, including 4 resets, run visited all 30 properties in 20 ms. (steps per millisecond=1 )
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:00:22] [INFO ] Input system was already deterministic with 25 transitions.
Computed a total of 27 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:22] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:22] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:22] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:22] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 25/25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Input system was already deterministic with 25 transitions.
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:23] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2023-03-13 18:00:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 25 transitions and 99 arcs took 1 ms.
Total runtime 1289 ms.
There are residual formulas that ITS could not solve within timeout
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 27 NrTr: 25 NrArc: 99)

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

net check time: 0m 0.000sec

init dd package: 0m 3.422sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 1787 (1.8e+03) #states 452



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

checking: EG [E [[[1<=p4 & 1<=p8] & [1<=p15 & 1<=p25]] U ~ [EG [AG [[[1<=p2 & 1<=p6] & [1<=p15 & 1<=p21]]]]]]]
normalized: EG [E [[[1<=p15 & 1<=p25] & [1<=p4 & 1<=p8]] U ~ [EG [~ [E [true U ~ [[[1<=p15 & 1<=p21] & [1<=p2 & 1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 207
abstracting: (1<=p2)
states: 230
abstracting: (1<=p21)
states: 256
abstracting: (1<=p15)
states: 256
.
EG iterations: 1
abstracting: (1<=p8)
states: 207
abstracting: (1<=p4)
states: 183
abstracting: (1<=p25)
states: 338
abstracting: (1<=p15)
states: 256

EG iterations: 0
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: EG [E [EX [EX [AF [[[1<=p1 & 1<=p6] & [1<=p14 & 1<=p20]]]]] U ~ [EF [[[1<=p4 & 1<=p6] & [1<=p17 & 1<=p23]]]]]]
normalized: EG [E [EX [EX [~ [EG [~ [[[1<=p14 & 1<=p20] & [1<=p1 & 1<=p6]]]]]]] U ~ [E [true U [[1<=p17 & 1<=p23] & [1<=p4 & 1<=p6]]]]]]

abstracting: (1<=p6)
states: 207
abstracting: (1<=p4)
states: 183
abstracting: (1<=p23)
states: 256
abstracting: (1<=p17)
states: 338
abstracting: (1<=p6)
states: 207
abstracting: (1<=p1)
states: 207
abstracting: (1<=p20)
states: 297
abstracting: (1<=p14)
states: 232
.
EG iterations: 1
...
EG iterations: 1
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [[EG [[[1<=p0 & 1<=p8] & [1<=p11 & 1<=p21]]] & [[p1<=0 | p8<=0] | [p12<=0 | p22<=0]]]]
normalized: E [true U [[[p12<=0 | p22<=0] | [p1<=0 | p8<=0]] & EG [[[1<=p11 & 1<=p21] & [1<=p0 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 207
abstracting: (1<=p0)
states: 183
abstracting: (1<=p21)
states: 256
abstracting: (1<=p11)
states: 338
......
EG iterations: 6
abstracting: (p8<=0)
states: 245
abstracting: (p1<=0)
states: 245
abstracting: (p22<=0)
states: 220
abstracting: (p12<=0)
states: 155
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [[AF [[[1<=p4 & 1<=p6] & [1<=p17 & 1<=p23]]] | EF [[[AG [[[p2<=0 | p7<=0] | [p14<=0 | p22<=0]]] | [[[1<=p1 & 1<=p6] & [1<=p14 & 1<=p20]] | p3<=0]] | [p7<=0 | [p15<=0 | p23<=0]]]]]]
normalized: EX [[E [true U [[[p15<=0 | p23<=0] | p7<=0] | [[[[1<=p14 & 1<=p20] & [1<=p1 & 1<=p6]] | p3<=0] | ~ [E [true U ~ [[[p14<=0 | p22<=0] | [p2<=0 | p7<=0]]]]]]]] | ~ [EG [~ [[[1<=p17 & 1<=p23] & [1<=p4 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 207
abstracting: (1<=p4)
states: 183
abstracting: (1<=p23)
states: 256
abstracting: (1<=p17)
states: 338
.
EG iterations: 1
abstracting: (p7<=0)
states: 222
abstracting: (p2<=0)
states: 222
abstracting: (p22<=0)
states: 220
abstracting: (p14<=0)
states: 220
abstracting: (p3<=0)
states: 245
abstracting: (1<=p6)
states: 207
abstracting: (1<=p1)
states: 207
abstracting: (1<=p20)
states: 297
abstracting: (1<=p14)
states: 232
abstracting: (p7<=0)
states: 222
abstracting: (p23<=0)
states: 196
abstracting: (p15<=0)
states: 196
.-> the formula is TRUE

FORMULA NQueens-PT-05-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EX [EG [[[AG [[[p2<=0 | p5<=0] | [p16<=0 | p20<=0]]] | EG [[[p4<=0 | p9<=0] | [p14<=0 | p26<=0]]]] | [[[1<=p4 & 1<=p7] & [1<=p16 & 1<=p24]] | [[EG [[[p3<=0 | p9<=0] | [p13<=0 | p25<=0]]] & 1<=p3] & [1<=p5 & [1<=p17 & 1<=p21]]]]]]]
normalized: EX [EG [[[[[[1<=p17 & 1<=p21] & 1<=p5] & [EG [[[p13<=0 | p25<=0] | [p3<=0 | p9<=0]]] & 1<=p3]] | [[1<=p16 & 1<=p24] & [1<=p4 & 1<=p7]]] | [EG [[[p14<=0 | p26<=0] | [p4<=0 | p9<=0]]] | ~ [E [true U ~ [[[p16<=0 | p20<=0] | [p2<=0 | p5<=0]]]]]]]]]

abstracting: (p5<=0)
states: 269
abstracting: (p2<=0)
states: 222
abstracting: (p20<=0)
states: 155
abstracting: (p16<=0)
states: 155
abstracting: (p9<=0)
states: 269
abstracting: (p4<=0)
states: 269
abstracting: (p26<=0)
states: 50
abstracting: (p14<=0)
states: 220
.
EG iterations: 1
abstracting: (1<=p7)
states: 230
abstracting: (1<=p4)
states: 183
abstracting: (1<=p24)
states: 297
abstracting: (1<=p16)
states: 297
abstracting: (1<=p3)
states: 207
abstracting: (p9<=0)
states: 269
abstracting: (p3<=0)
states: 245
abstracting: (p25<=0)
states: 114
abstracting: (p13<=0)
states: 196
.
EG iterations: 1
abstracting: (1<=p5)
states: 183
abstracting: (1<=p21)
states: 256
abstracting: (1<=p17)
states: 338
.
EG iterations: 1
.-> the formula is TRUE

FORMULA NQueens-PT-05-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EG [[[p3<=0 | [p5<=0 | p17<=0]] | [p21<=0 | [[[1<=p1 & 1<=p9] & [1<=p11 & 1<=p23]] | [[1<=p2 & 1<=p5] & [1<=p16 & [1<=p20 & EX [[[[[1<=p1 & 1<=p6] & [1<=p14 & 1<=p20]] | p4<=0] | [p6<=0 | [p17<=0 | p23<=0]]]]]]]]]]]
normalized: EG [[[p21<=0 | [[[1<=p16 & [1<=p20 & EX [[[p6<=0 | [p17<=0 | p23<=0]] | [p4<=0 | [[1<=p14 & 1<=p20] & [1<=p1 & 1<=p6]]]]]]] & [1<=p2 & 1<=p5]] | [[1<=p11 & 1<=p23] & [1<=p1 & 1<=p9]]]] | [p3<=0 | [p5<=0 | p17<=0]]]]

abstracting: (p17<=0)
states: 114
abstracting: (p5<=0)
states: 269
abstracting: (p3<=0)
states: 245
abstracting: (1<=p9)
states: 183
abstracting: (1<=p1)
states: 207
abstracting: (1<=p23)
states: 256
abstracting: (1<=p11)
states: 338
abstracting: (1<=p5)
states: 183
abstracting: (1<=p2)
states: 230
abstracting: (1<=p6)
states: 207
abstracting: (1<=p1)
states: 207
abstracting: (1<=p20)
states: 297
abstracting: (1<=p14)
states: 232
abstracting: (p4<=0)
states: 269
abstracting: (p23<=0)
states: 196
abstracting: (p17<=0)
states: 114
abstracting: (p6<=0)
states: 245
.abstracting: (1<=p20)
states: 297
abstracting: (1<=p16)
states: 297
abstracting: (p21<=0)
states: 196
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: [EF [EX [EF [[[[p1<=0 | p8<=0] | [p12<=0 | p22<=0]] & [[p2<=0 | p5<=0] | [p16<=0 | p20<=0]]]]]] & EX [[A [AX [~ [[[1<=p1 & 1<=p9] & [1<=p11 & 1<=p23]]]] U [[1<=p3 & 1<=p9] & [1<=p13 & 1<=p25]]] | [[1<=p2 & 1<=p7] & [1<=p14 & 1<=p22]]]]]
normalized: [EX [[[[1<=p14 & 1<=p22] & [1<=p2 & 1<=p7]] | [~ [EG [~ [[[1<=p13 & 1<=p25] & [1<=p3 & 1<=p9]]]]] & ~ [E [~ [[[1<=p13 & 1<=p25] & [1<=p3 & 1<=p9]]] U [EX [[[1<=p11 & 1<=p23] & [1<=p1 & 1<=p9]]] & ~ [[[1<=p13 & 1<=p25] & [1<=p3 & 1<=p9]]]]]]]]] & E [true U EX [E [true U [[[p16<=0 | p20<=0] | [p2<=0 | p5<=0]] & [[p12<=0 | p22<=0] | [p1<=0 | p8<=0]]]]]]]

abstracting: (p8<=0)
states: 245
abstracting: (p1<=0)
states: 245
abstracting: (p22<=0)
states: 220
abstracting: (p12<=0)
states: 155
abstracting: (p5<=0)
states: 269
abstracting: (p2<=0)
states: 222
abstracting: (p20<=0)
states: 155
abstracting: (p16<=0)
states: 155
.abstracting: (1<=p9)
states: 183
abstracting: (1<=p3)
states: 207
abstracting: (1<=p25)
states: 338
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 183
abstracting: (1<=p1)
states: 207
abstracting: (1<=p23)
states: 256
abstracting: (1<=p11)
states: 338
.abstracting: (1<=p9)
states: 183
abstracting: (1<=p3)
states: 207
abstracting: (1<=p25)
states: 338
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 183
abstracting: (1<=p3)
states: 207
abstracting: (1<=p25)
states: 338
abstracting: (1<=p13)
states: 256
.
EG iterations: 1
abstracting: (1<=p7)
states: 230
abstracting: (1<=p2)
states: 230
abstracting: (1<=p22)
states: 232
abstracting: (1<=p14)
states: 232
.-> the formula is TRUE

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

MC time: 0m 0.017sec

checking: AF [[[[AG [[[[p3<=0 | p6<=0] | [p16<=0 | p22<=0]] | [[p0<=0 | p8<=0] | [p11<=0 | [p21<=0 | ~ [E [[[1<=p4 & 1<=p8] & [1<=p15 & 1<=p25]] U [[1<=p1 & 1<=p7] & [1<=p13 & 1<=p21]]]]]]]]] & 1<=p0] & [1<=p6 & 1<=p13]] & [[1<=p19 & 1<=p3] & [1<=p7 & [1<=p15 & 1<=p23]]]]]
normalized: ~ [EG [~ [[[[1<=p7 & [1<=p15 & 1<=p23]] & [1<=p19 & 1<=p3]] & [[1<=p6 & 1<=p13] & [1<=p0 & ~ [E [true U ~ [[[[p11<=0 | [p21<=0 | ~ [E [[[1<=p15 & 1<=p25] & [1<=p4 & 1<=p8]] U [[1<=p13 & 1<=p21] & [1<=p1 & 1<=p7]]]]]] | [p0<=0 | p8<=0]] | [[p16<=0 | p22<=0] | [p3<=0 | p6<=0]]]]]]]]]]]]

abstracting: (p6<=0)
states: 245
abstracting: (p3<=0)
states: 245
abstracting: (p22<=0)
states: 220
abstracting: (p16<=0)
states: 155
abstracting: (p8<=0)
states: 245
abstracting: (p0<=0)
states: 269
abstracting: (1<=p7)
states: 230
abstracting: (1<=p1)
states: 207
abstracting: (1<=p21)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p8)
states: 207
abstracting: (1<=p4)
states: 183
abstracting: (1<=p25)
states: 338
abstracting: (1<=p15)
states: 256
abstracting: (p21<=0)
states: 196
abstracting: (p11<=0)
states: 114
abstracting: (1<=p0)
states: 183
abstracting: (1<=p13)
states: 256
abstracting: (1<=p6)
states: 207
abstracting: (1<=p3)
states: 207
abstracting: (1<=p19)
states: 338
abstracting: (1<=p23)
states: 256
abstracting: (1<=p15)
states: 256
abstracting: (1<=p7)
states: 230
.
EG iterations: 1
-> the formula is FALSE

FORMULA NQueens-PT-05-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[EG [[[1<=p3 & 1<=p9] & [1<=p13 & 1<=p25]]] | [AG [AF [[[p1<=0 | p8<=0] | [p12<=0 | p22<=0]]]] | AF [E [[E [[[1<=p4 & 1<=p9] & [1<=p14 & 1<=p26]] U [[1<=p0 & 1<=p7] & [1<=p12 & 1<=p20]]] & AG [[[1<=p0 & 1<=p9] & [1<=p10 & 1<=p22]]]] U AX [[[1<=p2 & 1<=p7] & [1<=p14 & 1<=p22]]]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [E [[~ [E [true U ~ [[[1<=p10 & 1<=p22] & [1<=p0 & 1<=p9]]]]] & E [[[1<=p14 & 1<=p26] & [1<=p4 & 1<=p9]] U [[1<=p12 & 1<=p20] & [1<=p0 & 1<=p7]]]] U ~ [EX [~ [[[1<=p14 & 1<=p22] & [1<=p2 & 1<=p7]]]]]]]]] | ~ [E [true U EG [~ [[[p12<=0 | p22<=0] | [p1<=0 | p8<=0]]]]]]] | EG [[[1<=p13 & 1<=p25] & [1<=p3 & 1<=p9]]]]]]]

abstracting: (1<=p9)
states: 183
abstracting: (1<=p3)
states: 207
abstracting: (1<=p25)
states: 338
abstracting: (1<=p13)
states: 256
......
EG iterations: 6
abstracting: (p8<=0)
states: 245
abstracting: (p1<=0)
states: 245
abstracting: (p22<=0)
states: 220
abstracting: (p12<=0)
states: 155
......
EG iterations: 6
abstracting: (1<=p7)
states: 230
abstracting: (1<=p2)
states: 230
abstracting: (1<=p22)
states: 232
abstracting: (1<=p14)
states: 232
.abstracting: (1<=p7)
states: 230
abstracting: (1<=p0)
states: 183
abstracting: (1<=p20)
states: 297
abstracting: (1<=p12)
states: 297
abstracting: (1<=p9)
states: 183
abstracting: (1<=p4)
states: 183
abstracting: (1<=p26)
states: 402
abstracting: (1<=p14)
states: 232
abstracting: (1<=p9)
states: 183
abstracting: (1<=p0)
states: 183
abstracting: (1<=p22)
states: 232
abstracting: (1<=p10)
states: 402
......
EG iterations: 6
.-> the formula is TRUE

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

MC time: 0m 0.036sec

checking: EG [[[[p9<=0 | p13<=0] | p3<=0] | [p25<=0 | [E [[~ [[[1<=p1 & 1<=p7] & [1<=p13 & 1<=p21]]] & [EG [[[1<=p2 & 1<=p9] & [1<=p12 & 1<=p24]]] & [~ [[[1<=p1 & 1<=p5] & [1<=p15 & 1<=p19]]] | [[[1<=p1 & 1<=p5] & [1<=p15 & 1<=p19]] & [[1<=p0 & 1<=p9] & [1<=p10 & 1<=p22]]]]]] U [E [[[1<=p0 & 1<=p7] & [1<=p12 & 1<=p20]] U [[1<=p2 & 1<=p8] & [1<=p13 & 1<=p23]]] | [[1<=p1 & 1<=p9] & [1<=p11 & [1<=p23 & ~ [[[1<=p4 & 1<=p5] & [1<=p18 & 1<=p22]]]]]]]] | [[1<=p0 & 1<=p7] & [1<=p12 & [1<=p20 & E [~ [AX [[[1<=p1 & 1<=p7] & [1<=p13 & 1<=p21]]]] U EX [[[[1<=p2 & 1<=p5] & [1<=p16 & 1<=p20]] & [[1<=p0 & 1<=p6] & [1<=p13 & 1<=p19]]]]]]]]]]]]
normalized: EG [[[p25<=0 | [[[1<=p12 & [1<=p20 & E [EX [~ [[[1<=p13 & 1<=p21] & [1<=p1 & 1<=p7]]]] U EX [[[[1<=p13 & 1<=p19] & [1<=p0 & 1<=p6]] & [[1<=p16 & 1<=p20] & [1<=p2 & 1<=p5]]]]]]] & [1<=p0 & 1<=p7]] | E [[[[[[[1<=p10 & 1<=p22] & [1<=p0 & 1<=p9]] & [[1<=p15 & 1<=p19] & [1<=p1 & 1<=p5]]] | ~ [[[1<=p15 & 1<=p19] & [1<=p1 & 1<=p5]]]] & EG [[[1<=p12 & 1<=p24] & [1<=p2 & 1<=p9]]]] & ~ [[[1<=p13 & 1<=p21] & [1<=p1 & 1<=p7]]]] U [[[1<=p11 & [1<=p23 & ~ [[[1<=p18 & 1<=p22] & [1<=p4 & 1<=p5]]]]] & [1<=p1 & 1<=p9]] | E [[[1<=p12 & 1<=p20] & [1<=p0 & 1<=p7]] U [[1<=p13 & 1<=p23] & [1<=p2 & 1<=p8]]]]]]] | [p3<=0 | [p9<=0 | p13<=0]]]]

abstracting: (p13<=0)
states: 196
abstracting: (p9<=0)
states: 269
abstracting: (p3<=0)
states: 245
abstracting: (1<=p8)
states: 207
abstracting: (1<=p2)
states: 230
abstracting: (1<=p23)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p7)
states: 230
abstracting: (1<=p0)
states: 183
abstracting: (1<=p20)
states: 297
abstracting: (1<=p12)
states: 297
abstracting: (1<=p9)
states: 183
abstracting: (1<=p1)
states: 207
abstracting: (1<=p5)
states: 183
abstracting: (1<=p4)
states: 183
abstracting: (1<=p22)
states: 232
abstracting: (1<=p18)
states: 402
abstracting: (1<=p23)
states: 256
abstracting: (1<=p11)
states: 338
abstracting: (1<=p7)
states: 230
abstracting: (1<=p1)
states: 207
abstracting: (1<=p21)
states: 256
abstracting: (1<=p13)
states: 256
abstracting: (1<=p9)
states: 183
abstracting: (1<=p2)
states: 230
abstracting: (1<=p24)
states: 297
abstracting: (1<=p12)
states: 297
......
EG iterations: 6
abstracting: (1<=p5)
states: 183
abstracting: (1<=p1)
states: 207
abstracting: (1<=p19)
states: 338
abstracting: (1<=p15)
states: 256
abstracting: (1<=p5)
states: 183
abstracting: (1<=p1)
states: 207
abstracting: (1<=p19)
states: 338
abstracting: (1<=p15)
states: 256
abstracting: (1<=p9)
states: 183
abstracting: (1<=p0)
states: 183
abstracting: (1<=p22)
states: 232
abstracting: (1<=p10)
states: 402
abstracting: (1<=p7)
states: 230
abstracting: (1<=p0)
states: 183
abstracting: (1<=p5)
states: 183
abstracting: (1<=p2)
states: 230
abstracting: (1<=p20)
states: 297
abstracting: (1<=p16)
states: 297
abstracting: (1<=p6)
states: 207
abstracting: (1<=p0)
states: 183
abstracting: (1<=p19)
states: 338
abstracting: (1<=p13)
states: 256
.abstracting: (1<=p7)
states: 230
abstracting: (1<=p1)
states: 207
abstracting: (1<=p21)
states: 256
abstracting: (1<=p13)
states: 256
.abstracting: (1<=p20)
states: 297
abstracting: (1<=p12)
states: 297
abstracting: (p25<=0)
states: 114
.
EG iterations: 1
-> the formula is TRUE

FORMULA NQueens-PT-05-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 168257 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 54429 197573 252002
used/not used/entry size/cache size: 293406 66815458 16 1024MB
basic ops cache: hits/miss/sum: 22634 109929 132563
used/not used/entry size/cache size: 168807 16608409 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: 3463 8248 11711
used/not used/entry size/cache size: 8248 8380360 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 66945747
1 158880
2 3552
3 552
4 77
5 37
6 12
7 4
8 3
9 0
>= 10 0

Total processing time: 0m 5.182sec


BK_STOP 1678730429442

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
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:321 (12), effective:25 (1)

initing FirstDep: 0m 0.000sec


iterations count:75 (3), effective:6 (0)

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

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

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

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

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

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

iterations count:64 (2), effective:8 (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:26 (1), effective:1 (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)

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="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is NQueens-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540300010"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;