Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 306K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:50 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 170K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 582K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 361K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 366K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 857K Apr 12 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 499K 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-BN09-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717068515242

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-BN09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 11:28:36] [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 11:28:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 11:28:36] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-05-30 11:28:36] [INFO ] Transformed 1053 places.
[2024-05-30 11:28:36] [INFO ] Transformed 729 transitions.
[2024-05-30 11:28:36] [INFO ] Found NUPN structural information;
[2024-05-30 11:28:36] [INFO ] Parsed PT model containing 1053 places and 729 transitions and 3645 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 50 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 11:28:37] [INFO ] Computed 324 invariants in 36 ms
[2024-05-30 11:28:38] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-30 11:28:38] [INFO ] Invariant cache hit.
[2024-05-30 11:28:39] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 2045 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2024-05-30 11:28:39] [INFO ] Flatten gal took : 178 ms
[2024-05-30 11:28:40] [INFO ] Flatten gal took : 146 ms
[2024-05-30 11:28:40] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (601 resets) in 5457 ms. (7 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
[2024-05-30 11:28:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (OVERLAPS) 729/972 variables, 243/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 729/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/1053 variables, 81/1296 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 81/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1782 variables, 0/2430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1782 variables, 0/2430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3704 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 729/891 variables, 162/324 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 729/1053 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2433 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5027 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 9045ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 324/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2884 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 315765 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 3
Probabilistic random walk after 315765 steps, saw 79432 distinct states, run finished after 3009 ms. (steps per millisecond=104 ) properties seen :0
// Phase 1: matrix 729 rows 324 cols
[2024-05-30 11:28:56] [INFO ] Computed 75 invariants in 37 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 160/322 variables, 73/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 160/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 3 unsolved in 526 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 160/322 variables, 73/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 160/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 726 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42130 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 42804ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 324/324 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:29:39] [INFO ] Invariant cache hit.
[2024-05-30 11:29:39] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-30 11:29:39] [INFO ] Invariant cache hit.
[2024-05-30 11:29:40] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-30 11:29:40] [INFO ] Redundant transitions in 44 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 15ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1779 ms. Remains : 324/324 places, 729/729 transitions.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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' '!(X(G(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 27 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:29:41] [INFO ] Invariant cache hit.
[2024-05-30 11:29:41] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-30 11:29:41] [INFO ] Invariant cache hit.
[2024-05-30 11:29:43] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 2102 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2130 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-00
Product exploration explored 100000 steps with 1508 reset in 5199 ms.
Product exploration explored 100000 steps with 1508 reset in 5179 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (601 resets) in 2039 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 456836 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 456836 steps, saw 99610 distinct states, run finished after 3003 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-30 11:30:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1254 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (603 resets) in 2203 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 458047 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 458047 steps, saw 99784 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-30 11:30:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10917 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 11323ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 324/324 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:30:17] [INFO ] Invariant cache hit.
[2024-05-30 11:30:18] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-30 11:30:18] [INFO ] Invariant cache hit.
[2024-05-30 11:30:19] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2024-05-30 11:30:19] [INFO ] Redundant transitions in 6 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 2135 ms. Remains : 324/324 places, 729/729 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 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 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:30:20] [INFO ] Invariant cache hit.
[2024-05-30 11:30:20] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-30 11:30:20] [INFO ] Invariant cache hit.
[2024-05-30 11:30:22] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-05-30 11:30:22] [INFO ] Redundant transitions in 4 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 2103 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (602 resets) in 3219 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442680 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442680 steps, saw 97648 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-30 11:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1256 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1696ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (601 resets) in 2754 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437783 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 437783 steps, saw 96895 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2024-05-30 11:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9658 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9981ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLCardinality-00 finished in 64579 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' '!((G(p0)||X(X((F(G(!p0))||G(p1))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 11:30:45] [INFO ] Computed 324 invariants in 4 ms
[2024-05-30 11:30:46] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-05-30 11:30:46] [INFO ] Invariant cache hit.
[2024-05-30 11:30:47] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 2255 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 2269 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 206 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-01
Product exploration explored 100000 steps with 1508 reset in 7632 ms.
Product exploration explored 100000 steps with 1508 reset in 7861 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 203 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 21 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[false, p0]
Stuttering acceptance computed with spot in 61 ms :[false, p0]
Support contains 810 out of 1053 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 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 26 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:32:01] [INFO ] Invariant cache hit.
[2024-05-30 11:32:02] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-30 11:32:02] [INFO ] Invariant cache hit.
[2024-05-30 11:32:03] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2024-05-30 11:32:03] [INFO ] Redundant transitions in 7 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 2449 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 28 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[false, p0]
Stuttering acceptance computed with spot in 67 ms :[false, p0]
Stuttering acceptance computed with spot in 75 ms :[false, p0]
Product exploration explored 100000 steps with 1509 reset in 7640 ms.
Product exploration explored 100000 steps with 1507 reset in 7722 ms.
Built C files in :
/tmp/ltsmin17834670103114789127
[2024-05-30 11:32:29] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:32:29] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:29] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:32:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:29] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:32:29] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:29] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17834670103114789127
Running compilation step : cd /tmp/ltsmin17834670103114789127;'/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'
Compilation finished in 2843 ms.
Running link step : cd /tmp/ltsmin17834670103114789127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17834670103114789127;'/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' '--hoa' '/tmp/stateBased8020718417533653805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:32:44] [INFO ] Invariant cache hit.
[2024-05-30 11:32:45] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2024-05-30 11:32:45] [INFO ] Invariant cache hit.
[2024-05-30 11:32:47] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2024-05-30 11:32:47] [INFO ] Redundant transitions in 4 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 2740 ms. Remains : 1053/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin15338299210713051887
[2024-05-30 11:32:47] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:32:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:47] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:32:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:47] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:32:47] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:32:47] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15338299210713051887
Running compilation step : cd /tmp/ltsmin15338299210713051887;'/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'
Compilation finished in 2698 ms.
Running link step : cd /tmp/ltsmin15338299210713051887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15338299210713051887;'/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' '--hoa' '/tmp/stateBased8989446119419756896.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 11:33:02] [INFO ] Flatten gal took : 58 ms
[2024-05-30 11:33:02] [INFO ] Flatten gal took : 57 ms
[2024-05-30 11:33:02] [INFO ] Time to serialize gal into /tmp/LTL1860788750959302098.gal : 15 ms
[2024-05-30 11:33:02] [INFO ] Time to serialize properties into /tmp/LTL3611790271580981401.prop : 2 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/LTL1860788750959302098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14921784221136757243.hoa' '-atoms' '/tmp/LTL3611790271580981401.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/LTL3611790271580981401.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14921784221136757243.hoa
Detected timeout of ITS tools.
[2024-05-30 11:33:17] [INFO ] Flatten gal took : 46 ms
[2024-05-30 11:33:17] [INFO ] Flatten gal took : 49 ms
[2024-05-30 11:33:17] [INFO ] Time to serialize gal into /tmp/LTL15785226156863661760.gal : 9 ms
[2024-05-30 11:33:17] [INFO ] Time to serialize properties into /tmp/LTL17730375824585360431.ltl : 7 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/LTL15785226156863661760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17730375824585360431.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...33589
Formula 0 simplified : F!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_1...33573
Detected timeout of ITS tools.
[2024-05-30 11:33:33] [INFO ] Flatten gal took : 40 ms
[2024-05-30 11:33:33] [INFO ] Applying decomposition
[2024-05-30 11:33:33] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4142652285136221748.txt' '-o' '/tmp/graph4142652285136221748.bin' '-w' '/tmp/graph4142652285136221748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4142652285136221748.bin' '-l' '-1' '-v' '-w' '/tmp/graph4142652285136221748.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:33:35] [INFO ] Decomposing Gal with order
[2024-05-30 11:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:33:35] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-30 11:33:36] [INFO ] Flatten gal took : 725 ms
[2024-05-30 11:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1458 labels/synchronizations in 93 ms.
[2024-05-30 11:33:36] [INFO ] Time to serialize gal into /tmp/LTL16075759322914526904.gal : 9 ms
[2024-05-30 11:33:36] [INFO ] Time to serialize properties into /tmp/LTL12391417036082452229.ltl : 2 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/LTL16075759322914526904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12391417036082452229.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gi0.gu0.Rows_0_0+gi0.gu0.Rows_0_1)+(gi0.gu0.Rows_0_2+gi0.gu0.Rows_0_3))+((gi0.gu0.Rows_0_4+gi0.gu0.Rows_0_5)+(gi0.gu0.R...52705
Formula 0 simplified : F!"((((((((gi0.gu0.Rows_0_0+gi0.gu0.Rows_0_1)+(gi0.gu0.Rows_0_2+gi0.gu0.Rows_0_3))+((gi0.gu0.Rows_0_4+gi0.gu0.Rows_0_5)+(gi0.gu0.Row...52689
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-BN09-LTLCardinality-01 finished in 185752 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((X(X(F(p0))) U (G(p1) U p2))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:33:51] [INFO ] Invariant cache hit.
[2024-05-30 11:33:52] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2024-05-30 11:33:52] [INFO ] Invariant cache hit.
[2024-05-30 11:33:54] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 2558 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 2567 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-02
Product exploration timeout after 72530 steps with 18132 reset in 10001 ms.
Product exploration timeout after 71810 steps with 17952 reset in 10001 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 980 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (602 resets) in 4294 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367345 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367345 steps, saw 86680 distinct states, run finished after 3003 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-30 11:35:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1711 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2833ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 14 factoid took 1060 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:35:17] [INFO ] Invariant cache hit.
[2024-05-30 11:35:18] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-30 11:35:18] [INFO ] Invariant cache hit.
[2024-05-30 11:35:19] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 2427 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 2433 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (601 resets) in 2962 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 352893 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 352893 steps, saw 84734 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-30 11:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1139 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1635 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2817ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 88280 steps with 22070 reset in 10001 ms.
Product exploration timeout after 87530 steps with 21882 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:35:48] [INFO ] Redundant transitions in 4 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 324/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin17003008996635289958
[2024-05-30 11:35:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003008996635289958
Running compilation step : cd /tmp/ltsmin17003008996635289958;'/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'
Compilation finished in 1944 ms.
Running link step : cd /tmp/ltsmin17003008996635289958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17003008996635289958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12163928296559556435.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 18 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-05-30 11:36:03] [INFO ] Computed 75 invariants in 14 ms
[2024-05-30 11:36:04] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-30 11:36:04] [INFO ] Invariant cache hit.
[2024-05-30 11:36:05] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1968 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1993 ms. Remains : 324/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin2257514531278946851
[2024-05-30 11:36:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2257514531278946851
Running compilation step : cd /tmp/ltsmin2257514531278946851;'/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'
Compilation finished in 1605 ms.
Running link step : cd /tmp/ltsmin2257514531278946851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2257514531278946851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6117414652758675646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 11:36:20] [INFO ] Flatten gal took : 54 ms
[2024-05-30 11:36:20] [INFO ] Flatten gal took : 50 ms
[2024-05-30 11:36:20] [INFO ] Time to serialize gal into /tmp/LTL16202576012571374004.gal : 58 ms
[2024-05-30 11:36:20] [INFO ] Time to serialize properties into /tmp/LTL10691080495582745979.prop : 2 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/LTL16202576012571374004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7053978439461214997.hoa' '-atoms' '/tmp/LTL10691080495582745979.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...319
Loading property file /tmp/LTL10691080495582745979.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7053978439461214997.hoa
Detected timeout of ITS tools.
[2024-05-30 11:36:35] [INFO ] Flatten gal took : 38 ms
[2024-05-30 11:36:35] [INFO ] Flatten gal took : 70 ms
[2024-05-30 11:36:35] [INFO ] Time to serialize gal into /tmp/LTL1713232771474453973.gal : 28 ms
[2024-05-30 11:36:35] [INFO ] Time to serialize properties into /tmp/LTL10878243138278529864.ltl : 2 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/LTL1713232771474453973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10878243138278529864.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 : !((X((X(X(F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Col...22739
Formula 0 simplified : X(XXG!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...22729
Detected timeout of ITS tools.
[2024-05-30 11:36:51] [INFO ] Flatten gal took : 58 ms
[2024-05-30 11:36:51] [INFO ] Applying decomposition
[2024-05-30 11:36:51] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2495854291851057420.txt' '-o' '/tmp/graph2495854291851057420.bin' '-w' '/tmp/graph2495854291851057420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2495854291851057420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2495854291851057420.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:36:52] [INFO ] Decomposing Gal with order
[2024-05-30 11:36:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:36:52] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-30 11:36:53] [INFO ] Flatten gal took : 615 ms
[2024-05-30 11:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 29 ms.
[2024-05-30 11:36:53] [INFO ] Time to serialize gal into /tmp/LTL13719296314758310179.gal : 6 ms
[2024-05-30 11:36:53] [INFO ] Time to serialize properties into /tmp/LTL5788521260363510864.ltl : 2 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/LTL13719296314758310179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5788521260363510864.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 : !((X((X(X(F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Colum...29219
Formula 0 simplified : X(XXG!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0...29209
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-BN09-LTLCardinality-02 finished in 196700 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 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 11:37:08] [INFO ] Computed 324 invariants in 3 ms
[2024-05-30 11:37:09] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-30 11:37:09] [INFO ] Invariant cache hit.
[2024-05-30 11:37:10] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 2077 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 2083 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-05
Product exploration timeout after 88210 steps with 29403 reset in 10001 ms.
Product exploration timeout after 87270 steps with 29090 reset in 10002 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLCardinality-05 finished in 32647 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)))'
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:37:40] [INFO ] Invariant cache hit.
[2024-05-30 11:37:42] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2024-05-30 11:37:42] [INFO ] Invariant cache hit.
[2024-05-30 11:37:43] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2024-05-30 11:37:43] [INFO ] Redundant transitions in 6 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 3085 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-06
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-06 finished in 3142 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' '!(G((F(G(p0)) U p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-05-30 11:37:43] [INFO ] Computed 75 invariants in 14 ms
[2024-05-30 11:37:44] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-30 11:37:44] [INFO ] Invariant cache hit.
[2024-05-30 11:37:45] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
[2024-05-30 11:37:45] [INFO ] Redundant transitions in 7 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2045 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-07
Product exploration explored 100000 steps with 1509 reset in 5153 ms.
Product exploration explored 100000 steps with 1510 reset in 5197 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (600 resets) in 4113 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 445922 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 445922 steps, saw 98122 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-30 11:38:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (603 resets) in 2891 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 447163 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 447163 steps, saw 98307 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-30 11:38:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10658 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10962ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:38:21] [INFO ] Invariant cache hit.
[2024-05-30 11:38:21] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-30 11:38:21] [INFO ] Invariant cache hit.
[2024-05-30 11:38:23] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
[2024-05-30 11:38:23] [INFO ] Redundant transitions in 6 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 1943 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (602 resets) in 2479 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444304 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 444304 steps, saw 97845 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-30 11:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1376 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1735ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2504 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 420493 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 420493 steps, saw 94732 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-30 11:38:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10638 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10984ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1508 reset in 5154 ms.
Product exploration explored 100000 steps with 1508 reset in 5267 ms.
Built C files in :
/tmp/ltsmin7243237345028544887
[2024-05-30 11:38:57] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:38:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:38:57] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:38:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:38:57] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:38:57] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:38:57] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7243237345028544887
Running compilation step : cd /tmp/ltsmin7243237345028544887;'/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'
Compilation finished in 2470 ms.
Running link step : cd /tmp/ltsmin7243237345028544887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7243237345028544887;'/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' '--hoa' '/tmp/stateBased5331835587721783179.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:39:12] [INFO ] Invariant cache hit.
[2024-05-30 11:39:13] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-30 11:39:13] [INFO ] Invariant cache hit.
[2024-05-30 11:39:14] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2024-05-30 11:39:14] [INFO ] Redundant transitions in 5 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 1873 ms. Remains : 324/324 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin2816050850306620783
[2024-05-30 11:39:14] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:39:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:39:14] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:39:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:39:14] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:39:14] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:39:14] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2816050850306620783
Running compilation step : cd /tmp/ltsmin2816050850306620783;'/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'
Compilation finished in 2366 ms.
Running link step : cd /tmp/ltsmin2816050850306620783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2816050850306620783;'/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' '--hoa' '/tmp/stateBased456104311200628020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 11:39:30] [INFO ] Flatten gal took : 27 ms
[2024-05-30 11:39:30] [INFO ] Flatten gal took : 27 ms
[2024-05-30 11:39:30] [INFO ] Time to serialize gal into /tmp/LTL2561288682813414975.gal : 5 ms
[2024-05-30 11:39:30] [INFO ] Time to serialize properties into /tmp/LTL13533386465487133029.prop : 0 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/LTL2561288682813414975.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3295921949183912693.hoa' '-atoms' '/tmp/LTL13533386465487133029.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/LTL13533386465487133029.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3295921949183912693.hoa
Detected timeout of ITS tools.
[2024-05-30 11:39:45] [INFO ] Flatten gal took : 27 ms
[2024-05-30 11:39:45] [INFO ] Flatten gal took : 34 ms
[2024-05-30 11:39:45] [INFO ] Time to serialize gal into /tmp/LTL17610805729918949111.gal : 4 ms
[2024-05-30 11:39:45] [INFO ] Time to serialize properties into /tmp/LTL10600622737435490506.ltl : 0 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/LTL17610805729918949111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10600622737435490506.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...2316
Formula 0 simplified : F(GF!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...2309
Detected timeout of ITS tools.
[2024-05-30 11:40:00] [INFO ] Flatten gal took : 26 ms
[2024-05-30 11:40:00] [INFO ] Applying decomposition
[2024-05-30 11:40:00] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13713666172169775888.txt' '-o' '/tmp/graph13713666172169775888.bin' '-w' '/tmp/graph13713666172169775888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13713666172169775888.bin' '-l' '-1' '-v' '-w' '/tmp/graph13713666172169775888.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:40:00] [INFO ] Decomposing Gal with order
[2024-05-30 11:40:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:40:00] [INFO ] Removed a total of 2592 redundant transitions.
[2024-05-30 11:40:00] [INFO ] Flatten gal took : 76 ms
[2024-05-30 11:40:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 11:40:00] [INFO ] Time to serialize gal into /tmp/LTL16709825197208650348.gal : 4 ms
[2024-05-30 11:40:00] [INFO ] Time to serialize properties into /tmp/LTL16469020880728812138.ltl : 0 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/LTL16709825197208650348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16469020880728812138.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((((((((gu243.Columns_0_0+gu243.Columns_0_1)+(gu243.Columns_0_2+gu243.Columns_0_3))+((gu243.Columns_0_4+gu243.Columns_0_5)+...3288
Formula 0 simplified : F(GF!"((((((((gu243.Columns_0_0+gu243.Columns_0_1)+(gu243.Columns_0_2+gu243.Columns_0_3))+((gu243.Columns_0_4+gu243.Columns_0_5)+(gu...3281
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-BN09-LTLCardinality-07 finished in 151664 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(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 17 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:40:15] [INFO ] Invariant cache hit.
[2024-05-30 11:40:16] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-30 11:40:16] [INFO ] Invariant cache hit.
[2024-05-30 11:40:17] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2163 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-10
Stuttering criterion allowed to conclude after 84 steps with 1 reset in 11 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-10 finished in 2318 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' '!(G(F((p0&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 325 are kept as prefixes of interest. Removing 728 places using SCC suffix rule.2 ms
Discarding 728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 70 ms. Remains 325 /1053 variables (removed 728) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 325 cols
[2024-05-30 11:40:18] [INFO ] Computed 75 invariants in 43 ms
[2024-05-30 11:40:18] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-30 11:40:18] [INFO ] Invariant cache hit.
[2024-05-30 11:40:20] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2024-05-30 11:40:20] [INFO ] Redundant transitions in 9 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 : 325/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2675 ms. Remains : 325/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-14
Stuttering criterion allowed to conclude after 307 steps with 5 reset in 23 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-14 finished in 2854 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' '!((G(p0)||X(X((F(G(!p0))||G(p1))))))'
Found a Lengthening insensitive property : Sudoku-PT-BN09-LTLCardinality-01
Stuttering acceptance computed with spot in 275 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 11:40:21] [INFO ] Computed 324 invariants in 10 ms
[2024-05-30 11:40:22] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-05-30 11:40:22] [INFO ] Invariant cache hit.
[2024-05-30 11:40:23] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 2327 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 LI_LTL mode , in 1 iterations and 2339 ms. Remains : 1053/1053 places, 729/729 transitions.
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-01
Product exploration explored 100000 steps with 1509 reset in 7793 ms.
Product exploration explored 100000 steps with 1509 reset in 7902 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 231 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 27 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[false, p0]
Stuttering acceptance computed with spot in 72 ms :[false, p0]
Support contains 810 out of 1053 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 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:41:36] [INFO ] Invariant cache hit.
[2024-05-30 11:41:37] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-30 11:41:37] [INFO ] Invariant cache hit.
[2024-05-30 11:41:39] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-30 11:41:39] [INFO ] Redundant transitions in 4 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 2355 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 29 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[false, p0]
Stuttering acceptance computed with spot in 71 ms :[false, p0]
Stuttering acceptance computed with spot in 71 ms :[false, p0]
Product exploration explored 100000 steps with 1510 reset in 7738 ms.
Product exploration explored 100000 steps with 1510 reset in 7811 ms.
Built C files in :
/tmp/ltsmin7379179052968694987
[2024-05-30 11:42:04] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:42:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:04] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:42:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:05] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:42:05] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:05] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7379179052968694987
Running compilation step : cd /tmp/ltsmin7379179052968694987;'/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'
Compilation finished in 2813 ms.
Running link step : cd /tmp/ltsmin7379179052968694987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7379179052968694987;'/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' '--hoa' '/tmp/stateBased12299941398700787904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-30 11:42:19] [INFO ] Invariant cache hit.
[2024-05-30 11:42:21] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-05-30 11:42:21] [INFO ] Invariant cache hit.
[2024-05-30 11:42:22] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2024-05-30 11:42:22] [INFO ] Redundant transitions in 7 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 2863 ms. Remains : 1053/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin13547090304022131530
[2024-05-30 11:42:22] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:42:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:22] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:42:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:22] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:42:22] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:42:22] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13547090304022131530
Running compilation step : cd /tmp/ltsmin13547090304022131530;'/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'
Compilation finished in 2777 ms.
Running link step : cd /tmp/ltsmin13547090304022131530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin13547090304022131530;'/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' '--hoa' '/tmp/stateBased17033686922324677274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 11:42:37] [INFO ] Flatten gal took : 31 ms
[2024-05-30 11:42:37] [INFO ] Flatten gal took : 30 ms
[2024-05-30 11:42:37] [INFO ] Time to serialize gal into /tmp/LTL3596778760208653384.gal : 5 ms
[2024-05-30 11:42:37] [INFO ] Time to serialize properties into /tmp/LTL12715299052356025523.prop : 0 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/LTL3596778760208653384.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6580621276829819316.hoa' '-atoms' '/tmp/LTL12715299052356025523.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/LTL12715299052356025523.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6580621276829819316.hoa
Detected timeout of ITS tools.
[2024-05-30 11:42:53] [INFO ] Flatten gal took : 32 ms
[2024-05-30 11:42:53] [INFO ] Flatten gal took : 32 ms
[2024-05-30 11:42:53] [INFO ] Time to serialize gal into /tmp/LTL15950534350609776437.gal : 4 ms
[2024-05-30 11:42:53] [INFO ] Time to serialize properties into /tmp/LTL13081379421610047748.ltl : 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/LTL15950534350609776437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13081379421610047748.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...33589
Formula 0 simplified : F!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_1...33573
Detected timeout of ITS tools.
[2024-05-30 11:43:08] [INFO ] Flatten gal took : 41 ms
[2024-05-30 11:43:08] [INFO ] Applying decomposition
[2024-05-30 11:43:08] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7384885010066105311.txt' '-o' '/tmp/graph7384885010066105311.bin' '-w' '/tmp/graph7384885010066105311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7384885010066105311.bin' '-l' '-1' '-v' '-w' '/tmp/graph7384885010066105311.weights' '-q' '0' '-e' '0.001'
[2024-05-30 11:43:10] [INFO ] Decomposing Gal with order
[2024-05-30 11:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:43:10] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-30 11:43:10] [INFO ] Flatten gal took : 361 ms
[2024-05-30 11:43:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1458 labels/synchronizations in 42 ms.
[2024-05-30 11:43:10] [INFO ] Time to serialize gal into /tmp/LTL1389266401985039612.gal : 9 ms
[2024-05-30 11:43:10] [INFO ] Time to serialize properties into /tmp/LTL5547939878524738911.ltl : 2 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/LTL1389266401985039612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5547939878524738911.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...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gi0.gu0.Rows_0_0+gi0.gu0.Rows_0_1)+(gi0.gu0.Rows_0_2+gi0.gu0.Rows_0_3))+((gi0.gu0.Rows_0_4+gi0.gu0.Rows_0_5)+(gi0.gu0.R...52705
Formula 0 simplified : F!"((((((((gi0.gu0.Rows_0_0+gi0.gu0.Rows_0_1)+(gi0.gu0.Rows_0_2+gi0.gu0.Rows_0_3))+((gi0.gu0.Rows_0_4+gi0.gu0.Rows_0_5)+(gi0.gu0.Row...52689
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-BN09-LTLCardinality-01 finished in 184913 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((X(X(F(p0))) U (G(p1) U p2))))'
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' '!(G((F(G(p0)) U p0)))'
[2024-05-30 11:43:25] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14951767856116248431
[2024-05-30 11:43:25] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-30 11:43:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:43:25] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-30 11:43:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:43:25] [INFO ] Applying decomposition
[2024-05-30 11:43:26] [INFO ] Flatten gal took : 51 ms
[2024-05-30 11:43:26] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-30 11:43:26] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 11:43:26] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14951767856116248431
Running compilation step : cd /tmp/ltsmin14951767856116248431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1362752984421943181.txt' '-o' '/tmp/graph1362752984421943181.bin' '-w' '/tmp/graph1362752984421943181.weights'
Compilation finished in 3051 ms.
Running link step : cd /tmp/ltsmin14951767856116248431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1362752984421943181.bin' '-l' '-1' '-v' '-w' '/tmp/graph1362752984421943181.weights' '-q' '0' '-e' '0.001'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14951767856116248431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
[2024-05-30 11:43:29] [INFO ] Decomposing Gal with order
[2024-05-30 11:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:43:29] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-30 11:43:29] [INFO ] Flatten gal took : 475 ms
[2024-05-30 11:43:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-30 11:43:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality6571192216430607275.gal : 14 ms
[2024-05-30 11:43:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality5593601446849747392.ltl : 10 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/LTLCardinality6571192216430607275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5593601446849747392.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...297
Read 3 LTL properties
Checking formula 0 : !(((G("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...43309
Formula 0 simplified : F!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu0...43293
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.081: LTL layer: formula: ([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 6/ 8), 0.081: "([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.081: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.127: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.128: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.511: There are 735 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.511: State length is 1054, there are 746 groups
pins2lts-mc-linux64( 0/ 8), 0.511: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.511: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.511: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.511: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.421: [Blue] ~69 levels ~960 states ~111216 transitions
pins2lts-mc-linux64( 0/ 8), 1.467: [Blue] ~65 levels ~1920 states ~115400 transitions
pins2lts-mc-linux64( 0/ 8), 1.554: [Blue] ~65 levels ~3840 states ~124040 transitions
pins2lts-mc-linux64( 5/ 8), 1.705: [Blue] ~67 levels ~7680 states ~145248 transitions
pins2lts-mc-linux64( 4/ 8), 2.017: [Blue] ~69 levels ~15360 states ~186000 transitions
pins2lts-mc-linux64( 0/ 8), 2.633: [Blue] ~65 levels ~30720 states ~265984 transitions
pins2lts-mc-linux64( 0/ 8), 3.908: [Blue] ~65 levels ~61440 states ~445856 transitions
pins2lts-mc-linux64( 0/ 8), 7.838: [Blue] ~65 levels ~122880 states ~832224 transitions
pins2lts-mc-linux64( 5/ 8), 13.077: [Blue] ~69 levels ~245760 states ~1677416 transitions
pins2lts-mc-linux64( 3/ 8), 23.802: [Blue] ~67 levels ~491520 states ~3573544 transitions
pins2lts-mc-linux64( 2/ 8), 44.135: [Blue] ~70 levels ~983040 states ~7354168 transitions
pins2lts-mc-linux64( 1/ 8), 91.772: [Blue] ~73 levels ~1966080 states ~15981888 transitions
pins2lts-mc-linux64( 1/ 8), 185.455: [Blue] ~73 levels ~3932160 states ~33895600 transitions
pins2lts-mc-linux64( 6/ 8), 357.809: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 358.047:
pins2lts-mc-linux64( 0/ 8), 358.047: Explored 5758629 states 47984610 transitions, fanout: 8.333
pins2lts-mc-linux64( 0/ 8), 358.047: Total exploration time 357.480 sec (357.290 sec minimum, 357.408 sec on average)
pins2lts-mc-linux64( 0/ 8), 358.047: States per second: 16109, Transitions per second: 134230
pins2lts-mc-linux64( 0/ 8), 358.047:
pins2lts-mc-linux64( 0/ 8), 358.047: State space has 5864613 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 358.047: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 358.047: blue states: 5758629 (98.19%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 358.047: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 358.047: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 358.047:
pins2lts-mc-linux64( 0/ 8), 358.047: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 358.047:
pins2lts-mc-linux64( 0/ 8), 358.047: Queue width: 8B, total height: 551, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 358.047: Tree memory: 300.7MB, 53.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 358.047: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 358.047: Stored 762 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 358.047: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 358.047: Est. total memory use: 300.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14951767856116248431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14951767856116248431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 11:56:20] [INFO ] Applying decomposition
[2024-05-30 11:56:20] [INFO ] Flatten gal took : 34 ms
[2024-05-30 11:56:20] [INFO ] Decomposing Gal with order
[2024-05-30 11:56:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 11:56:20] [INFO ] Removed a total of 1932 redundant transitions.
[2024-05-30 11:56:20] [INFO ] Flatten gal took : 65 ms
[2024-05-30 11:56:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 11:56:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality2854591292212133208.gal : 10 ms
[2024-05-30 11:56:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality14013940519240926930.ltl : 2 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/LTLCardinality2854591292212133208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14013940519240926930.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...298
Read 3 LTL properties
Checking formula 0 : !(((G("((((((((gu88.Rows_0_0+gu89.Rows_0_1)+(gu90.Rows_0_2+gu91.Rows_0_3))+((gu92.Rows_0_4+gu50.Rows_0_5)+(gu51.Rows_0_6+gu93.Rows_0_7...45607
Formula 0 simplified : F!"((((((((gu88.Rows_0_0+gu89.Rows_0_1)+(gu90.Rows_0_2+gu91.Rows_0_3))+((gu92.Rows_0_4+gu50.Rows_0_5)+(gu51.Rows_0_6+gu93.Rows_0_7))...45591
ITS-tools command line returned an error code 137
[2024-05-30 12:05:52] [INFO ] Flatten gal took : 36 ms
[2024-05-30 12:05:52] [INFO ] Input system was already deterministic with 729 transitions.
[2024-05-30 12:05:52] [INFO ] Transformed 1053 places.
[2024-05-30 12:05:52] [INFO ] Transformed 729 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 12:05:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality1679701036434545741.gal : 5 ms
[2024-05-30 12:05:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality12745128355556001392.ltl : 2 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/LTLCardinality1679701036434545741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12745128355556001392.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...33589
Formula 0 simplified : F!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_1...33573
ITS-tools command line returned an error code 137
Total runtime 2862601 ms.

BK_STOP 1717071379469

--------------------
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-BN09"
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-BN09, 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-171690533000715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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