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

About the Execution of ITS-Tools for Sudoku-PT-AN15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1804252.00 0.00 0.00 ?TTFFFTTFFFTTFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532900683.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 itstools
Input is Sudoku-PT-AN15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532900683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 12 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M Apr 12 10:22 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 811K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 840K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 12 11:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 12 11:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 211K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 509K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-PT-AN15-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717063491494

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 10:04:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 10:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:04:52] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-05-30 10:04:52] [INFO ] Transformed 4050 places.
[2024-05-30 10:04:52] [INFO ] Transformed 3375 transitions.
[2024-05-30 10:04:52] [INFO ] Found NUPN structural information;
[2024-05-30 10:04:52] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 37 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 10:04:53] [INFO ] Computed 675 invariants in 56 ms
[2024-05-30 10:04:54] [INFO ] Implicit Places using invariants in 1381 ms returned []
[2024-05-30 10:04:54] [INFO ] Invariant cache hit.
[2024-05-30 10:04:58] [INFO ] Implicit Places using invariants and state equation in 3884 ms returned []
Implicit Place search using SMT with State Equation took 5294 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 5355 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2024-05-30 10:04:59] [INFO ] Flatten gal took : 325 ms
[2024-05-30 10:04:59] [INFO ] Flatten gal took : 196 ms
[2024-05-30 10:05:00] [INFO ] Input system was already deterministic with 3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 13732 ms. (2 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 820 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2149 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 686 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1290 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2204 ms. (18 steps per ms) remains 5/5 properties
[2024-05-30 10:05:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 1350 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 675/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 1350 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 675/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10455ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.10 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 58 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 12088 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1900 ms. (21 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 761 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1302 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2153 ms. (18 steps per ms) remains 5/5 properties
Probabilistic random walk after 131470 steps, saw 131423 distinct states, run finished after 12024 ms. (steps per millisecond=10 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 10:05:33] [INFO ] Computed 44 invariants in 144 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 44/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 3 solved, 2 unsolved in 17736 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3375/4050 variables, 675/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 3 solved, 2 unsolved in 9812 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 28039ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 23 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-PT-AN15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 92 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 10:06:01] [INFO ] Computed 675 invariants in 16 ms
[2024-05-30 10:06:05] [INFO ] Implicit Places using invariants in 4032 ms returned []
[2024-05-30 10:06:05] [INFO ] Invariant cache hit.
[2024-05-30 10:06:12] [INFO ] Implicit Places using invariants and state equation in 6638 ms returned []
Implicit Place search using SMT with State Equation took 10672 ms to find 0 implicit places.
[2024-05-30 10:06:12] [INFO ] Redundant transitions in 195 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10972 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-00
Product exploration timeout after 43450 steps with 219 reset in 10002 ms.
Product exploration timeout after 43290 steps with 218 reset in 10004 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 535 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (200 resets) in 23237 ms. (1 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 757 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3805 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8420 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9194 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8328 ms. (4 steps per ms) remains 5/5 properties
[2024-05-30 10:06:50] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3451 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3011 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9502ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 46 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 13233 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 765 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8613 ms. (4 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 129471 steps, run timeout after 15005 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 129471 steps, saw 129425 distinct states, run finished after 15009 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 10:07:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19125 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15612 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 35334ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 55 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 47 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 10:07:56] [INFO ] Invariant cache hit.
[2024-05-30 10:08:00] [INFO ] Implicit Places using invariants in 3942 ms returned []
[2024-05-30 10:08:00] [INFO ] Invariant cache hit.
[2024-05-30 10:08:06] [INFO ] Implicit Places using invariants and state equation in 6529 ms returned []
Implicit Place search using SMT with State Equation took 10475 ms to find 0 implicit places.
[2024-05-30 10:08:06] [INFO ] Redundant transitions in 161 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10689 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 17 factoid took 649 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Support contains 225 out of 4050 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 45 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 10:08:07] [INFO ] Invariant cache hit.
[2024-05-30 10:08:11] [INFO ] Implicit Places using invariants in 3891 ms returned []
[2024-05-30 10:08:11] [INFO ] Invariant cache hit.
[2024-05-30 10:08:18] [INFO ] Implicit Places using invariants and state equation in 6517 ms returned []
Implicit Place search using SMT with State Equation took 10412 ms to find 0 implicit places.
[2024-05-30 10:08:18] [INFO ] Redundant transitions in 111 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10580 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (200 resets) in 8599 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 757 ms. (52 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310866 steps, run timeout after 6011 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 310866 steps, saw 310717 distinct states, run finished after 6012 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-30 10:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3375/3600 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/3600 variables, 3375/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3600 variables, 0/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1701 ms.
Refiners :[Domain max(s): 3600/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3375/3600 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3600 variables, 3375/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3600 variables, 0/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1700 ms.
Refiners :[Domain max(s): 3600/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3460ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.7 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 193 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 8548 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346467 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 346467 steps, saw 345047 distinct states, run finished after 6001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 10:08:39] [INFO ] Computed 44 invariants in 94 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3375/4050 variables, 675/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3830 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45015 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 48978ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 55 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 675/675 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 47 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 10:09:28] [INFO ] Invariant cache hit.
[2024-05-30 10:09:31] [INFO ] Implicit Places using invariants in 2983 ms returned []
[2024-05-30 10:09:31] [INFO ] Invariant cache hit.
[2024-05-30 10:12:11] [INFO ] Implicit Places using invariants and state equation in 160027 ms returned []
Implicit Place search using SMT with State Equation took 163015 ms to find 0 implicit places.
[2024-05-30 10:12:12] [INFO ] Redundant transitions in 106 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163176 ms. Remains : 675/675 places, 3375/3375 transitions.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 47380 steps with 238 reset in 10001 ms.
Product exploration timeout after 46270 steps with 233 reset in 10001 ms.
Built C files in :
/tmp/ltsmin16078021522815053465
[2024-05-30 10:12:32] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 10:12:32] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16078021522815053465
Running compilation step : cd /tmp/ltsmin16078021522815053465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16078021522815053465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16078021522815053465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.4 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 66 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 10:12:35] [INFO ] Invariant cache hit.
[2024-05-30 10:12:38] [INFO ] Implicit Places using invariants in 3057 ms returned []
[2024-05-30 10:12:38] [INFO ] Invariant cache hit.
[2024-05-30 10:15:18] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 163082 ms to find 0 implicit places.
[2024-05-30 10:15:18] [INFO ] Redundant transitions in 107 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163261 ms. Remains : 675/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin17413236605333777285
[2024-05-30 10:15:18] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 10:15:18] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17413236605333777285
Running compilation step : cd /tmp/ltsmin17413236605333777285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17413236605333777285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17413236605333777285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 10:15:22] [INFO ] Flatten gal took : 109 ms
[2024-05-30 10:15:22] [INFO ] Flatten gal took : 110 ms
[2024-05-30 10:15:22] [INFO ] Time to serialize gal into /tmp/LTL12809407795844741128.gal : 35 ms
[2024-05-30 10:15:22] [INFO ] Time to serialize properties into /tmp/LTL3315736826492786917.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12809407795844741128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9002887441071500960.hoa' '-atoms' '/tmp/LTL3315736826492786917.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3315736826492786917.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9002887441071500960.hoa
Detected timeout of ITS tools.
[2024-05-30 10:15:37] [INFO ] Flatten gal took : 128 ms
[2024-05-30 10:15:37] [INFO ] Flatten gal took : 132 ms
[2024-05-30 10:15:37] [INFO ] Time to serialize gal into /tmp/LTL15280279548369416077.gal : 23 ms
[2024-05-30 10:15:37] [INFO ] Time to serialize properties into /tmp/LTL1555177188161484244.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15280279548369416077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1555177188161484244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
Detected timeout of ITS tools.
[2024-05-30 10:15:53] [INFO ] Flatten gal took : 121 ms
[2024-05-30 10:15:53] [INFO ] Applying decomposition
[2024-05-30 10:15:53] [INFO ] Flatten gal took : 124 ms
[2024-05-30 10:16:13] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6212291162671518414.txt' '-o' '/tmp/graph6212291162671518414.bin' '-w' '/tmp/graph6212291162671518414.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 10:16:13] [INFO ] Flatten gal took : 128 ms
[2024-05-30 10:16:13] [INFO ] Time to serialize gal into /tmp/LTL1103368515702238518.gal : 24 ms
[2024-05-30 10:16:13] [INFO ] Time to serialize properties into /tmp/LTL12578145189714127251.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1103368515702238518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12578145189714127251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN15-LTLCardinality-00 finished in 627544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U G((p1 U p2)))&&X(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 18 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 10:16:28] [INFO ] Computed 675 invariants in 20 ms
[2024-05-30 10:16:32] [INFO ] Implicit Places using invariants in 3470 ms returned []
[2024-05-30 10:16:32] [INFO ] Invariant cache hit.
[2024-05-30 10:16:38] [INFO ] Implicit Places using invariants and state equation in 6239 ms returned []
Implicit Place search using SMT with State Equation took 9713 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 9735 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-04
Product exploration timeout after 10570 steps with 2641 reset in 10003 ms.
Product exploration timeout after 10550 steps with 2639 reset in 10010 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 570 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 13 to 8
RANDOM walk for 40000 steps (200 resets) in 44055 ms. (0 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6130 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9368 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12220 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16165 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9732 ms. (4 steps per ms) remains 5/5 properties
[2024-05-30 10:17:29] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 3825/7425 variables, and 4275 constraints, problems are : Problem set: 5 solved, 0 unsolved in 1109 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 450/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7735ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (AND (OR p0 (NOT p2)) (OR p0 (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p1)))
Knowledge based reduction with 19 factoid took 502 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN15-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-04 finished in 68402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(p2)||p1)))))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 103 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 10:17:37] [INFO ] Computed 44 invariants in 78 ms
[2024-05-30 10:17:41] [INFO ] Implicit Places using invariants in 4451 ms returned []
[2024-05-30 10:17:41] [INFO ] Invariant cache hit.
[2024-05-30 10:20:21] [INFO ] Implicit Places using invariants and state equation in 160029 ms returned []
Implicit Place search using SMT with State Equation took 164481 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164586 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 950 steps with 318 reset in 282 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-08 finished in 165022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(p1)||G(!p2)))))'
Support contains 4 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 108 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-30 10:20:22] [INFO ] Computed 44 invariants in 125 ms
[2024-05-30 10:20:26] [INFO ] Implicit Places using invariants in 4354 ms returned []
[2024-05-30 10:20:26] [INFO ] Invariant cache hit.
[2024-05-30 10:21:18] [INFO ] Performed 1/676 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 10:21:50] [INFO ] Performed 3/676 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 10:22:27] [INFO ] Performed 6/676 implicitness test of which 0 returned IMPLICIT in 100 seconds.
[2024-05-30 10:23:00] [INFO ] Performed 9/676 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-05-30 10:23:00] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-05-30 10:23:00] [INFO ] Implicit Places using invariants and state equation in 153432 ms returned []
Implicit Place search using SMT with State Equation took 157790 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157900 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-09
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 44 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-09 finished in 158126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 89 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-30 10:23:00] [INFO ] Computed 44 invariants in 205 ms
[2024-05-30 10:23:04] [INFO ] Implicit Places using invariants in 4171 ms returned []
[2024-05-30 10:23:04] [INFO ] Invariant cache hit.
[2024-05-30 10:25:44] [INFO ] Implicit Places using invariants and state equation in 160031 ms returned []
Implicit Place search using SMT with State Equation took 164208 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164303 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-13
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 42 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-13 finished in 164427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 93 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-30 10:25:45] [INFO ] Computed 44 invariants in 270 ms
[2024-05-30 10:25:49] [INFO ] Implicit Places using invariants in 4455 ms returned []
[2024-05-30 10:25:49] [INFO ] Invariant cache hit.
[2024-05-30 10:28:29] [INFO ] Implicit Places using invariants and state equation in 160018 ms returned []
Implicit Place search using SMT with State Equation took 164476 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164572 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-14
Stuttering criterion allowed to conclude after 954 steps with 8 reset in 263 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-14 finished in 164943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
[2024-05-30 10:28:30] [INFO ] Flatten gal took : 116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15145555146908613697
[2024-05-30 10:28:30] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 10:28:30] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15145555146908613697
Running compilation step : cd /tmp/ltsmin15145555146908613697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 10:28:30] [INFO ] Applying decomposition
[2024-05-30 10:28:30] [INFO ] Flatten gal took : 119 ms
Compilation finished in 14243 ms.
Running link step : cd /tmp/ltsmin15145555146908613697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 1443 ms.
Running LTSmin : cd /tmp/ltsmin15145555146908613697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((((LTLAPp0==true) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
[2024-05-30 10:28:50] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7458203664118109402.txt' '-o' '/tmp/graph7458203664118109402.bin' '-w' '/tmp/graph7458203664118109402.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 10:28:50] [INFO ] Flatten gal took : 247 ms
[2024-05-30 10:28:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality15868765705508748386.gal : 67 ms
[2024-05-30 10:28:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality12319257282503307415.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15868765705508748386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12319257282503307415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598

BK_STOP 1717065295746

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Sudoku-PT-AN15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532900683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN15.tgz
mv Sudoku-PT-AN15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;