fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690532600537
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Sudoku-COL-BN01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
329.176 4634.00 10707.00 35.60 FTFF?FTFT??FFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532600537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-COL-BN01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532600537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 11:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 11:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 11:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 12 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.7K May 18 16:43 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-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-BN01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717265976995

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:19:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:19:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:19:38] [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.
[2024-06-01 18:19:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:19:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2024-06-01 18:19:38] [WARNING] OR operator with single subterm is malformed PNML.
[2024-06-01 18:19:38] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5 PT places and 1.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-06-01 18:19:38] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-06-01 18:19:38] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
Remains 15 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).
RANDOM walk for 40000 steps (20000 resets) in 2137 ms. (18 steps per ms) remains 65/73 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 129 ms. (30 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 80 ms. (49 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 115 ms. (34 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 45 ms. (86 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 56 ms. (70 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 49 ms. (80 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 76 ms. (51 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 47 ms. (83 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 28 ms. (137 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
// Phase 1: matrix 1 rows 5 cols
[2024-06-01 18:19:40] [INFO ] Computed 4 invariants in 4 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 4 constraints, problems are : Problem set: 65 solved, 0 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 65 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 65 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 18:19:40] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 18:19:40] [INFO ] Flatten gal took : 13 ms
[2024-06-01 18:19:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 18:19:40] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:40] [INFO ] Unfolded HLPN to a Petri net with 5 places and 1 transitions 5 arcs in 7 ms.
[2024-06-01 18:19:40] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Applied a total of 0 rules in 4 ms. Remains 5 /5 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-06-01 18:19:40] [INFO ] Invariant cache hit.
[2024-06-01 18:19:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 18:19:40] [INFO ] Invariant cache hit.
[2024-06-01 18:19:40] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 5/5 places, 1/1 transitions.
Support contains 5 out of 5 places after structural reductions.
[2024-06-01 18:19:40] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:40] [INFO ] Flatten gal took : 2 ms
[2024-06-01 18:19:40] [INFO ] Input system was already deterministic with 1 transitions.
RANDOM walk for 40000 steps (20000 resets) in 1122 ms. (35 steps per ms) remains 22/26 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (2000 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
[2024-06-01 18:19:41] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 4 constraints, problems are : Problem set: 22 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 22 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 22 atomic propositions for a total of 4 simplifications.
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 0 ms
[2024-06-01 18:19:41] [INFO ] Input system was already deterministic with 1 transitions.
FORMULA Sudoku-COL-BN01-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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).
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 7 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 2/5 places, 1/1 transitions.
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 0 ms
[2024-06-01 18:19:41] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 0 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/5 places, 1/1 transitions.
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 0 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:41] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3 transition count 1
Applied a total of 2 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 3/5 places, 1/1 transitions.
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 0 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 0 ms
[2024-06-01 18:19:41] [INFO ] Input system was already deterministic with 1 transitions.
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:41] [INFO ] Flatten gal took : 1 ms
[2024-06-01 18:19:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 18:19:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5 places, 1 transitions and 5 arcs took 2 ms.
Total runtime 3225 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Sudoku-COL-BN01-CTLCardinality-2024-04
Could not compute solution for formula : Sudoku-COL-BN01-CTLCardinality-2024-09
Could not compute solution for formula : Sudoku-COL-BN01-CTLCardinality-2024-10

BK_STOP 1717265981629

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Sudoku-COL-BN01-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/493/ctl_0_
ctl formula name Sudoku-COL-BN01-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/493/ctl_1_
ctl formula name Sudoku-COL-BN01-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/493/ctl_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-BN01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532600537"
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 [ "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 ;