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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.2K Apr 12 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 10:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 10:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 10:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 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-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717032125173

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-AN10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-30 01:22:06] [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 01:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:22:06] [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 01:22:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 01:22:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2024-05-30 01:22:07] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 01:22:07] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-30 01:22:07] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-09 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).
RANDOM walk for 40388 steps (392 resets) in 140 ms. (286 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40388 steps (392 resets) in 38 ms. (1035 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40388 steps (392 resets) in 42 ms. (939 steps per ms) remains 2/2 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 01:22:07] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:22:07] [INFO ] Flatten gal took : 28 ms
[2024-05-30 01:22:07] [INFO ] Flatten gal took : 1 ms
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2024-05-30 01:22:07] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 37 ms.
[2024-05-30 01:22:07] [INFO ] Unfolded 10 HLPN properties in 4 ms.
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 01:22:08] [INFO ] Computed 300 invariants in 44 ms
[2024-05-30 01:22:08] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-30 01:22:08] [INFO ] Invariant cache hit.
[2024-05-30 01:22:09] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1424 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 1460 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2024-05-30 01:22:09] [INFO ] Flatten gal took : 129 ms
[2024-05-30 01:22:10] [INFO ] Flatten gal took : 98 ms
[2024-05-30 01:22:10] [INFO ] Input system was already deterministic with 1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 4752 ms. (8 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1136 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
[2024-05-30 01:22:12] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4395 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1604 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 10154ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 6324 ms. (6 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 348625 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 348625 steps, saw 120190 distinct states, run finished after 6004 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 01:22:30] [INFO ] Computed 29 invariants in 47 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 329 constraints, problems are : Problem set: 0 solved, 4 unsolved in 520 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 333 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 45931ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 15 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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' '!(G((F(p0)&&(!p0 U p1))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 39 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 01:23:17] [INFO ] Computed 300 invariants in 8 ms
[2024-05-30 01:23:17] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-30 01:23:17] [INFO ] Invariant cache hit.
[2024-05-30 01:23:18] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2024-05-30 01:23:18] [INFO ] Redundant transitions in 55 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 1544 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-01
Product exploration timeout after 85390 steps with 1642 reset in 10001 ms.
Product exploration timeout after 85500 steps with 1644 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 207 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (457 resets) in 9794 ms. (4 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1716 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1371 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
[2024-05-30 01:24:57] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1602 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6645ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (457 resets) in 5542 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1363 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 296757 steps, run timeout after 6001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 296757 steps, saw 108632 distinct states, run finished after 6001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-30 01:25:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8762 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24450 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 33601ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:25:46] [INFO ] Invariant cache hit.
[2024-05-30 01:25:46] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-30 01:25:46] [INFO ] Invariant cache hit.
[2024-05-30 01:25:47] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2024-05-30 01:25:47] [INFO ] Redundant transitions in 12 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1494 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 397 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
[2024-05-30 01:25:48] [INFO ] Invariant cache hit.
[2024-05-30 01:25:54] [INFO ] [Real]Absence check using 300 positive place invariants in 121 ms returned sat
[2024-05-30 01:25:56] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2024-05-30 01:25:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:26:03] [INFO ] [Nat]Absence check using 300 positive place invariants in 2275 ms returned sat
[2024-05-30 01:26:11] [INFO ] [Nat]Absence check using state equation in 7341 ms returned sat
[2024-05-30 01:26:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 40 ms.
Could not prove EG (NOT p0)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:26:11] [INFO ] Invariant cache hit.
[2024-05-30 01:26:11] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-30 01:26:11] [INFO ] Invariant cache hit.
[2024-05-30 01:26:12] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2024-05-30 01:26:12] [INFO ] Redundant transitions in 10 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 1395 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (456 resets) in 5153 ms. (7 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 1/1 properties
[2024-05-30 01:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 200/1300 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 200/1300 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2089 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4815ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 5194 ms. (7 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 314618 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 314618 steps, saw 112669 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 01:27:04] [INFO ] Computed 29 invariants in 39 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/295 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/300 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/295 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/300 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1300 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21276 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21889ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:27:26] [INFO ] Invariant cache hit.
[2024-05-30 01:27:26] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-30 01:27:26] [INFO ] Invariant cache hit.
[2024-05-30 01:27:27] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2024-05-30 01:27:27] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1297 ms. Remains : 300/300 places, 1000/1000 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 01:27:28] [INFO ] Computed 300 invariants in 9 ms
[2024-05-30 01:27:34] [INFO ] [Real]Absence check using 300 positive place invariants in 114 ms returned sat
[2024-05-30 01:27:35] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2024-05-30 01:27:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:27:44] [INFO ] [Nat]Absence check using 300 positive place invariants in 3329 ms returned sat
[2024-05-30 01:27:46] [INFO ] [Nat]Absence check using state equation in 1975 ms returned sat
[2024-05-30 01:27:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-30 01:27:46] [INFO ] Added : 0 causal constraints over 0 iterations in 152 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration timeout after 88200 steps with 1696 reset in 10001 ms.
Product exploration timeout after 87170 steps with 1676 reset in 10002 ms.
Built C files in :
/tmp/ltsmin16945485647481892754
[2024-05-30 01:28:06] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:28:06] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:06] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:28:06] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:06] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:28:06] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:06] [INFO ] Built C files in 268ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16945485647481892754
Running compilation step : cd /tmp/ltsmin16945485647481892754;'/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/ltsmin16945485647481892754;'/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/ltsmin16945485647481892754;'/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 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:28:09] [INFO ] Invariant cache hit.
[2024-05-30 01:28:10] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-30 01:28:10] [INFO ] Invariant cache hit.
[2024-05-30 01:28:11] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2024-05-30 01:28:11] [INFO ] Redundant transitions in 13 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1353 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin16819099493721002662
[2024-05-30 01:28:11] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:28:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:11] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:28:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:11] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:28:11] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:28:11] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16819099493721002662
Running compilation step : cd /tmp/ltsmin16819099493721002662;'/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/ltsmin16819099493721002662;'/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/ltsmin16819099493721002662;'/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 01:28:14] [INFO ] Flatten gal took : 55 ms
[2024-05-30 01:28:14] [INFO ] Flatten gal took : 54 ms
[2024-05-30 01:28:14] [INFO ] Time to serialize gal into /tmp/LTL4410684336223572909.gal : 16 ms
[2024-05-30 01:28:14] [INFO ] Time to serialize properties into /tmp/LTL3808465090681678381.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/LTL4410684336223572909.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17799261963199901412.hoa' '-atoms' '/tmp/LTL3808465090681678381.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/LTL3808465090681678381.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17799261963199901412.hoa
Detected timeout of ITS tools.
[2024-05-30 01:28:29] [INFO ] Flatten gal took : 53 ms
[2024-05-30 01:28:29] [INFO ] Flatten gal took : 51 ms
[2024-05-30 01:28:29] [INFO ] Time to serialize gal into /tmp/LTL2014043708957791843.gal : 10 ms
[2024-05-30 01:28:30] [INFO ] Time to serialize properties into /tmp/LTL1716390237632290644.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/LTL2014043708957791843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1716390237632290644.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...27096
Formula 0 simplified : F(G!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...27091
Detected timeout of ITS tools.
[2024-05-30 01:28:45] [INFO ] Flatten gal took : 47 ms
[2024-05-30 01:28:45] [INFO ] Applying decomposition
[2024-05-30 01:28:45] [INFO ] Flatten gal took : 92 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/graph15606456404115538294.txt' '-o' '/tmp/graph15606456404115538294.bin' '-w' '/tmp/graph15606456404115538294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15606456404115538294.bin' '-l' '-1' '-v' '-w' '/tmp/graph15606456404115538294.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:28:48] [INFO ] Decomposing Gal with order
[2024-05-30 01:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:28:49] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-30 01:28:50] [INFO ] Flatten gal took : 1461 ms
[2024-05-30 01:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 122 ms.
[2024-05-30 01:28:50] [INFO ] Time to serialize gal into /tmp/LTL9724923460732137820.gal : 30 ms
[2024-05-30 01:28:50] [INFO ] Time to serialize properties into /tmp/LTL11991459763442188963.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/LTL9724923460732137820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11991459763442188963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0....36296
Formula 0 simplified : F(G!"(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Bo...36291
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN10-LTLCardinality-01 finished in 348189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(!p1))||G(p2)))))'
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:29:05] [INFO ] Invariant cache hit.
[2024-05-30 01:29:05] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-30 01:29:05] [INFO ] Invariant cache hit.
[2024-05-30 01:29:06] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-30 01:29:06] [INFO ] Redundant transitions in 12 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1173 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-03
Product exploration explored 100000 steps with 1147 reset in 8611 ms.
Product exploration explored 100000 steps with 1147 reset in 8633 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 760 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (458 resets) in 5975 ms. (6 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2577 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 3/3 properties
[2024-05-30 01:30:29] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/2300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1600 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2922 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1200 variables, 200/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1200 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/1300 variables, 100/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1000/2300 variables, 1300/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1602 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3009 ms.
Refiners :[Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6299ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.2 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 3914 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 212646 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 212646 steps, saw 95062 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 01:30:39] [INFO ] Computed 29 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/300 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 329 constraints, problems are : Problem set: 0 solved, 2 unsolved in 506 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 100/300 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1000/1300 variables, 300/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18601 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 19204ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:30:58] [INFO ] Invariant cache hit.
[2024-05-30 01:30:58] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-30 01:30:58] [INFO ] Invariant cache hit.
[2024-05-30 01:30:59] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-05-30 01:30:59] [INFO ] Redundant transitions in 10 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 733 ms. Remains : 300/300 places, 1000/1000 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLCardinality-03 finished in 114110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 01:30:59] [INFO ] Computed 300 invariants in 3 ms
[2024-05-30 01:30:59] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-30 01:30:59] [INFO ] Invariant cache hit.
[2024-05-30 01:31:00] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1276 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 1280 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-04
Product exploration timeout after 69710 steps with 1366 reset in 10001 ms.
Product exploration timeout after 68810 steps with 1349 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 747 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 204 steps (0 resets) in 59 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 1416 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-05-30 01:32:49] [INFO ] Invariant cache hit.
[2024-05-30 01:32:58] [INFO ] [Real]Absence check using 300 positive place invariants in 160 ms returned sat
[2024-05-30 01:32:59] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2024-05-30 01:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:33:09] [INFO ] [Nat]Absence check using 300 positive place invariants in 2584 ms returned sat
[2024-05-30 01:33:14] [INFO ] [Nat]Absence check using state equation in 4660 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:33:14] [INFO ] Invariant cache hit.
[2024-05-30 01:33:14] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-30 01:33:14] [INFO ] Invariant cache hit.
[2024-05-30 01:33:15] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1245 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 1250 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 204 steps (0 resets) in 107 ms. (1 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-30 01:33:16] [INFO ] Invariant cache hit.
[2024-05-30 01:33:25] [INFO ] [Real]Absence check using 300 positive place invariants in 159 ms returned sat
[2024-05-30 01:33:26] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2024-05-30 01:33:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:33:36] [INFO ] [Nat]Absence check using 300 positive place invariants in 2843 ms returned sat
[2024-05-30 01:33:41] [INFO ] [Nat]Absence check using state equation in 4394 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 71910 steps with 1410 reset in 10001 ms.
Product exploration timeout after 71420 steps with 1400 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:34:01] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin18151084819459938688
[2024-05-30 01:34:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18151084819459938688
Running compilation step : cd /tmp/ltsmin18151084819459938688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2724 ms.
Running link step : cd /tmp/ltsmin18151084819459938688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin18151084819459938688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15352076345008425360.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:34:17] [INFO ] Invariant cache hit.
[2024-05-30 01:34:17] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-30 01:34:17] [INFO ] Invariant cache hit.
[2024-05-30 01:34:18] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1250 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 1260 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin7709479828992460774
[2024-05-30 01:34:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7709479828992460774
Running compilation step : cd /tmp/ltsmin7709479828992460774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2742 ms.
Running link step : cd /tmp/ltsmin7709479828992460774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7709479828992460774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7142825571691710147.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 01:34:33] [INFO ] Flatten gal took : 65 ms
[2024-05-30 01:34:33] [INFO ] Flatten gal took : 63 ms
[2024-05-30 01:34:33] [INFO ] Time to serialize gal into /tmp/LTL15967466411030589485.gal : 5 ms
[2024-05-30 01:34:33] [INFO ] Time to serialize properties into /tmp/LTL18003580867524558133.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/LTL15967466411030589485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12296457697334582857.hoa' '-atoms' '/tmp/LTL18003580867524558133.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/LTL18003580867524558133.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12296457697334582857.hoa
Detected timeout of ITS tools.
[2024-05-30 01:34:48] [INFO ] Flatten gal took : 44 ms
[2024-05-30 01:34:48] [INFO ] Flatten gal took : 43 ms
[2024-05-30 01:34:48] [INFO ] Time to serialize gal into /tmp/LTL2307012484682637956.gal : 20 ms
[2024-05-30 01:34:48] [INFO ] Time to serialize properties into /tmp/LTL10048056518179874566.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/LTL2307012484682637956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10048056518179874566.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+...40691
Formula 0 simplified : XX(G!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...40679
Detected timeout of ITS tools.
[2024-05-30 01:35:04] [INFO ] Flatten gal took : 43 ms
[2024-05-30 01:35:04] [INFO ] Applying decomposition
[2024-05-30 01:35:04] [INFO ] Flatten gal took : 41 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/graph5743872283583400866.txt' '-o' '/tmp/graph5743872283583400866.bin' '-w' '/tmp/graph5743872283583400866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5743872283583400866.bin' '-l' '-1' '-v' '-w' '/tmp/graph5743872283583400866.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:35:07] [INFO ] Decomposing Gal with order
[2024-05-30 01:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:35:08] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 01:35:09] [INFO ] Flatten gal took : 998 ms
[2024-05-30 01:35:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-30 01:35:09] [INFO ] Time to serialize gal into /tmp/LTL1815709655282546939.gal : 12 ms
[2024-05-30 01:35:09] [INFO ] Time to serialize properties into /tmp/LTL2871146232059832885.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1815709655282546939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2871146232059832885.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(X((F("((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Colum...66691
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_...66679
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN10-LTLCardinality-04 finished in 265229 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)))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 32 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 01:35:24] [INFO ] Computed 29 invariants in 14 ms
[2024-05-30 01:35:25] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-30 01:35:25] [INFO ] Invariant cache hit.
[2024-05-30 01:35:25] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1080 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-06 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 7 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:35:26] [INFO ] Invariant cache hit.
[2024-05-30 01:35:26] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-30 01:35:26] [INFO ] Invariant cache hit.
[2024-05-30 01:35:26] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-07
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-07 finished in 1157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F((p1&&X(p1))))))))'
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 01:35:27] [INFO ] Computed 300 invariants in 4 ms
[2024-05-30 01:35:27] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-30 01:35:27] [INFO ] Invariant cache hit.
[2024-05-30 01:35:29] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1847 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 1864 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-10
Product exploration timeout after 60440 steps with 12073 reset in 10002 ms.
Product exploration timeout after 60190 steps with 12013 reset in 10003 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
[2024-05-30 01:37:31] [INFO ] Invariant cache hit.
[2024-05-30 01:37:37] [INFO ] [Real]Absence check using 300 positive place invariants in 99 ms returned sat
[2024-05-30 01:37:37] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-30 01:37:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-30 01:37:38] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:37:38] [INFO ] Invariant cache hit.
[2024-05-30 01:37:38] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-30 01:37:38] [INFO ] Invariant cache hit.
[2024-05-30 01:37:40] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2024-05-30 01:37:40] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1904 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
[2024-05-30 01:38:01] [INFO ] Invariant cache hit.
[2024-05-30 01:38:06] [INFO ] [Real]Absence check using 300 positive place invariants in 107 ms returned sat
[2024-05-30 01:38:07] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-30 01:38:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-30 01:38:07] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1147 reset in 9889 ms.
Product exploration explored 100000 steps with 1147 reset in 9783 ms.
Built C files in :
/tmp/ltsmin4404539031080027299
[2024-05-30 01:38:27] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:38:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:27] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:38:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:27] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:38:27] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:27] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4404539031080027299
Running compilation step : cd /tmp/ltsmin4404539031080027299;'/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/ltsmin4404539031080027299;'/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/ltsmin4404539031080027299;'/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 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:38:30] [INFO ] Invariant cache hit.
[2024-05-30 01:38:30] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-30 01:38:30] [INFO ] Invariant cache hit.
[2024-05-30 01:38:32] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2024-05-30 01:38:32] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1907 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin592791393683507196
[2024-05-30 01:38:32] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:38:32] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:32] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:38:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:32] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:38:32] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:38:32] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin592791393683507196
Running compilation step : cd /tmp/ltsmin592791393683507196;'/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/ltsmin592791393683507196;'/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/ltsmin592791393683507196;'/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 01:38:35] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:38:35] [INFO ] Flatten gal took : 45 ms
[2024-05-30 01:38:35] [INFO ] Time to serialize gal into /tmp/LTL11046869741545437720.gal : 5 ms
[2024-05-30 01:38:35] [INFO ] Time to serialize properties into /tmp/LTL16575591849019052339.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11046869741545437720.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1203828912200636733.hoa' '-atoms' '/tmp/LTL16575591849019052339.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/LTL16575591849019052339.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1203828912200636733.hoa
Detected timeout of ITS tools.
[2024-05-30 01:38:50] [INFO ] Flatten gal took : 37 ms
[2024-05-30 01:38:51] [INFO ] Flatten gal took : 38 ms
[2024-05-30 01:38:51] [INFO ] Time to serialize gal into /tmp/LTL11658783868947462846.gal : 13 ms
[2024-05-30 01:38:51] [INFO ] Time to serialize properties into /tmp/LTL5488280476132323314.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/LTL11658783868947462846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5488280476132323314.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Boar...47629
Formula 0 simplified : XX(!"((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))...47617
Detected timeout of ITS tools.
[2024-05-30 01:39:06] [INFO ] Flatten gal took : 37 ms
[2024-05-30 01:39:06] [INFO ] Applying decomposition
[2024-05-30 01:39:06] [INFO ] Flatten gal took : 38 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/graph4318777240110357466.txt' '-o' '/tmp/graph4318777240110357466.bin' '-w' '/tmp/graph4318777240110357466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4318777240110357466.bin' '-l' '-1' '-v' '-w' '/tmp/graph4318777240110357466.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:39:10] [INFO ] Decomposing Gal with order
[2024-05-30 01:39:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:39:10] [INFO ] Removed a total of 1895 redundant transitions.
[2024-05-30 01:39:10] [INFO ] Flatten gal took : 461 ms
[2024-05-30 01:39:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 270 ms.
[2024-05-30 01:39:11] [INFO ] Time to serialize gal into /tmp/LTL16365740139154600356.gal : 147 ms
[2024-05-30 01:39:11] [INFO ] Time to serialize properties into /tmp/LTL9088321568658174559.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/LTL16365740139154600356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9088321568658174559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F(("(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+((...63629
Formula 0 simplified : XX(!"((((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.B...63617
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN10-LTLCardinality-10 finished in 239304 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(p1)||p0))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:39:26] [INFO ] Invariant cache hit.
[2024-05-30 01:39:26] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-30 01:39:26] [INFO ] Invariant cache hit.
[2024-05-30 01:39:27] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2024-05-30 01:39:27] [INFO ] Redundant transitions in 17 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1300 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-12
Product exploration timeout after 87930 steps with 3647 reset in 10001 ms.
Product exploration timeout after 87200 steps with 3632 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (457 resets) in 4784 ms. (8 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2408 ms. (16 steps per ms) remains 1/1 properties
[2024-05-30 01:41:56] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1200/2300 variables, and 200 constraints, problems are : Problem set: 1 solved, 0 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 200/300 constraints, State Equation: 0/1300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1232ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-30 01:41:58] [INFO ] Invariant cache hit.
[2024-05-30 01:42:07] [INFO ] [Real]Absence check using 300 positive place invariants in 105 ms returned sat
[2024-05-30 01:42:08] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-05-30 01:42:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:42:17] [INFO ] [Nat]Absence check using 300 positive place invariants in 259 ms returned sat
[2024-05-30 01:42:19] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2024-05-30 01:42:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-30 01:42:19] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1100 out of 1300 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 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:42:19] [INFO ] Invariant cache hit.
[2024-05-30 01:42:20] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-30 01:42:20] [INFO ] Invariant cache hit.
[2024-05-30 01:42:20] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2024-05-30 01:42:21] [INFO ] Redundant transitions in 14 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 1367 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 119 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-30 01:43:00] [INFO ] Invariant cache hit.
[2024-05-30 01:43:09] [INFO ] [Real]Absence check using 300 positive place invariants in 105 ms returned sat
[2024-05-30 01:43:10] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2024-05-30 01:43:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:43:19] [INFO ] [Nat]Absence check using 300 positive place invariants in 261 ms returned sat
[2024-05-30 01:43:21] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2024-05-30 01:43:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-30 01:43:21] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4128 reset in 9878 ms.
Product exploration explored 100000 steps with 4217 reset in 9986 ms.
Built C files in :
/tmp/ltsmin6592766589208301306
[2024-05-30 01:43:41] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:43:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:41] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:43:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:41] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:43:41] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:41] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6592766589208301306
Running compilation step : cd /tmp/ltsmin6592766589208301306;'/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/ltsmin6592766589208301306;'/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/ltsmin6592766589208301306;'/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 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:43:44] [INFO ] Invariant cache hit.
[2024-05-30 01:43:45] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-30 01:43:45] [INFO ] Invariant cache hit.
[2024-05-30 01:43:46] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-05-30 01:43:46] [INFO ] Redundant transitions in 13 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1604 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin10938897655170060340
[2024-05-30 01:43:46] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:43:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:46] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:43:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:46] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:43:46] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:43:46] [INFO ] Built C files in 210ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10938897655170060340
Running compilation step : cd /tmp/ltsmin10938897655170060340;'/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/ltsmin10938897655170060340;'/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/ltsmin10938897655170060340;'/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 01:43:49] [INFO ] Flatten gal took : 57 ms
[2024-05-30 01:43:49] [INFO ] Flatten gal took : 37 ms
[2024-05-30 01:43:49] [INFO ] Time to serialize gal into /tmp/LTL7640987932429060785.gal : 5 ms
[2024-05-30 01:43:49] [INFO ] Time to serialize properties into /tmp/LTL1211384020777371.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/LTL7640987932429060785.gal' '-t' 'CGAL' '-hoa' '/tmp/aut806014261003841935.hoa' '-atoms' '/tmp/LTL1211384020777371.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...313
Loading property file /tmp/LTL1211384020777371.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut806014261003841935.hoa
Detected timeout of ITS tools.
[2024-05-30 01:44:04] [INFO ] Flatten gal took : 36 ms
[2024-05-30 01:44:04] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:44:04] [INFO ] Time to serialize gal into /tmp/LTL486032629481778938.gal : 5 ms
[2024-05-30 01:44:04] [INFO ] Time to serialize properties into /tmp/LTL5569423521444484023.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/LTL486032629481778938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5569423521444484023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(...37997
Formula 0 simplified : G(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+Rows_...37990
Detected timeout of ITS tools.
[2024-05-30 01:44:19] [INFO ] Flatten gal took : 37 ms
[2024-05-30 01:44:19] [INFO ] Applying decomposition
[2024-05-30 01:44:19] [INFO ] Flatten gal took : 36 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/graph15394843372094928842.txt' '-o' '/tmp/graph15394843372094928842.bin' '-w' '/tmp/graph15394843372094928842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15394843372094928842.bin' '-l' '-1' '-v' '-w' '/tmp/graph15394843372094928842.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:44:23] [INFO ] Decomposing Gal with order
[2024-05-30 01:44:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:44:24] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 01:44:24] [INFO ] Flatten gal took : 621 ms
[2024-05-30 01:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 01:44:24] [INFO ] Time to serialize gal into /tmp/LTL2439856840998680516.gal : 6 ms
[2024-05-30 01:44:24] [INFO ] Time to serialize properties into /tmp/LTL13927066407904903366.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/LTL2439856840998680516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13927066407904903366.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Column...50797
Formula 0 simplified : G(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.Ro...50790
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN10-LTLCardinality-12 finished in 312833 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((X(G(!p0))&&G(p1))))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:44:39] [INFO ] Invariant cache hit.
[2024-05-30 01:44:39] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-30 01:44:39] [INFO ] Invariant cache hit.
[2024-05-30 01:44:40] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2024-05-30 01:44:40] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1585 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-13
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 14 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-13 finished in 1793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(p1&&X((!p2&&G(p3))))))&&F(!p0))))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:44:41] [INFO ] Invariant cache hit.
[2024-05-30 01:44:41] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-30 01:44:41] [INFO ] Invariant cache hit.
[2024-05-30 01:44:42] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1606 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 1619 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 418 ms :[p0, p0, true, (OR (NOT p3) p2), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), (NOT p3), (AND p0 (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-14 finished in 2075 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((p0&&F(!p1)))&&G(!p2)))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:44:43] [INFO ] Invariant cache hit.
[2024-05-30 01:44:43] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-30 01:44:43] [INFO ] Invariant cache hit.
[2024-05-30 01:44:44] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1256 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 1261 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND p0 p2), (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-15
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-15 finished in 1557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(!p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Found a Shortening insensitive property : Sudoku-COL-AN10-LTLCardinality-04
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:44:45] [INFO ] Invariant cache hit.
[2024-05-30 01:44:45] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-30 01:44:45] [INFO ] Invariant cache hit.
[2024-05-30 01:44:46] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1250 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 1266 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-04
Product exploration timeout after 71350 steps with 1399 reset in 10001 ms.
Product exploration timeout after 70840 steps with 1389 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 715 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 204 steps (0 resets) in 58 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 1367 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-05-30 01:46:32] [INFO ] Invariant cache hit.
[2024-05-30 01:46:41] [INFO ] [Real]Absence check using 300 positive place invariants in 162 ms returned sat
[2024-05-30 01:46:42] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2024-05-30 01:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:46:53] [INFO ] [Nat]Absence check using 300 positive place invariants in 2925 ms returned sat
[2024-05-30 01:46:57] [INFO ] [Nat]Absence check using state equation in 3743 ms returned sat
[2024-05-30 01:46:58] [INFO ] Deduced a trap composed of 11 places in 750 ms of which 52 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
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 01:46:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p2) (NOT p1))
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:46:58] [INFO ] Invariant cache hit.
[2024-05-30 01:46:58] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-30 01:46:58] [INFO ] Invariant cache hit.
[2024-05-30 01:46:59] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1313 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 1318 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 204 steps (0 resets) in 71 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-30 01:47:00] [INFO ] Invariant cache hit.
[2024-05-30 01:47:09] [INFO ] [Real]Absence check using 300 positive place invariants in 160 ms returned sat
[2024-05-30 01:47:10] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2024-05-30 01:47:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:47:20] [INFO ] [Nat]Absence check using 300 positive place invariants in 2658 ms returned sat
[2024-05-30 01:47:25] [INFO ] [Nat]Absence check using state equation in 4431 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 71930 steps with 1410 reset in 10001 ms.
Product exploration timeout after 71290 steps with 1397 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:47:45] [INFO ] Redundant transitions in 12 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin17118475971166532011
[2024-05-30 01:47:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17118475971166532011
Running compilation step : cd /tmp/ltsmin17118475971166532011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2666 ms.
Running link step : cd /tmp/ltsmin17118475971166532011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17118475971166532011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9012200153286152054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 01:48:00] [INFO ] Invariant cache hit.
[2024-05-30 01:48:01] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-30 01:48:01] [INFO ] Invariant cache hit.
[2024-05-30 01:48:02] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1159 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 1165 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin11648913293312017771
[2024-05-30 01:48:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11648913293312017771
Running compilation step : cd /tmp/ltsmin11648913293312017771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2684 ms.
Running link step : cd /tmp/ltsmin11648913293312017771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11648913293312017771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12048899142932051123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 01:48:17] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:48:17] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:48:17] [INFO ] Time to serialize gal into /tmp/LTL773383535721855286.gal : 5 ms
[2024-05-30 01:48:17] [INFO ] Time to serialize properties into /tmp/LTL12330959592370667225.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/LTL773383535721855286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5097874846335408893.hoa' '-atoms' '/tmp/LTL12330959592370667225.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL12330959592370667225.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5097874846335408893.hoa
Detected timeout of ITS tools.
[2024-05-30 01:48:32] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:48:32] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:48:32] [INFO ] Time to serialize gal into /tmp/LTL8977235889926345035.gal : 20 ms
[2024-05-30 01:48:32] [INFO ] Time to serialize properties into /tmp/LTL11728401935212777652.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/LTL8977235889926345035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11728401935212777652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+...40691
Formula 0 simplified : XX(G!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...40679
Detected timeout of ITS tools.
[2024-05-30 01:48:47] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:48:47] [INFO ] Applying decomposition
[2024-05-30 01:48:47] [INFO ] Flatten gal took : 35 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/graph15149340764269183721.txt' '-o' '/tmp/graph15149340764269183721.bin' '-w' '/tmp/graph15149340764269183721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15149340764269183721.bin' '-l' '-1' '-v' '-w' '/tmp/graph15149340764269183721.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:48:51] [INFO ] Decomposing Gal with order
[2024-05-30 01:48:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:48:52] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 01:48:52] [INFO ] Flatten gal took : 685 ms
[2024-05-30 01:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 01:48:52] [INFO ] Time to serialize gal into /tmp/LTL13584631035378031525.gal : 37 ms
[2024-05-30 01:48:52] [INFO ] Time to serialize properties into /tmp/LTL13532228142460907336.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/LTL13584631035378031525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13532228142460907336.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(X((F("((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Colum...66691
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_...66679
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN10-LTLCardinality-04 finished in 262784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F((p1&&X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2024-05-30 01:49:07] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15728659076774250482
[2024-05-30 01:49:07] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 01:49:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:49:07] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 01:49:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:49:08] [INFO ] Applying decomposition
[2024-05-30 01:49:08] [INFO ] Flatten gal took : 86 ms
[2024-05-30 01:49:08] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 01:49:08] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:49:08] [INFO ] Built C files in 408ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15728659076774250482
Running compilation step : cd /tmp/ltsmin15728659076774250482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 6231 ms.
Running link step : cd /tmp/ltsmin15728659076774250482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin15728659076774250482;'/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))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
[2024-05-30 01:49:24] [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/graph14277855922021026391.txt' '-o' '/tmp/graph14277855922021026391.bin' '-w' '/tmp/graph14277855922021026391.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 01:49:24] [INFO ] Flatten gal took : 126 ms
[2024-05-30 01:49:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality1086658156224863238.gal : 14 ms
[2024-05-30 01:49:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality2967661488465195577.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/LTLCardinality1086658156224863238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2967661488465195577.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 : !((G((F("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...27096
Formula 0 simplified : F(G!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...27091
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15728659076774250482;'/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))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15728659076774250482;'/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(X((<>((LTLAPp2==true))&&((LTLAPp3==true)||<>(((LTLAPp4==true)||X((LTLAPp3==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15728659076774250482;'/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(X((<>((LTLAPp2==true))&&((LTLAPp3==true)||<>(((LTLAPp4==true)||X((LTLAPp3==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15728659076774250482;'/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(X(((LTLAPp5==true)&&[](<>(((LTLAPp6==true)&&X((LTLAPp6==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15728659076774250482;'/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(X(((LTLAPp5==true)&&[](<>(((LTLAPp6==true)&&X((LTLAPp6==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15728659076774250482;'/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' '[](<>(([]((LTLAPp8==true))||(LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15728659076774250482;'/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' '[](<>(([]((LTLAPp8==true))||(LTLAPp7==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin15728659076774250482;'/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))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-30 02:12:15] [INFO ] Applying decomposition
[2024-05-30 02:12:15] [INFO ] Flatten gal took : 106 ms
[2024-05-30 02:12:15] [INFO ] Decomposing Gal with order
[2024-05-30 02:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:12:15] [INFO ] Removed a total of 2310 redundant transitions.
[2024-05-30 02:12:15] [INFO ] Flatten gal took : 211 ms
[2024-05-30 02:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-30 02:12:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality7829526444366416549.gal : 20 ms
[2024-05-30 02:12:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality17651047157231864456.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/LTLCardinality7829526444366416549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17651047157231864456.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((G((F("(((((((((((gNNN0.Board_0+gNNN1.Board_1)+(gNNN2.Board_2+gNNN3.Board_3))+((gNNN4.Board_4+gNNN5.Board_5)+(gNNN6.Board_6+gNNN7.Bo...44646
Formula 0 simplified : F(G!"(((((((((((gNNN0.Board_0+gNNN1.Board_1)+(gNNN2.Board_2+gNNN3.Board_3))+((gNNN4.Board_4+gNNN5.Board_5)+(gNNN6.Board_6+gNNN7.Boar...44641

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

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