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-171690532800651.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-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532800651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 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 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 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 746K 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-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717055887312

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-AN11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 07:58:08] [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 07:58:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:58:08] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-30 07:58:08] [INFO ] Transformed 1694 places.
[2024-05-30 07:58:08] [INFO ] Transformed 1331 transitions.
[2024-05-30 07:58:08] [INFO ] Found NUPN structural information;
[2024-05-30 07:58:08] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 07:58:09] [INFO ] Computed 363 invariants in 33 ms
[2024-05-30 07:58:09] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-30 07:58:09] [INFO ] Invariant cache hit.
[2024-05-30 07:58:11] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2096 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 2147 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2024-05-30 07:58:11] [INFO ] Flatten gal took : 158 ms
[2024-05-30 07:58:11] [INFO ] Flatten gal took : 102 ms
[2024-05-30 07:58:12] [INFO ] Input system was already deterministic with 1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 8743 ms. (4 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 943 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2670 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 877 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 952 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 9/9 properties
[2024-05-30 07:58:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1694 variables, 1694/1694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5015 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1694 variables, 363/726 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 1331/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5016 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10968ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4513 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 88561 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 5
Probabilistic random walk after 88561 steps, saw 65064 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 07:58:32] [INFO ] Computed 32 invariants in 65 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 32/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 5 unsolved in 888 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 32/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1236 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2323ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=12 )
Parikh walk visited 5 properties in 16 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 73 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 07:58:35] [INFO ] Computed 363 invariants in 6 ms
[2024-05-30 07:58:37] [INFO ] Implicit Places using invariants in 2057 ms returned []
[2024-05-30 07:58:37] [INFO ] Invariant cache hit.
[2024-05-30 07:58:40] [INFO ] Implicit Places using invariants and state equation in 2837 ms returned []
Implicit Place search using SMT with State Equation took 4907 ms to find 0 implicit places.
[2024-05-30 07:58:40] [INFO ] Redundant transitions in 76 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5066 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-00
Product exploration timeout after 65800 steps with 1061 reset in 10002 ms.
Product exploration timeout after 65690 steps with 1059 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 64 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-30 08:00:00] [INFO ] Invariant cache hit.
[2024-05-30 08:00:11] [INFO ] [Real]Absence check using 363 positive place invariants in 1310 ms returned sat
[2024-05-30 08:00:15] [INFO ] [Real]Absence check using state equation in 4189 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 31 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:00:15] [INFO ] Invariant cache hit.
[2024-05-30 08:00:17] [INFO ] Implicit Places using invariants in 2060 ms returned []
[2024-05-30 08:00:17] [INFO ] Invariant cache hit.
[2024-05-30 08:00:20] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 5018 ms to find 0 implicit places.
[2024-05-30 08:00:20] [INFO ] Redundant transitions in 19 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 5077 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 76 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-30 08:01:20] [INFO ] Invariant cache hit.
[2024-05-30 08:01:30] [INFO ] [Real]Absence check using 363 positive place invariants in 1293 ms returned sat
[2024-05-30 08:01:35] [INFO ] [Real]Absence check using state equation in 4171 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 66460 steps with 1071 reset in 10001 ms.
Product exploration timeout after 65850 steps with 1062 reset in 10002 ms.
Built C files in :
/tmp/ltsmin10844840971296416999
[2024-05-30 08:01:55] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-30 08:01:55] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:01:55] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-30 08:01:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:01:55] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-30 08:01:55] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:01:55] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10844840971296416999
Running compilation step : cd /tmp/ltsmin10844840971296416999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10844840971296416999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10844840971296416999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 62 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:01:58] [INFO ] Invariant cache hit.
[2024-05-30 08:02:00] [INFO ] Implicit Places using invariants in 2190 ms returned []
[2024-05-30 08:02:00] [INFO ] Invariant cache hit.
[2024-05-30 08:02:03] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned []
Implicit Place search using SMT with State Equation took 5096 ms to find 0 implicit places.
[2024-05-30 08:02:03] [INFO ] Redundant transitions in 66 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 5249 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin14158947482035042425
[2024-05-30 08:02:03] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-30 08:02:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:02:03] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-30 08:02:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:02:04] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-30 08:02:04] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:02:04] [INFO ] Built C files in 398ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14158947482035042425
Running compilation step : cd /tmp/ltsmin14158947482035042425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14158947482035042425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14158947482035042425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 08:02:07] [INFO ] Flatten gal took : 92 ms
[2024-05-30 08:02:07] [INFO ] Flatten gal took : 158 ms
[2024-05-30 08:02:07] [INFO ] Time to serialize gal into /tmp/LTL15305695725186682284.gal : 35 ms
[2024-05-30 08:02:07] [INFO ] Time to serialize properties into /tmp/LTL17494143720145552047.prop : 3 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/LTL15305695725186682284.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4022994650062339120.hoa' '-atoms' '/tmp/LTL17494143720145552047.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/LTL17494143720145552047.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4022994650062339120.hoa
Detected timeout of ITS tools.
[2024-05-30 08:02:23] [INFO ] Flatten gal took : 192 ms
[2024-05-30 08:02:23] [INFO ] Flatten gal took : 169 ms
[2024-05-30 08:02:23] [INFO ] Time to serialize gal into /tmp/LTL6899643103195985579.gal : 52 ms
[2024-05-30 08:02:23] [INFO ] Time to serialize properties into /tmp/LTL4448578875717577161.ltl : 75 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/LTL6899643103195985579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4448578875717577161.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 : !((F("((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...20500
Formula 0 simplified : G!"((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cells...20496
Detected timeout of ITS tools.
[2024-05-30 08:02:38] [INFO ] Flatten gal took : 111 ms
[2024-05-30 08:02:38] [INFO ] Applying decomposition
[2024-05-30 08:02:38] [INFO ] Flatten gal took : 128 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/graph15791996045945722438.txt' '-o' '/tmp/graph15791996045945722438.bin' '-w' '/tmp/graph15791996045945722438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15791996045945722438.bin' '-l' '-1' '-v' '-w' '/tmp/graph15791996045945722438.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:02:41] [INFO ] Decomposing Gal with order
[2024-05-30 08:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:02:42] [INFO ] Removed a total of 1830 redundant transitions.
[2024-05-30 08:02:42] [INFO ] Flatten gal took : 1060 ms
[2024-05-30 08:02:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 73 ms.
[2024-05-30 08:02:43] [INFO ] Time to serialize gal into /tmp/LTL17261924450151531971.gal : 14 ms
[2024-05-30 08:02:43] [INFO ] Time to serialize properties into /tmp/LTL11037693818059166043.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/LTL17261924450151531971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11037693818059166043.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 : !((F("((((((((gu179.Cells_0_0+gu179.Cells_0_1)+(gu179.Cells_0_2+gu179.Cells_0_3))+((gu179.Cells_0_4+gu179.Cells_0_5)+(gu179.Cells_0_6+...29212
Formula 0 simplified : G!"((((((((gu179.Cells_0_0+gu179.Cells_0_1)+(gu179.Cells_0_2+gu179.Cells_0_3))+((gu179.Cells_0_4+gu179.Cells_0_5)+(gu179.Cells_0_6+g...29208
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN11-LTLCardinality-00 finished in 262863 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)&&F(p1))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:02:58] [INFO ] Invariant cache hit.
[2024-05-30 08:02:59] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-30 08:02:59] [INFO ] Invariant cache hit.
[2024-05-30 08:03:01] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3013 ms to find 0 implicit places.
[2024-05-30 08:03:01] [INFO ] Redundant transitions in 23 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 3071 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03
Product exploration timeout after 62740 steps with 1011 reset in 10001 ms.
Product exploration timeout after 62730 steps with 1011 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (377 resets) in 4447 ms. (8 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
[2024-05-30 08:04:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1623 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1380 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3046ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 107 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3858 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 253634 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 253634 steps, saw 128324 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:04:39] [INFO ] Computed 32 invariants in 41 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 747 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:04:42] [INFO ] Computed 363 invariants in 17 ms
[2024-05-30 08:04:54] [INFO ] [Real]Absence check using 363 positive place invariants in 1621 ms returned sat
[2024-05-30 08:04:57] [INFO ] [Real]Absence check using state equation in 2327 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:04:57] [INFO ] Invariant cache hit.
[2024-05-30 08:04:58] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-30 08:04:58] [INFO ] Invariant cache hit.
[2024-05-30 08:05:00] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2024-05-30 08:05:00] [INFO ] Redundant transitions in 15 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 3038 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (376 resets) in 7284 ms. (5 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 613 ms. (65 steps per ms) remains 1/1 properties
[2024-05-30 08:06:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1452 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1291 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2812ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.2 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 6328 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 621 ms. (64 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245783 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245783 steps, saw 126786 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:06:19] [INFO ] Computed 32 invariants in 36 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 807 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:06:22] [INFO ] Computed 363 invariants in 16 ms
[2024-05-30 08:06:35] [INFO ] [Real]Absence check using 363 positive place invariants in 1712 ms returned sat
[2024-05-30 08:06:37] [INFO ] [Real]Absence check using state equation in 1827 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 63560 steps with 1025 reset in 10001 ms.
Product exploration timeout after 63180 steps with 1019 reset in 10002 ms.
Built C files in :
/tmp/ltsmin12231699513711021322
[2024-05-30 08:06:57] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-30 08:06:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:06:57] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-30 08:06:57] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:06:57] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-30 08:06:57] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:06:57] [INFO ] Built C files in 401ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12231699513711021322
Running compilation step : cd /tmp/ltsmin12231699513711021322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12231699513711021322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12231699513711021322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:07:00] [INFO ] Invariant cache hit.
[2024-05-30 08:07:01] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-05-30 08:07:01] [INFO ] Invariant cache hit.
[2024-05-30 08:07:03] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
[2024-05-30 08:07:03] [INFO ] Redundant transitions in 13 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 3037 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin15129523334901222250
[2024-05-30 08:07:03] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-30 08:07:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:07:03] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-30 08:07:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:07:04] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-30 08:07:04] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:07:04] [INFO ] Built C files in 347ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15129523334901222250
Running compilation step : cd /tmp/ltsmin15129523334901222250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15129523334901222250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15129523334901222250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 08:07:07] [INFO ] Flatten gal took : 181 ms
[2024-05-30 08:07:07] [INFO ] Flatten gal took : 181 ms
[2024-05-30 08:07:07] [INFO ] Time to serialize gal into /tmp/LTL9419337214419160766.gal : 7 ms
[2024-05-30 08:07:07] [INFO ] Time to serialize properties into /tmp/LTL7357963139320857235.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9419337214419160766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13866676350396300366.hoa' '-atoms' '/tmp/LTL7357963139320857235.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/LTL7357963139320857235.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13866676350396300366.hoa
Detected timeout of ITS tools.
[2024-05-30 08:07:23] [INFO ] Flatten gal took : 102 ms
[2024-05-30 08:07:23] [INFO ] Flatten gal took : 103 ms
[2024-05-30 08:07:23] [INFO ] Time to serialize gal into /tmp/LTL10321737411262903054.gal : 25 ms
[2024-05-30 08:07:23] [INFO ] Time to serialize properties into /tmp/LTL5509984759512572894.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/LTL10321737411262903054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5509984759512572894.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 : !((G((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_0_9)+(Rows_0_10+...23349
Formula 0 simplified : F(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_0_9)+(Rows_0_10+Ro...23341
Detected timeout of ITS tools.
[2024-05-30 08:07:38] [INFO ] Flatten gal took : 48 ms
[2024-05-30 08:07:38] [INFO ] Applying decomposition
[2024-05-30 08:07:38] [INFO ] Flatten gal took : 46 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/graph6059991714872595650.txt' '-o' '/tmp/graph6059991714872595650.bin' '-w' '/tmp/graph6059991714872595650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6059991714872595650.bin' '-l' '-1' '-v' '-w' '/tmp/graph6059991714872595650.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:07:41] [INFO ] Decomposing Gal with order
[2024-05-30 08:07:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:07:42] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-30 08:07:42] [INFO ] Flatten gal took : 1499 ms
[2024-05-30 08:07:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-30 08:07:43] [INFO ] Time to serialize gal into /tmp/LTL1392468116003101970.gal : 26 ms
[2024-05-30 08:07:43] [INFO ] Time to serialize properties into /tmp/LTL15952309435815590278.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/LTL1392468116003101970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15952309435815590278.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 : !((G((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)))+(...30125
Formula 0 simplified : F(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)))+(((...30117
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN11-LTLCardinality-03 finished in 300007 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((G(!p0) U X((p1 U X(p2))))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:07:58] [INFO ] Invariant cache hit.
[2024-05-30 08:07:59] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-05-30 08:07:59] [INFO ] Invariant cache hit.
[2024-05-30 08:08:01] [INFO ] Implicit Places using invariants and state equation in 2063 ms returned []
Implicit Place search using SMT with State Equation took 3338 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in LTL mode , in 1 iterations and 3348 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04
Product exploration timeout after 36650 steps with 9194 reset in 10008 ms.
Product exploration timeout after 36650 steps with 9108 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 856 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
RANDOM walk for 40000 steps (376 resets) in 24782 ms. (1 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3590 ms. (11 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3481 ms. (11 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3310 ms. (12 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1828 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1853 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1838 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1915 ms. (20 steps per ms) remains 8/8 properties
[2024-05-30 08:16:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5019 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5017 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11968ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 20180 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5207 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3005 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3311 ms. (12 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 365805 steps, run timeout after 24002 ms. (steps per millisecond=15 ) properties seen :0 out of 4
Probabilistic random walk after 365805 steps, saw 148179 distinct states, run finished after 24002 ms. (steps per millisecond=15 ) properties seen :0
[2024-05-30 08:17:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6629 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 4 unsolved in 17548 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 24999ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 4 properties in 25 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 25 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 p0)), (G (OR p1 p0 p2)), (G (OR (NOT p1) p2)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 21 factoid took 2115 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 8 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:17:35] [INFO ] Invariant cache hit.
[2024-05-30 08:17:36] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2024-05-30 08:17:36] [INFO ] Invariant cache hit.
[2024-05-30 08:17:38] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 3380 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 3388 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (376 resets) in 6615 ms. (6 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 1/1 properties
[2024-05-30 08:18:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1118 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1360 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2537ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 5995 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 584 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 244564 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 244564 steps, saw 126427 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:18:47] [INFO ] Computed 32 invariants in 33 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 808 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 68610 steps with 649 reset in 10002 ms.
Product exploration timeout after 67810 steps with 641 reset in 10001 ms.
Built C files in :
/tmp/ltsmin17264306846946072022
[2024-05-30 08:19:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17264306846946072022
Running compilation step : cd /tmp/ltsmin17264306846946072022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17264306846946072022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17264306846946072022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:19:12] [INFO ] Computed 363 invariants in 10 ms
[2024-05-30 08:19:14] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-30 08:19:14] [INFO ] Invariant cache hit.
[2024-05-30 08:19:16] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 3439 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 3446 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin3432618581874069800
[2024-05-30 08:19:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3432618581874069800
Running compilation step : cd /tmp/ltsmin3432618581874069800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3432618581874069800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3432618581874069800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 08:19:19] [INFO ] Flatten gal took : 55 ms
[2024-05-30 08:19:19] [INFO ] Flatten gal took : 47 ms
[2024-05-30 08:19:19] [INFO ] Time to serialize gal into /tmp/LTL10028918913236708535.gal : 9 ms
[2024-05-30 08:19:19] [INFO ] Time to serialize properties into /tmp/LTL1830777335409447197.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10028918913236708535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut407833070005700796.hoa' '-atoms' '/tmp/LTL1830777335409447197.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...317
Loading property file /tmp/LTL1830777335409447197.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut407833070005700796.hoa
Detected timeout of ITS tools.
[2024-05-30 08:19:34] [INFO ] Flatten gal took : 56 ms
[2024-05-30 08:19:34] [INFO ] Flatten gal took : 46 ms
[2024-05-30 08:19:34] [INFO ] Time to serialize gal into /tmp/LTL17809148410294637619.gal : 6 ms
[2024-05-30 08:19:34] [INFO ] Time to serialize properties into /tmp/LTL12276604897952869950.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17809148410294637619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12276604897952869950.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((G("((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(C...42709
Formula 0 simplified : F(F!"((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cel...42701
Detected timeout of ITS tools.
[2024-05-30 08:19:49] [INFO ] Flatten gal took : 48 ms
[2024-05-30 08:19:49] [INFO ] Applying decomposition
[2024-05-30 08:19:49] [INFO ] Flatten gal took : 48 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/graph5664495216756281733.txt' '-o' '/tmp/graph5664495216756281733.bin' '-w' '/tmp/graph5664495216756281733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5664495216756281733.bin' '-l' '-1' '-v' '-w' '/tmp/graph5664495216756281733.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:19:54] [INFO ] Decomposing Gal with order
[2024-05-30 08:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:19:55] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-30 08:19:55] [INFO ] Flatten gal took : 1153 ms
[2024-05-30 08:19:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-30 08:19:55] [INFO ] Time to serialize gal into /tmp/LTL10029891837896895140.gal : 12 ms
[2024-05-30 08:19:55] [INFO ] Time to serialize properties into /tmp/LTL3489556182263499355.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/LTL10029891837896895140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3489556182263499355.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 : !((G((G("((((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0...65941
Formula 0 simplified : F(F!"((((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0_7...65933
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 732814 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) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:20:10] [INFO ] Invariant cache hit.
[2024-05-30 08:20:12] [INFO ] Implicit Places using invariants in 1771 ms returned []
[2024-05-30 08:20:12] [INFO ] Invariant cache hit.
[2024-05-30 08:20:15] [INFO ] Implicit Places using invariants and state equation in 2823 ms returned []
Implicit Place search using SMT with State Equation took 4619 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 4636 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05
Product exploration timeout after 67630 steps with 1857 reset in 10001 ms.
Product exploration timeout after 67540 steps with 1863 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 251 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
RANDOM walk for 40000 steps (376 resets) in 4806 ms. (8 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1412 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1604 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 3/3 properties
[2024-05-30 08:24:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1664 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2326 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4465ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 675 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 291 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:24:46] [INFO ] Invariant cache hit.
[2024-05-30 08:24:47] [INFO ] Implicit Places using invariants in 1787 ms returned []
[2024-05-30 08:24:47] [INFO ] Invariant cache hit.
[2024-05-30 08:24:50] [INFO ] Implicit Places using invariants and state equation in 2922 ms returned []
Implicit Place search using SMT with State Equation took 4716 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 4731 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (376 resets) in 3304 ms. (12 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 1/1 properties
[2024-05-30 08:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2595 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7646ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3221 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242258 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242258 steps, saw 126014 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:26:51] [INFO ] Computed 32 invariants in 31 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 736 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 334 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 324 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Product exploration timeout after 70550 steps with 667 reset in 10001 ms.
Product exploration timeout after 70260 steps with 664 reset in 10001 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 289 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 42 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:27:14] [INFO ] Redundant transitions in 17 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 72 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin13510117627624734745
[2024-05-30 08:27:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13510117627624734745
Running compilation step : cd /tmp/ltsmin13510117627624734745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13510117627624734745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13510117627624734745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:27:17] [INFO ] Computed 363 invariants in 5 ms
[2024-05-30 08:27:19] [INFO ] Implicit Places using invariants in 1702 ms returned []
[2024-05-30 08:27:19] [INFO ] Invariant cache hit.
[2024-05-30 08:27:21] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 4544 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 4563 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin8355742116617587520
[2024-05-30 08:27:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8355742116617587520
Running compilation step : cd /tmp/ltsmin8355742116617587520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8355742116617587520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8355742116617587520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 08:27:25] [INFO ] Flatten gal took : 48 ms
[2024-05-30 08:27:25] [INFO ] Flatten gal took : 48 ms
[2024-05-30 08:27:25] [INFO ] Time to serialize gal into /tmp/LTL7066005988687731616.gal : 102 ms
[2024-05-30 08:27:25] [INFO ] Time to serialize properties into /tmp/LTL10816063487216616215.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7066005988687731616.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15743945102934497112.hoa' '-atoms' '/tmp/LTL10816063487216616215.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/LTL10816063487216616215.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15743945102934497112.hoa
Detected timeout of ITS tools.
[2024-05-30 08:27:40] [INFO ] Flatten gal took : 64 ms
[2024-05-30 08:27:40] [INFO ] Flatten gal took : 57 ms
[2024-05-30 08:27:40] [INFO ] Time to serialize gal into /tmp/LTL14546173929910845103.gal : 6 ms
[2024-05-30 08:27:40] [INFO ] Time to serialize properties into /tmp/LTL10398930171118912128.ltl : 3 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/LTL14546173929910845103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10398930171118912128.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_0_9)+(Rows_0_10+Row...77419
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_0_9)+(Rows_0_10+Rows_...77410
Detected timeout of ITS tools.
[2024-05-30 08:27:55] [INFO ] Flatten gal took : 48 ms
[2024-05-30 08:27:55] [INFO ] Applying decomposition
[2024-05-30 08:27:55] [INFO ] Flatten gal took : 48 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/graph8385601010584359841.txt' '-o' '/tmp/graph8385601010584359841.bin' '-w' '/tmp/graph8385601010584359841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8385601010584359841.bin' '-l' '-1' '-v' '-w' '/tmp/graph8385601010584359841.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:28:02] [INFO ] Decomposing Gal with order
[2024-05-30 08:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:28:03] [INFO ] Removed a total of 1210 redundant transitions.
[2024-05-30 08:28:03] [INFO ] Flatten gal took : 1120 ms
[2024-05-30 08:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 84 ms.
[2024-05-30 08:28:03] [INFO ] Time to serialize gal into /tmp/LTL17072972551069187630.gal : 7 ms
[2024-05-30 08:28:03] [INFO ] Time to serialize properties into /tmp/LTL11617071258456116034.ltl : 3 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/LTL17072972551069187630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11617071258456116034.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("((((((((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...99199
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...99190
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 487913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:28:18] [INFO ] Computed 32 invariants in 32 ms
[2024-05-30 08:28:19] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-30 08:28:19] [INFO ] Invariant cache hit.
[2024-05-30 08:28:22] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 3960 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 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3989 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-06
Product exploration timeout after 82700 steps with 41350 reset in 10001 ms.
Product exploration timeout after 82030 steps with 41015 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-06 finished in 38835 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(p0))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 362 are kept as prefixes of interest. Removing 1332 places using SCC suffix rule.6 ms
Discarding 1332 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 362 /1694 variables (removed 1332) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 362 cols
[2024-05-30 08:28:57] [INFO ] Computed 30 invariants in 49 ms
[2024-05-30 08:28:58] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2024-05-30 08:28:58] [INFO ] Invariant cache hit.
[2024-05-30 08:29:02] [INFO ] Implicit Places using invariants and state equation in 3887 ms returned []
Implicit Place search using SMT with State Equation took 4907 ms to find 0 implicit places.
[2024-05-30 08:29:02] [INFO ] Redundant transitions in 17 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 : 362/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4985 ms. Remains : 362/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-08
Stuttering criterion allowed to conclude after 348 steps with 5 reset in 43 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-08 finished in 5093 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&&X(G(p1))))))'
Support contains 4 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 49 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:29:02] [INFO ] Computed 32 invariants in 43 ms
[2024-05-30 08:29:04] [INFO ] Implicit Places using invariants in 1631 ms returned []
[2024-05-30 08:29:04] [INFO ] Invariant cache hit.
[2024-05-30 08:29:09] [INFO ] Implicit Places using invariants and state equation in 4825 ms returned []
Implicit Place search using SMT with State Equation took 6457 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 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6509 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-12
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 15 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-12 finished in 6649 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 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 344 are kept as prefixes of interest. Removing 1350 places using SCC suffix rule.2 ms
Discarding 1350 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 344 /1694 variables (removed 1350) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 344 cols
[2024-05-30 08:29:09] [INFO ] Computed 24 invariants in 42 ms
[2024-05-30 08:29:10] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-30 08:29:10] [INFO ] Invariant cache hit.
[2024-05-30 08:29:13] [INFO ] Implicit Places using invariants and state equation in 3183 ms returned []
Implicit Place search using SMT with State Equation took 3824 ms to find 0 implicit places.
[2024-05-30 08:29:13] [INFO ] Redundant transitions in 15 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 : 344/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3879 ms. Remains : 344/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-13
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 10 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-13 finished in 3946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 32 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-05-30 08:29:13] [INFO ] Computed 32 invariants in 42 ms
[2024-05-30 08:29:14] [INFO ] Implicit Places using invariants in 1588 ms returned []
[2024-05-30 08:29:15] [INFO ] Invariant cache hit.
[2024-05-30 08:29:19] [INFO ] Implicit Places using invariants and state equation in 4803 ms returned []
Implicit Place search using SMT with State Equation took 6396 ms to find 0 implicit places.
[2024-05-30 08:29:19] [INFO ] Redundant transitions in 17 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6456 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-14
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 17 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-14 finished in 6581 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)||G(F(p1))))||G(p2)))'
Support contains 7 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-05-30 08:29:20] [INFO ] Computed 32 invariants in 46 ms
[2024-05-30 08:29:21] [INFO ] Implicit Places using invariants in 1537 ms returned []
[2024-05-30 08:29:21] [INFO ] Invariant cache hit.
[2024-05-30 08:29:27] [INFO ] Implicit Places using invariants and state equation in 6191 ms returned []
Implicit Place search using SMT with State Equation took 7741 ms to find 0 implicit places.
[2024-05-30 08:29:27] [INFO ] Redundant transitions in 19 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 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7815 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-15
Stuttering criterion allowed to conclude after 1590 steps with 15 reset in 123 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-15 finished in 8077 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(p0))'
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)&&F(p1))))'
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((G(!p0) U X((p1 U X(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(!p0) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Found a Lengthening insensitive property : Sudoku-PT-AN11-LTLCardinality-05
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:29:28] [INFO ] Computed 363 invariants in 12 ms
[2024-05-30 08:29:30] [INFO ] Implicit Places using invariants in 1770 ms returned []
[2024-05-30 08:29:30] [INFO ] Invariant cache hit.
[2024-05-30 08:29:33] [INFO ] Implicit Places using invariants and state equation in 2799 ms returned []
Implicit Place search using SMT with State Equation took 4573 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 4593 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05
Product exploration timeout after 67820 steps with 1807 reset in 10001 ms.
Product exploration timeout after 67370 steps with 1891 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 257 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
RANDOM walk for 40000 steps (376 resets) in 3591 ms. (11 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1527 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1510 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 3/3 properties
[2024-05-30 08:33:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2463 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1772 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4621ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4360 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1448 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 152249 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 152249 steps, saw 102414 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-30 08:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3026 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7726 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10916ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 715 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 284 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:34:21] [INFO ] Invariant cache hit.
[2024-05-30 08:34:22] [INFO ] Implicit Places using invariants in 1680 ms returned []
[2024-05-30 08:34:22] [INFO ] Invariant cache hit.
[2024-05-30 08:34:25] [INFO ] Implicit Places using invariants and state equation in 2861 ms returned []
Implicit Place search using SMT with State Equation took 4546 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 4561 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 213 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (376 resets) in 3307 ms. (12 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
[2024-05-30 08:36:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2564 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5012 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7637ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.9 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3318 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245443 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245443 steps, saw 126679 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-05-30 08:36:26] [INFO ] Computed 32 invariants in 30 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 730 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 290 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 264 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Product exploration timeout after 70940 steps with 671 reset in 10001 ms.
Product exploration timeout after 70150 steps with 664 reset in 10002 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 260 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-30 08:36:49] [INFO ] Redundant transitions in 12 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 38 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin9993783559187390846
[2024-05-30 08:36:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9993783559187390846
Running compilation step : cd /tmp/ltsmin9993783559187390846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9993783559187390846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9993783559187390846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-30 08:36:52] [INFO ] Computed 363 invariants in 4 ms
[2024-05-30 08:36:54] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2024-05-30 08:36:54] [INFO ] Invariant cache hit.
[2024-05-30 08:36:57] [INFO ] Implicit Places using invariants and state equation in 3022 ms returned []
Implicit Place search using SMT with State Equation took 4806 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 4820 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin17121896820716127943
[2024-05-30 08:36:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17121896820716127943
Running compilation step : cd /tmp/ltsmin17121896820716127943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17121896820716127943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17121896820716127943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 08:37:00] [INFO ] Flatten gal took : 45 ms
[2024-05-30 08:37:00] [INFO ] Flatten gal took : 45 ms
[2024-05-30 08:37:00] [INFO ] Time to serialize gal into /tmp/LTL7177160879194561084.gal : 7 ms
[2024-05-30 08:37:00] [INFO ] Time to serialize properties into /tmp/LTL8872738756860712030.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/LTL7177160879194561084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut815071730020164164.hoa' '-atoms' '/tmp/LTL8872738756860712030.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...316
Loading property file /tmp/LTL8872738756860712030.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut815071730020164164.hoa
Detected timeout of ITS tools.
[2024-05-30 08:37:15] [INFO ] Flatten gal took : 46 ms
[2024-05-30 08:37:15] [INFO ] Flatten gal took : 71 ms
[2024-05-30 08:37:15] [INFO ] Time to serialize gal into /tmp/LTL337767259449529620.gal : 15 ms
[2024-05-30 08:37:15] [INFO ] Time to serialize properties into /tmp/LTL8643786458474505293.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/LTL337767259449529620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8643786458474505293.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...274
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_0_9)+(Rows_0_10+Row...77419
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_0_9)+(Rows_0_10+Rows_...77410
Detected timeout of ITS tools.
[2024-05-30 08:37:30] [INFO ] Flatten gal took : 47 ms
[2024-05-30 08:37:30] [INFO ] Applying decomposition
[2024-05-30 08:37:30] [INFO ] Flatten gal took : 49 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/graph14965088049624262881.txt' '-o' '/tmp/graph14965088049624262881.bin' '-w' '/tmp/graph14965088049624262881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14965088049624262881.bin' '-l' '-1' '-v' '-w' '/tmp/graph14965088049624262881.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:37:38] [INFO ] Decomposing Gal with order
[2024-05-30 08:37:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:37:39] [INFO ] Removed a total of 1210 redundant transitions.
[2024-05-30 08:37:39] [INFO ] Flatten gal took : 1106 ms
[2024-05-30 08:37:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 49 ms.
[2024-05-30 08:37:39] [INFO ] Time to serialize gal into /tmp/LTL12752140513078446960.gal : 7 ms
[2024-05-30 08:37:39] [INFO ] Time to serialize properties into /tmp/LTL15426402263205929937.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12752140513078446960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15426402263205929937.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("((((((((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...99199
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...99190
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 506295 ms.
[2024-05-30 08:37:54] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11398257018467433574
[2024-05-30 08:37:54] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-30 08:37:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:37:54] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-30 08:37:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:37:54] [INFO ] Applying decomposition
[2024-05-30 08:37:54] [INFO ] Flatten gal took : 54 ms
[2024-05-30 08:37:55] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-30 08:37:55] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:37:55] [INFO ] Built C files in 870ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11398257018467433574
Running compilation step : cd /tmp/ltsmin11398257018467433574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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 8545 ms.
Running link step : cd /tmp/ltsmin11398257018467433574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin11398257018467433574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
[2024-05-30 08:38:11] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4115680881193894411.txt' '-o' '/tmp/graph4115680881193894411.bin' '-w' '/tmp/graph4115680881193894411.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 08:38:11] [INFO ] Flatten gal took : 143 ms
[2024-05-30 08:38:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality7727664403646043358.gal : 50 ms
[2024-05-30 08:38:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality381161445015869331.ltl : 5 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/LTLCardinality7727664403646043358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality381161445015869331.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...296
Read 4 LTL properties
Checking formula 0 : !((F("((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...20500
Formula 0 simplified : G!"((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cells...20496
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11398257018467433574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11398257018467433574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp1==true))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11398257018467433574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp1==true))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11398257018467433574;'/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)) U X(((LTLAPp3==true) U X((LTLAPp4==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.354: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.354: LTL layer: formula: [](([](!(LTLAPp0==true)) U X(((LTLAPp3==true) U X((LTLAPp4==true))))))
pins2lts-mc-linux64( 2/ 8), 0.354: "[](([](!(LTLAPp0==true)) U X(((LTLAPp3==true) U X((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.354: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.366: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.376: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.398: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.414: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.417: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.418: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.424: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.438: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.272: DFS-FIFO for weak LTL, using special progress label 1339
pins2lts-mc-linux64( 0/ 8), 1.272: There are 1340 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.272: State length is 1695, there are 1347 groups
pins2lts-mc-linux64( 0/ 8), 1.272: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.272: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.272: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.272: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 6.793: ~1 levels ~960 states ~1040496 transitions
pins2lts-mc-linux64( 4/ 8), 11.267: ~1 levels ~1920 states ~2280080 transitions
pins2lts-mc-linux64( 0/ 8), 20.220: ~1 levels ~3840 states ~4606016 transitions
pins2lts-mc-linux64( 1/ 8), 37.699: ~1 levels ~7680 states ~9366256 transitions
pins2lts-mc-linux64( 0/ 8), 65.443: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 135.316:
pins2lts-mc-linux64( 0/ 8), 135.316: mean standard work distribution: 2.9% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 135.316:
pins2lts-mc-linux64( 0/ 8), 135.316: Explored 12629 states 16147490 transitions, fanout: 1278.604
pins2lts-mc-linux64( 0/ 8), 135.316: Total exploration time 134.010 sec (68.190 sec minimum, 104.620 sec on average)
pins2lts-mc-linux64( 0/ 8), 135.316: States per second: 94, Transitions per second: 120495
pins2lts-mc-linux64( 0/ 8), 135.316:
pins2lts-mc-linux64( 0/ 8), 135.316: Progress states detected: 11560525
pins2lts-mc-linux64( 0/ 8), 135.316: Redundant explorations: -99.8908
pins2lts-mc-linux64( 0/ 8), 135.316:
pins2lts-mc-linux64( 0/ 8), 135.316: Queue width: 8B, total height: 13277882, memory: 101.30MB
pins2lts-mc-linux64( 0/ 8), 135.316: Tree memory: 344.2MB, 31.2 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 135.316: Tree fill ratio (roots/leafs): 8.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 135.316: Stored 1358 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 135.316: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 135.316: Est. total memory use: 445.5MB (~1125.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11398257018467433574;'/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)) U X(((LTLAPp3==true) U X((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11398257018467433574;'/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)) U X(((LTLAPp3==true) U X((LTLAPp4==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 08:53:09] [INFO ] Applying decomposition
[2024-05-30 08:53:09] [INFO ] Flatten gal took : 55 ms
[2024-05-30 08:53:09] [INFO ] Decomposing Gal with order
[2024-05-30 08:53:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:53:09] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-30 08:53:09] [INFO ] Flatten gal took : 101 ms
[2024-05-30 08:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 08:53:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality4763765813126990837.gal : 9 ms
[2024-05-30 08:53:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality14959628647027522635.ltl : 5 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/LTLCardinality4763765813126990837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14959628647027522635.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 4 LTL properties
Checking formula 0 : !((F("((((((((gu53.Cells_0_0+gu64.Cells_0_1)+(gu5.Cells_0_2+gu86.Cells_0_3))+((gu47.Cells_0_4+gu48.Cells_0_5)+(gu71.Cells_0_6+gu72.Cel...28012
Formula 0 simplified : G!"((((((((gu53.Cells_0_0+gu64.Cells_0_1)+(gu5.Cells_0_2+gu86.Cells_0_3))+((gu47.Cells_0_4+gu48.Cells_0_5)+(gu71.Cells_0_6+gu72.Cell...28008

BK_TIME_CONFINEMENT_REACHED

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

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