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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 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 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717038984200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-30 03:16:25] [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 03:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:16:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 03:16:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 03:16:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 502 ms
[2024-05-30 03:16:25] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 03:16:26] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 03:16:26] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40856 steps (176 resets) in 164 ms. (247 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40856 steps (176 resets) in 48 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 73 ms. (552 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 83 ms. (486 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 55 ms. (729 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 59 ms. (680 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 53 ms. (756 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 57 ms. (704 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 39 ms. (1021 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40856 steps (176 resets) in 35 ms. (1134 steps per ms) remains 9/9 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 03:16:26] [INFO ] Computed 3 invariants in 6 ms
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 7 solved, 2 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 8 constraints, problems are : Problem set: 8 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 8 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 03:16:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-30 03:16:26] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 03:16:26] [INFO ] Flatten gal took : 1 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-05-30 03:16:26] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 62 ms.
[2024-05-30 03:16:26] [INFO ] Unfolded 6 HLPN properties in 6 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 42 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:16:27] [INFO ] Computed 675 invariants in 43 ms
[2024-05-30 03:16:28] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2024-05-30 03:16:28] [INFO ] Invariant cache hit.
[2024-05-30 03:16:32] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 5523 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 5582 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2024-05-30 03:16:33] [INFO ] Flatten gal took : 343 ms
[2024-05-30 03:16:33] [INFO ] Flatten gal took : 202 ms
[2024-05-30 03:16:33] [INFO ] Input system was already deterministic with 3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 15618 ms. (2 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 733 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2655 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1276 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1294 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 906 ms. (44 steps per ms) remains 6/6 properties
[2024-05-30 03:16:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp9 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10438ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.9 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 12131 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2265 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1236 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 5/5 properties
Probabilistic random walk after 146545 steps, saw 146493 distinct states, run finished after 12046 ms. (steps per millisecond=12 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 03:17:07] [INFO ] Computed 44 invariants in 142 ms
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2325 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 2 solved, 3 unsolved in 14662 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 17408ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 225 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 20 ms.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 100 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:17:24] [INFO ] Computed 675 invariants in 19 ms
[2024-05-30 03:17:26] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2024-05-30 03:17:26] [INFO ] Invariant cache hit.
[2024-05-30 03:17:31] [INFO ] Implicit Places using invariants and state equation in 4997 ms returned []
Implicit Place search using SMT with State Equation took 7197 ms to find 0 implicit places.
[2024-05-30 03:17:32] [INFO ] Redundant transitions in 175 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 7477 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-00
Product exploration timeout after 44640 steps with 225 reset in 10003 ms.
Product exploration timeout after 44010 steps with 222 reset in 10002 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (OR p2 p1 p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 593 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (200 resets) in 24513 ms. (1 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 751 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7137 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3923 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7761 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7331 ms. (5 steps per ms) remains 5/5 properties
[2024-05-30 03:18:09] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf8 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 450/450 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3175 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 450/450 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9262ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 45 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 15471 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 891 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7826 ms. (5 steps per ms) remains 2/2 properties
Probabilistic random walk after 166575 steps, saw 166517 distinct states, run finished after 18045 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 03:18:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 450/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 225/4050 variables, 225/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3375/7425 variables, 4050/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20900 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 450/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18938 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 40622ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 58 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 44 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:19:24] [INFO ] Invariant cache hit.
[2024-05-30 03:19:25] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2024-05-30 03:19:25] [INFO ] Invariant cache hit.
[2024-05-30 03:19:30] [INFO ] Implicit Places using invariants and state equation in 4935 ms returned []
Implicit Place search using SMT with State Equation took 6132 ms to find 0 implicit places.
[2024-05-30 03:19:30] [INFO ] Redundant transitions in 103 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6284 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (OR p2 p1 p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 606 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Support contains 225 out of 4050 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 41 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:19:31] [INFO ] Invariant cache hit.
[2024-05-30 03:19:32] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2024-05-30 03:19:32] [INFO ] Invariant cache hit.
[2024-05-30 03:19:37] [INFO ] Implicit Places using invariants and state equation in 4839 ms returned []
Implicit Place search using SMT with State Equation took 6012 ms to find 0 implicit places.
[2024-05-30 03:19:37] [INFO ] Redundant transitions in 203 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 6265 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (200 resets) in 8090 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 315882 steps, run timeout after 6007 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 315882 steps, saw 315725 distinct states, run finished after 6010 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-30 03:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3375/3600 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3375/3600 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.11 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 224 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 7849 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355224 steps, run timeout after 6001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 355224 steps, saw 346572 distinct states, run finished after 6002 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 03:19:58] [INFO ] Computed 44 invariants in 98 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9506 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4139 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13798ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 223 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 50730 steps with 255 reset in 10002 ms.
Product exploration timeout after 50000 steps with 252 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17881291000627847394
[2024-05-30 03:20:33] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:20:33] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17881291000627847394
Running compilation step : cd /tmp/ltsmin17881291000627847394;'/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/ltsmin17881291000627847394;'/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/ltsmin17881291000627847394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.4 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:20:36] [INFO ] Invariant cache hit.
[2024-05-30 03:20:36] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-30 03:20:36] [INFO ] Invariant cache hit.
[2024-05-30 03:20:58] [INFO ] Implicit Places using invariants and state equation in 21647 ms returned []
Implicit Place search using SMT with State Equation took 22189 ms to find 0 implicit places.
[2024-05-30 03:20:58] [INFO ] Redundant transitions in 111 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 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22385 ms. Remains : 675/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin1000888639010703158
[2024-05-30 03:20:58] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:20:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1000888639010703158
Running compilation step : cd /tmp/ltsmin1000888639010703158;'/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/ltsmin1000888639010703158;'/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/ltsmin1000888639010703158;'/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 03:21:02] [INFO ] Flatten gal took : 121 ms
[2024-05-30 03:21:02] [INFO ] Flatten gal took : 117 ms
[2024-05-30 03:21:02] [INFO ] Time to serialize gal into /tmp/LTL12034445134897498523.gal : 33 ms
[2024-05-30 03:21:02] [INFO ] Time to serialize properties into /tmp/LTL10330585807960065933.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12034445134897498523.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8667501026408240828.hoa' '-atoms' '/tmp/LTL10330585807960065933.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/LTL10330585807960065933.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8667501026408240828.hoa
Detected timeout of ITS tools.
[2024-05-30 03:21:17] [INFO ] Flatten gal took : 167 ms
[2024-05-30 03:21:17] [INFO ] Flatten gal took : 148 ms
[2024-05-30 03:21:17] [INFO ] Time to serialize gal into /tmp/LTL7617713319039642494.gal : 28 ms
[2024-05-30 03:21:17] [INFO ] Time to serialize properties into /tmp/LTL5141592993400465548.ltl : 17 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/LTL7617713319039642494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5141592993400465548.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(G((("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11)...96842
Formula 0 simplified : GF((!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...96838
Detected timeout of ITS tools.
[2024-05-30 03:21:32] [INFO ] Flatten gal took : 138 ms
[2024-05-30 03:21:32] [INFO ] Applying decomposition
[2024-05-30 03:21:33] [INFO ] Flatten gal took : 140 ms
[2024-05-30 03:21:54] [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/graph11476745930733878189.txt' '-o' '/tmp/graph11476745930733878189.bin' '-w' '/tmp/graph11476745930733878189.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 03:21:55] [INFO ] Flatten gal took : 139 ms
[2024-05-30 03:21:55] [INFO ] Time to serialize gal into /tmp/LTL17152021194035607309.gal : 27 ms
[2024-05-30 03:21:55] [INFO ] Time to serialize properties into /tmp/LTL9447887035088601187.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/LTL17152021194035607309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9447887035088601187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11)...96842
Formula 0 simplified : GF((!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...96838
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN15-LTLCardinality-00 finished in 285553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U G((p1 U p2)))&&X(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 21 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:22:10] [INFO ] Computed 675 invariants in 20 ms
[2024-05-30 03:22:12] [INFO ] Implicit Places using invariants in 1874 ms returned []
[2024-05-30 03:22:12] [INFO ] Invariant cache hit.
[2024-05-30 03:22:17] [INFO ] Implicit Places using invariants and state equation in 5136 ms returned []
Implicit Place search using SMT with State Equation took 7013 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 7038 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-04
Product exploration timeout after 11690 steps with 2888 reset in 10007 ms.
Product exploration timeout after 11730 steps with 2932 reset in 10011 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X p0), (X p1), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 588 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 13 to 8
RANDOM walk for 40000 steps (200 resets) in 40127 ms. (0 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9905 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12826 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9830 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6725 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15806 ms. (2 steps per ms) remains 5/5 properties
[2024-05-30 03:23:07] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 3825/7425 variables, and 450 constraints, problems are : Problem set: 5 solved, 0 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 450/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8100ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X p0), (X p1), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (AND (OR p0 (NOT p2)) (OR p0 (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p2 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2 p1)))
Knowledge based reduction with 19 factoid took 470 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLCardinality-04 finished in 65552 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 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.7 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 03:23:15] [INFO ] Computed 44 invariants in 74 ms
[2024-05-30 03:23:16] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-30 03:23:16] [INFO ] Invariant cache hit.
[2024-05-30 03:23:37] [INFO ] Implicit Places using invariants and state equation in 21251 ms returned []
Implicit Place search using SMT with State Equation took 21890 ms to find 0 implicit places.
[2024-05-30 03:23:37] [INFO ] Redundant transitions in 114 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22085 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-08
Product exploration timeout after 48670 steps with 245 reset in 10004 ms.
Product exploration timeout after 49050 steps with 247 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (200 resets) in 7784 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346024 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 346024 steps, saw 344930 distinct states, run finished after 6002 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-30 03:24:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1820 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1065 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2928ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 223 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 225 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 50 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:24:09] [INFO ] Invariant cache hit.
[2024-05-30 03:24:10] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-30 03:24:10] [INFO ] Invariant cache hit.
[2024-05-30 03:24:31] [INFO ] Implicit Places using invariants and state equation in 21377 ms returned []
Implicit Place search using SMT with State Equation took 21896 ms to find 0 implicit places.
[2024-05-30 03:24:31] [INFO ] Redundant transitions in 114 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 22075 ms. Remains : 675/675 places, 3375/3375 transitions.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (200 resets) in 8734 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 623 ms. (64 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346149 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 346149 steps, saw 344944 distinct states, run finished after 6001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-30 03:24:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1769 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 446/671 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/675 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1038 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2846ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 223 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration timeout after 49670 steps with 250 reset in 10002 ms.
Product exploration timeout after 49050 steps with 247 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9194071478053500375
[2024-05-30 03:25:04] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:25:04] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9194071478053500375
Running compilation step : cd /tmp/ltsmin9194071478053500375;'/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/ltsmin9194071478053500375;'/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/ltsmin9194071478053500375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 225 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 50 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:25:07] [INFO ] Invariant cache hit.
[2024-05-30 03:25:07] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-30 03:25:07] [INFO ] Invariant cache hit.
[2024-05-30 03:25:29] [INFO ] Implicit Places using invariants and state equation in 21403 ms returned []
Implicit Place search using SMT with State Equation took 21888 ms to find 0 implicit places.
[2024-05-30 03:25:29] [INFO ] Redundant transitions in 107 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22058 ms. Remains : 675/675 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin1561571716579286065
[2024-05-30 03:25:29] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:25:29] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1561571716579286065
Running compilation step : cd /tmp/ltsmin1561571716579286065;'/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/ltsmin1561571716579286065;'/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/ltsmin1561571716579286065;'/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 03:25:32] [INFO ] Flatten gal took : 94 ms
[2024-05-30 03:25:32] [INFO ] Flatten gal took : 124 ms
[2024-05-30 03:25:32] [INFO ] Time to serialize gal into /tmp/LTL10450266335738468701.gal : 14 ms
[2024-05-30 03:25:32] [INFO ] Time to serialize properties into /tmp/LTL13154902583098989105.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/LTL10450266335738468701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10474533764974506386.hoa' '-atoms' '/tmp/LTL13154902583098989105.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...320
Loading property file /tmp/LTL13154902583098989105.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10474533764974506386.hoa
Detected timeout of ITS tools.
[2024-05-30 03:25:48] [INFO ] Flatten gal took : 96 ms
[2024-05-30 03:25:48] [INFO ] Flatten gal took : 105 ms
[2024-05-30 03:25:48] [INFO ] Time to serialize gal into /tmp/LTL1535102861488686842.gal : 13 ms
[2024-05-30 03:25:48] [INFO ] Time to serialize properties into /tmp/LTL15933906177745415585.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/LTL1535102861488686842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15933906177745415585.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2626
Formula 0 simplified : GF!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2620
Detected timeout of ITS tools.
[2024-05-30 03:26:03] [INFO ] Flatten gal took : 106 ms
[2024-05-30 03:26:03] [INFO ] Applying decomposition
[2024-05-30 03:26:03] [INFO ] Flatten gal took : 114 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/graph11228723765789206859.txt' '-o' '/tmp/graph11228723765789206859.bin' '-w' '/tmp/graph11228723765789206859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11228723765789206859.bin' '-l' '-1' '-v' '-w' '/tmp/graph11228723765789206859.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:26:03] [INFO ] Decomposing Gal with order
[2024-05-30 03:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:26:04] [INFO ] Removed a total of 9450 redundant transitions.
[2024-05-30 03:26:04] [INFO ] Flatten gal took : 950 ms
[2024-05-30 03:26:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2024-05-30 03:26:05] [INFO ] Time to serialize gal into /tmp/LTL10792948015985219217.gal : 18 ms
[2024-05-30 03:26:05] [INFO ] Time to serialize properties into /tmp/LTL2449208539750449962.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10792948015985219217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2449208539750449962.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((gu225.Cells_0+gu225.Cells_1)+(gu225.Cells_2+gu225.Cells_3))+((gu225.Cells_4+gu225.Cells_5)+(gu225.Cells_6+gu225.Cells...3976
Formula 0 simplified : GF!"(((((((((gu225.Cells_0+gu225.Cells_1)+(gu225.Cells_2+gu225.Cells_3))+((gu225.Cells_4+gu225.Cells_5)+(gu225.Cells_6+gu225.Cells_7...3970
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN15-LTLCardinality-08 finished in 184417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 57 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:26:20] [INFO ] Computed 675 invariants in 26 ms
[2024-05-30 03:26:22] [INFO ] Implicit Places using invariants in 2646 ms returned []
[2024-05-30 03:26:22] [INFO ] Invariant cache hit.
[2024-05-30 03:26:28] [INFO ] Implicit Places using invariants and state equation in 5809 ms returned []
Implicit Place search using SMT with State Equation took 8457 ms to find 0 implicit places.
[2024-05-30 03:26:28] [INFO ] Redundant transitions in 113 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 8641 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-11
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 72 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-11 finished in 8882 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((F(p1)&&p0)))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 51 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:26:29] [INFO ] Invariant cache hit.
[2024-05-30 03:26:30] [INFO ] Implicit Places using invariants in 1782 ms returned []
[2024-05-30 03:26:30] [INFO ] Invariant cache hit.
[2024-05-30 03:26:36] [INFO ] Implicit Places using invariants and state equation in 5863 ms returned []
Implicit Place search using SMT with State Equation took 7649 ms to find 0 implicit places.
[2024-05-30 03:26:36] [INFO ] Redundant transitions in 113 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 7825 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-13
Product exploration timeout after 18880 steps with 6293 reset in 10004 ms.
Product exploration timeout after 18730 steps with 6243 reset in 10002 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (200 resets) in 8324 ms. (4 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 871 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3616 ms. (11 steps per ms) remains 2/2 properties
[2024-05-30 03:27:02] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 225/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3600 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3375/3600 variables, 225/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3600 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3707ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.4 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 57 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 8408 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 338443 steps, run timeout after 6002 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 338443 steps, saw 338237 distinct states, run finished after 6003 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-05-30 03:27:14] [INFO ] Computed 44 invariants in 76 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 436/661 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/675 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1466 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 436/661 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/675 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3375/4050 variables, 675/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4050 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3500 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5090ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 225 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 12 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 03:27:21] [INFO ] Computed 675 invariants in 13 ms
Could not prove EG (NOT p0)
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 48 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:27:36] [INFO ] Invariant cache hit.
[2024-05-30 03:27:38] [INFO ] Implicit Places using invariants in 1998 ms returned []
[2024-05-30 03:27:38] [INFO ] Invariant cache hit.
[2024-05-30 03:27:44] [INFO ] Implicit Places using invariants and state equation in 5892 ms returned []
Implicit Place search using SMT with State Equation took 7895 ms to find 0 implicit places.
[2024-05-30 03:27:44] [INFO ] Redundant transitions in 114 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 8070 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 28 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 20 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-30 03:27:47] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration timeout after 22080 steps with 7360 reset in 10003 ms.
Product exploration timeout after 22060 steps with 7353 reset in 10003 ms.
Built C files in :
/tmp/ltsmin14807445263947153959
[2024-05-30 03:28:22] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:28:22] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14807445263947153959
Running compilation step : cd /tmp/ltsmin14807445263947153959;'/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/ltsmin14807445263947153959;'/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/ltsmin14807445263947153959;'/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 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 56 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:28:25] [INFO ] Invariant cache hit.
[2024-05-30 03:28:27] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2024-05-30 03:28:27] [INFO ] Invariant cache hit.
[2024-05-30 03:28:33] [INFO ] Implicit Places using invariants and state equation in 6276 ms returned []
Implicit Place search using SMT with State Equation took 8117 ms to find 0 implicit places.
[2024-05-30 03:28:33] [INFO ] Redundant transitions in 108 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 8291 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin7696036555977214716
[2024-05-30 03:28:33] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:28:33] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7696036555977214716
Running compilation step : cd /tmp/ltsmin7696036555977214716;'/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/ltsmin7696036555977214716;'/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/ltsmin7696036555977214716;'/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 03:28:37] [INFO ] Flatten gal took : 228 ms
[2024-05-30 03:28:37] [INFO ] Flatten gal took : 168 ms
[2024-05-30 03:28:37] [INFO ] Time to serialize gal into /tmp/LTL16740360878079470504.gal : 21 ms
[2024-05-30 03:28:37] [INFO ] Time to serialize properties into /tmp/LTL9414297028911482722.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16740360878079470504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11744576105924955587.hoa' '-atoms' '/tmp/LTL9414297028911482722.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/LTL9414297028911482722.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11744576105924955587.hoa
Detected timeout of ITS tools.
[2024-05-30 03:28:52] [INFO ] Flatten gal took : 145 ms
[2024-05-30 03:28:53] [INFO ] Flatten gal took : 145 ms
[2024-05-30 03:28:53] [INFO ] Time to serialize gal into /tmp/LTL11913438038515637891.gal : 22 ms
[2024-05-30 03:28:53] [INFO ] Time to serialize properties into /tmp/LTL9862244941842641273.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/LTL11913438038515637891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9862244941842641273.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Row...47547
Formula 0 simplified : G(!"((((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...47541
Detected timeout of ITS tools.
[2024-05-30 03:29:08] [INFO ] Flatten gal took : 133 ms
[2024-05-30 03:29:08] [INFO ] Applying decomposition
[2024-05-30 03:29:08] [INFO ] Flatten gal took : 137 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/graph10347916886952146618.txt' '-o' '/tmp/graph10347916886952146618.bin' '-w' '/tmp/graph10347916886952146618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10347916886952146618.bin' '-l' '-1' '-v' '-w' '/tmp/graph10347916886952146618.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:29:21] [INFO ] Decomposing Gal with order
[2024-05-30 03:29:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:29:27] [INFO ] Removed a total of 3150 redundant transitions.
[2024-05-30 03:29:27] [INFO ] Flatten gal took : 6477 ms
[2024-05-30 03:29:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 3375 labels/synchronizations in 328 ms.
[2024-05-30 03:29:28] [INFO ] Time to serialize gal into /tmp/LTL15086492242380242396.gal : 23 ms
[2024-05-30 03:29:28] [INFO ] Time to serialize properties into /tmp/LTL1453954230494261319.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/LTL15086492242380242396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1453954230494261319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0....62847
Formula 0 simplified : G(!"((((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...62841
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN15-LTLCardinality-13 finished in 194774 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(p1)))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 37 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:29:43] [INFO ] Invariant cache hit.
[2024-05-30 03:29:45] [INFO ] Implicit Places using invariants in 1596 ms returned []
[2024-05-30 03:29:45] [INFO ] Invariant cache hit.
[2024-05-30 03:29:51] [INFO ] Implicit Places using invariants and state equation in 5647 ms returned []
Implicit Place search using SMT with State Equation took 7246 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 7286 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-14
Product exploration timeout after 19870 steps with 174 reset in 10003 ms.
Product exploration timeout after 19830 steps with 173 reset in 10003 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 452 steps (0 resets) in 221 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:30:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-30 03:30:31] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 37 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:30:46] [INFO ] Invariant cache hit.
[2024-05-30 03:30:48] [INFO ] Implicit Places using invariants in 1707 ms returned []
[2024-05-30 03:30:48] [INFO ] Invariant cache hit.
[2024-05-30 03:30:54] [INFO ] Implicit Places using invariants and state equation in 5891 ms returned []
Implicit Place search using SMT with State Equation took 7599 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 7639 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 452 steps (0 resets) in 211 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:30:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-30 03:31:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration timeout after 19810 steps with 173 reset in 10002 ms.
Product exploration timeout after 19750 steps with 173 reset in 10004 ms.
Built C files in :
/tmp/ltsmin3042831245149316306
[2024-05-30 03:31:49] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3042831245149316306
Running compilation step : cd /tmp/ltsmin3042831245149316306;'/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/ltsmin3042831245149316306;'/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/ltsmin3042831245149316306;'/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 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 35 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:31:52] [INFO ] Invariant cache hit.
[2024-05-30 03:31:54] [INFO ] Implicit Places using invariants in 1840 ms returned []
[2024-05-30 03:31:54] [INFO ] Invariant cache hit.
[2024-05-30 03:32:00] [INFO ] Implicit Places using invariants and state equation in 5778 ms returned []
Implicit Place search using SMT with State Equation took 7623 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 7661 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin6028353765646069763
[2024-05-30 03:32:00] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6028353765646069763
Running compilation step : cd /tmp/ltsmin6028353765646069763;'/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/ltsmin6028353765646069763;'/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/ltsmin6028353765646069763;'/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 03:32:03] [INFO ] Flatten gal took : 169 ms
[2024-05-30 03:32:03] [INFO ] Flatten gal took : 148 ms
[2024-05-30 03:32:03] [INFO ] Time to serialize gal into /tmp/LTL14720860686626681312.gal : 18 ms
[2024-05-30 03:32:03] [INFO ] Time to serialize properties into /tmp/LTL18275942455786689005.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14720860686626681312.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12289500882165844918.hoa' '-atoms' '/tmp/LTL18275942455786689005.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...320
Loading property file /tmp/LTL18275942455786689005.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12289500882165844918.hoa
Detected timeout of ITS tools.
[2024-05-30 03:32:19] [INFO ] Flatten gal took : 119 ms
[2024-05-30 03:32:19] [INFO ] Flatten gal took : 134 ms
[2024-05-30 03:32:19] [INFO ] Time to serialize gal into /tmp/LTL9372204172992574020.gal : 20 ms
[2024-05-30 03:32:19] [INFO ] Time to serialize properties into /tmp/LTL2266837045216948912.ltl : 8 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/LTL9372204172992574020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2266837045216948912.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 : !((X(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...88615
Formula 0 simplified : XG(!"(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...88607
Detected timeout of ITS tools.
[2024-05-30 03:32:34] [INFO ] Flatten gal took : 119 ms
[2024-05-30 03:32:34] [INFO ] Applying decomposition
[2024-05-30 03:32:34] [INFO ] Flatten gal took : 123 ms
[2024-05-30 03:32:52] [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/graph8052942882011425883.txt' '-o' '/tmp/graph8052942882011425883.bin' '-w' '/tmp/graph8052942882011425883.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 03:32:53] [INFO ] Flatten gal took : 127 ms
[2024-05-30 03:32:53] [INFO ] Time to serialize gal into /tmp/LTL2480967946559734761.gal : 18 ms
[2024-05-30 03:32:53] [INFO ] Time to serialize properties into /tmp/LTL4286327074536029640.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2480967946559734761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4286327074536029640.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 : !((X(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...88615
Formula 0 simplified : XG(!"(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...88607
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN15-LTLCardinality-14 finished in 204396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
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)))'
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((F(p1)&&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' '!(X(F((p0&&X(p1)))))'
Found a Shortening insensitive property : Sudoku-COL-AN15-LTLCardinality-14
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 57 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:33:08] [INFO ] Invariant cache hit.
[2024-05-30 03:33:10] [INFO ] Implicit Places using invariants in 1849 ms returned []
[2024-05-30 03:33:10] [INFO ] Invariant cache hit.
[2024-05-30 03:33:16] [INFO ] Implicit Places using invariants and state equation in 5960 ms returned []
Implicit Place search using SMT with State Equation took 7811 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 7870 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-14
Product exploration timeout after 19900 steps with 174 reset in 10002 ms.
Product exploration timeout after 19830 steps with 173 reset in 10005 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 452 steps (0 resets) in 269 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:33:40] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-30 03:33:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 39 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:34:11] [INFO ] Invariant cache hit.
[2024-05-30 03:34:13] [INFO ] Implicit Places using invariants in 1761 ms returned []
[2024-05-30 03:34:13] [INFO ] Invariant cache hit.
[2024-05-30 03:34:19] [INFO ] Implicit Places using invariants and state equation in 5972 ms returned []
Implicit Place search using SMT with State Equation took 7740 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 7781 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 452 steps (0 resets) in 207 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-30 03:34:23] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-30 03:34:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration timeout after 19870 steps with 174 reset in 10002 ms.
Product exploration timeout after 19730 steps with 173 reset in 10001 ms.
Built C files in :
/tmp/ltsmin6428398407025142933
[2024-05-30 03:35:14] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6428398407025142933
Running compilation step : cd /tmp/ltsmin6428398407025142933;'/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/ltsmin6428398407025142933;'/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/ltsmin6428398407025142933;'/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 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 39 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 03:35:18] [INFO ] Invariant cache hit.
[2024-05-30 03:35:19] [INFO ] Implicit Places using invariants in 1667 ms returned []
[2024-05-30 03:35:19] [INFO ] Invariant cache hit.
[2024-05-30 03:35:25] [INFO ] Implicit Places using invariants and state equation in 5752 ms returned []
Implicit Place search using SMT with State Equation took 7421 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 7462 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin15689176996054068018
[2024-05-30 03:35:25] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15689176996054068018
Running compilation step : cd /tmp/ltsmin15689176996054068018;'/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/ltsmin15689176996054068018;'/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/ltsmin15689176996054068018;'/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 03:35:28] [INFO ] Flatten gal took : 132 ms
[2024-05-30 03:35:28] [INFO ] Flatten gal took : 132 ms
[2024-05-30 03:35:28] [INFO ] Time to serialize gal into /tmp/LTL6442405332418457057.gal : 19 ms
[2024-05-30 03:35:28] [INFO ] Time to serialize properties into /tmp/LTL12927563960515783857.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/LTL6442405332418457057.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9397047069118493307.hoa' '-atoms' '/tmp/LTL12927563960515783857.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/LTL12927563960515783857.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9397047069118493307.hoa
Detected timeout of ITS tools.
[2024-05-30 03:35:44] [INFO ] Flatten gal took : 139 ms
[2024-05-30 03:35:44] [INFO ] Flatten gal took : 140 ms
[2024-05-30 03:35:44] [INFO ] Time to serialize gal into /tmp/LTL13197929786949862129.gal : 21 ms
[2024-05-30 03:35:44] [INFO ] Time to serialize properties into /tmp/LTL17653942308508592530.ltl : 4 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/LTL13197929786949862129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17653942308508592530.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 : !((X(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...88615
Formula 0 simplified : XG(!"(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...88607
Detected timeout of ITS tools.
[2024-05-30 03:35:59] [INFO ] Flatten gal took : 127 ms
[2024-05-30 03:35:59] [INFO ] Applying decomposition
[2024-05-30 03:35:59] [INFO ] Flatten gal took : 130 ms
[2024-05-30 03:36:20] [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/graph6350200438296969853.txt' '-o' '/tmp/graph6350200438296969853.bin' '-w' '/tmp/graph6350200438296969853.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
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 03:36:20] [INFO ] Flatten gal took : 136 ms
[2024-05-30 03:36:20] [INFO ] Time to serialize gal into /tmp/LTL9365793422633493285.gal : 19 ms
[2024-05-30 03:36:20] [INFO ] Time to serialize properties into /tmp/LTL10003234609159792880.ltl : 4 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/LTL9365793422633493285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10003234609159792880.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...88615
Formula 0 simplified : XG(!"(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...88607
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN15-LTLCardinality-14 finished in 207088 ms.
[2024-05-30 03:36:35] [INFO ] Flatten gal took : 128 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5611311544780890072
[2024-05-30 03:36:35] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-30 03:36:35] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5611311544780890072
Running compilation step : cd /tmp/ltsmin5611311544780890072;'/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'
[2024-05-30 03:36:35] [INFO ] Applying decomposition
[2024-05-30 03:36:36] [INFO ] Flatten gal took : 178 ms
Compilation finished in 17044 ms.
Running link step : cd /tmp/ltsmin5611311544780890072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin5611311544780890072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((((LTLAPp0==true) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
[2024-05-30 03:37:10] [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/graph17383463709648862060.txt' '-o' '/tmp/graph17383463709648862060.bin' '-w' '/tmp/graph17383463709648862060.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 03:37:10] [INFO ] Flatten gal took : 356 ms
[2024-05-30 03:37:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality8608046329584338849.gal : 77 ms
[2024-05-30 03:37:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality3675023220487446641.ltl : 26 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/LTLCardinality8608046329584338849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3675023220487446641.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11)...96842
Formula 0 simplified : GF((!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...96838
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5611311544780890072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((((LTLAPp0==true) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5611311544780890072;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5611311544780890072;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5611311544780890072;'/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' '<>((<>((LTLAPp5==true))&&(LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5611311544780890072;'/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' '<>((<>((LTLAPp5==true))&&(LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5611311544780890072;'/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' 'X(<>(((LTLAPp6==true)&&X((LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5611311544780890072;'/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' 'X(<>(((LTLAPp6==true)&&X((LTLAPp7==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin5611311544780890072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((((LTLAPp0==true) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-30 03:55:17] [INFO ] Applying decomposition
[2024-05-30 03:55:18] [INFO ] Flatten gal took : 320 ms
[2024-05-30 03:55:18] [INFO ] Decomposing Gal with order
[2024-05-30 03:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:55:22] [INFO ] Removed a total of 8565 redundant transitions.
[2024-05-30 03:55:22] [INFO ] Flatten gal took : 810 ms
[2024-05-30 03:55:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2024-05-30 03:55:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality9337147243354908136.gal : 65 ms
[2024-05-30 03:55:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality8053006495926534155.ltl : 25 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/LTLCardinality9337147243354908136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8053006495926534155.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !((F(G((("((((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))...161232
Formula 0 simplified : GF((!"((((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(...161228
ITS-tools command line returned an error code 137
[2024-05-30 04:14:16] [INFO ] Flatten gal took : 374 ms
[2024-05-30 04:14:16] [INFO ] Input system was already deterministic with 3375 transitions.
[2024-05-30 04:14:16] [INFO ] Transformed 4050 places.
[2024-05-30 04:14:16] [INFO ] Transformed 3375 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 04:14:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality13683037138715402913.gal : 41 ms
[2024-05-30 04:14:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality6823090735915624061.ltl : 8 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/LTLCardinality13683037138715402913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6823090735915624061.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11)...96842
Formula 0 simplified : GF((!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...96838

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-COL-AN15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532500523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN15.tgz
mv Sudoku-COL-AN15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;