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.r490-tall-167912708200130.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 Sudoku-COL-BN01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708200130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.7K 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-COL-BN01-CTLFireability-00
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-01
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-02
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-03
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-04
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-05
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-06
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-07
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-08
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-09
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-10
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-11
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-12
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-13
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-14
FORMULA_NAME Sudoku-COL-BN01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679192935054

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=Sudoku-COL-BN01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 02:28:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 02:28:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:28:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-19 02:28:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 02:28:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 681 ms
[2023-03-19 02:28:57] [WARNING] OR operator with single subterm is malformed PNML.
[2023-03-19 02:28:57] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5 PT places and 1.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
[2023-03-19 02:28:57] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 3 ms.
[2023-03-19 02:28:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 9 formulas.
FORMULA Sudoku-COL-BN01-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2023-03-19 02:28:57] [INFO ] Flatten gal took : 11 ms
[2023-03-19 02:28:57] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:57] [INFO ] Unfolded HLPN to a Petri net with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-19 02:28:57] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 4 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4 transition count 1
Applied a total of 1 rules in 5 ms. Remains 4 /5 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 02:28:57] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 02:28:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-19 02:28:57] [INFO ] Invariant cache hit.
[2023-03-19 02:28:57] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 02:28:57] [INFO ] Invariant cache hit.
[2023-03-19 02:28:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 4/5 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-19 02:28:57] [INFO ] Flatten gal took : 3 ms
[2023-03-19 02:28:57] [INFO ] Flatten gal took : 3 ms
[2023-03-19 02:28:57] [INFO ] Input system was already deterministic with 1 transitions.
FORMULA Sudoku-COL-BN01-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:28:58] [INFO ] Invariant cache hit.
[2023-03-19 02:28:58] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 11 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 2 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 4/4 places, 1/1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 0 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 1 ms
[2023-03-19 02:28:58] [INFO ] Input system was already deterministic with 1 transitions.
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 3 ms
[2023-03-19 02:28:58] [INFO ] Flatten gal took : 2 ms
[2023-03-19 02:28:58] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 02:28:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 1 transitions and 4 arcs took 0 ms.
Total runtime 1938 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: 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.731sec


RS generation: 0m 0.000sec


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



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

checking: EX [AF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]
normalized: EX [~ [EG [~ [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]

abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Sudoku-COL-BN01-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]
normalized: EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.-> the formula is FALSE

FORMULA Sudoku-COL-BN01-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AX [EF [[EG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] | AX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]]
normalized: ~ [E [true U EX [~ [E [true U [~ [EX [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AX [1<=0] | [AF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & [[AG [AX [[[p0<=0 | p1<=0] | [p2<=0 | p3<=0]]]] | p0<=0] | [p1<=0 | [p2<=0 | p3<=0]]]]]]
normalized: EX [[[~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] & [[~ [E [true U EX [~ [[[p0<=0 | p1<=0] | [p2<=0 | p3<=0]]]]]] | p0<=0] | [[p2<=0 | p3<=0] | p1<=0]]] | ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p1<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AF [EG [[[[AF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & 1<=p0] & [1<=p1 & [1<=p2 & 1<=p3]]] | [EG [[[p0<=0 | p1<=0] | [p2<=0 | p3<=0]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]
normalized: ~ [EG [~ [EG [[[[~ [EG [~ [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]] & 1<=p0] & [[1<=p2 & 1<=p3] & 1<=p1]] | [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] | EG [[[p2<=0 | p3<=0] | [p0<=0 | p1<=0]]]]]]]]]

abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p2<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1

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

FORMULA Sudoku-COL-BN01-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U ~ [EF [[[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] | A [EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]]
normalized: E [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] U ~ [E [true U [[~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] & ~ [E [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U [~ [EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]] & ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] | [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[~ [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & [AF [EG [AG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]] & AF [EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]] U ~ [[EF [EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]] | [[EG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & ~ [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]]
normalized: [~ [EG [[[~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & ~ [E [[[~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] U [~ [[~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & [~ [EG [~ [EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] & ~ [EG [~ [EG [~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]]]]]] & [[~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 0
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [[EX [[[E [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & 1<=p0] & [1<=p1 & [1<=p2 & 1<=p3]]]] | AX [[[[[[[p0<=0 | p1<=0] | [p2<=0 | p3<=0]] & A [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]] | p0<=0] | [p1<=0 | p2<=0]] | [[p3<=0 | p0<=0] | [p1<=0 | [p2<=0 | p3<=0]]]]]]]
normalized: EG [[EX [[[[1<=p2 & 1<=p3] & 1<=p1] & [E [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & 1<=p0]]] | ~ [EX [~ [[[[[[~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] & ~ [E [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & [[p2<=0 | p3<=0] | [p0<=0 | p1<=0]]] | p0<=0] | [p1<=0 | p2<=0]] | [[[p2<=0 | p3<=0] | p1<=0] | [p3<=0 | p0<=0]]]]]]]]

abstracting: (p0<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [[[p0<=0 | p1<=0] | [p2<=0 | [p3<=0 | [E [E [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] U [AF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]] & [AF [[[A [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & 1<=p0] & [1<=p1 & [1<=p2 & 1<=p3]]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]]]
normalized: EG [[[[[[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | ~ [EG [~ [[[[1<=p2 & 1<=p3] & 1<=p1] & [[~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] & ~ [E [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & 1<=p0]]]]]] & E [E [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | ~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]] | p3<=0] | p2<=0] | [p0<=0 | p1<=0]]]

abstracting: (p1<=0)
states: 1
abstracting: (p0<=0)
states: 1
abstracting: (p2<=0)
states: 1
abstracting: (p3<=0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[~ [E [EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] U ~ [EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]] & AG [[A [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & EX [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]] U [[~ [E [[AG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & EG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]] U [AG [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & EF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]] & 1<=p0] & [1<=p1 & [1<=p2 & 1<=p3]]]]
normalized: [~ [EG [~ [[[[1<=p2 & 1<=p3] & 1<=p1] & [~ [E [[EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] U [E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]] & 1<=p0]]]]] & ~ [E [~ [[[[1<=p2 & 1<=p3] & 1<=p1] & [~ [E [[EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] U [E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]] & 1<=p0]]] U [~ [[~ [E [true U ~ [[[~ [E [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] & ~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] & EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & ~ [E [EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] U ~ [EX [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]] & ~ [[[[1<=p2 & 1<=p3] & 1<=p1] & [~ [E [[EG [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]] U [E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]] & ~ [E [true U ~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]] & 1<=p0]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-COL-BN01-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [AX [[AF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]] & A [[[~ [[[[E [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]] U [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] & [1<=p0 & 1<=p1]] & [1<=p2 & [1<=p3 & 1<=p0]]] & [[1<=p1 & [1<=p2 & 1<=p3]] & [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]] & 1<=p0] & [1<=p1 & [1<=p2 & 1<=p3]]] U [EF [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]] | [EG [~ [[[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]] | [[1<=p0 & 1<=p1] & [1<=p2 & 1<=p3]]]]]]
normalized: [[~ [EG [~ [[[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & ~ [E [~ [[[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] U [~ [[[~ [[[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] & [[1<=p2 & 1<=p3] & 1<=p1]] & [[[1<=p3 & 1<=p0] & 1<=p2] & [[1<=p0 & 1<=p1] & E [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]] & 1<=p0] & [[1<=p2 & 1<=p3] & 1<=p1]]] & ~ [[[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]] | E [true U [[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]]] & EG [~ [EX [~ [[[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]] | ~ [EG [~ [[[1<=p2 & 1<=p3] & [1<=p0 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
..
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p3)
states: 1
abstracting: (1<=p2)
states: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Sudoku-COL-BN01-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 28 (2.8e+01)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 74 11 85
used/not used/entry size/cache size: 21 67108843 16 1024MB
basic ops cache: hits/miss/sum: 210 46 256
used/not used/entry size/cache size: 77 16777139 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: 368 9 377
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 67108836
1 28
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.337sec


BK_STOP 1679192943693

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

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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-COL-BN01"
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 Sudoku-COL-BN01, 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 r490-tall-167912708200130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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