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.r417-tall-171690556200307.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 gold2023
Input is Sudoku-COL-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556200307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.1K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 11:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:46 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.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 12K Apr 12 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:44 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-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717136485903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN11
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 06:21:27] [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-31 06:21:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:21:27] [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-31 06:21:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:21:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 409 ms
[2024-05-31 06:21:27] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 06:21:28] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-31 06:21:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-13 TRUE 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 14 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).
Incomplete random walk after 10085 steps, including 81 resets, run finished after 39 ms. (steps per millisecond=258 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=672 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=720 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=775 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 12 ms. (steps per millisecond=840 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=916 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=916 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 8 ms. (steps per millisecond=1260 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:21:28] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 06:21:28] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 06:21:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:21:28] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2024-05-31 06:21:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-31 06:21:28] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 6 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 3/4 places, 1/1 transitions.
Incomplete random walk after 10085 steps, including 81 resets, run finished after 5 ms. (steps per millisecond=2017 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 3 ms. (steps per millisecond=3361 ) properties (out of 1) seen :0
Finished probabilistic random walk after 120 steps, run visited all 1 properties in 11 ms. (steps per millisecond=10 )
Probabilistic random walk after 120 steps, saw 62 distinct states, run finished after 11 ms. (steps per millisecond=10 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:21:28] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-31 06:21:28] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:21:28] [INFO ] Flatten gal took : 1 ms
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2024-05-31 06:21:28] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 25 ms.
[2024-05-31 06:21:28] [INFO ] Unfolded 10 HLPN properties in 2 ms.
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:21:28] [INFO ] Computed 363 invariants in 37 ms
[2024-05-31 06:21:28] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-31 06:21:28] [INFO ] Invariant cache hit.
[2024-05-31 06:21:29] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2024-05-31 06:21:29] [INFO ] Invariant cache hit.
[2024-05-31 06:21:30] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1837 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2024-05-31 06:21:30] [INFO ] Flatten gal took : 143 ms
[2024-05-31 06:21:30] [INFO ] Flatten gal took : 112 ms
[2024-05-31 06:21:31] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1481 ms. (steps per millisecond=6 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 06:21:33] [INFO ] Invariant cache hit.
[2024-05-31 06:21:34] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 06:21:34] [INFO ] [Nat]Absence check using 363 positive place invariants in 76 ms returned sat
[2024-05-31 06:21:37] [INFO ] After 1063ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-31 06:21:37] [INFO ] After 1738ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 362 ms.
[2024-05-31 06:21:38] [INFO ] After 4143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 6 properties in 12 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.4 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257327 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257327 steps, saw 128977 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 06:21:42] [INFO ] Computed 32 invariants in 63 ms
[2024-05-31 06:21:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 06:21:42] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:21:43] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 06:21:43] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:21:43] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-31 06:21:43] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 4 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 32 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:21:43] [INFO ] Computed 363 invariants in 8 ms
[2024-05-31 06:21:44] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 06:21:44] [INFO ] Invariant cache hit.
[2024-05-31 06:21:45] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2024-05-31 06:21:45] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-31 06:21:45] [INFO ] Invariant cache hit.
[2024-05-31 06:21:46] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2425 ms. Remains : 1694/1694 places, 1331/1331 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 81510 steps with 772 reset in 10001 ms.
Product exploration timeout after 80600 steps with 763 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 141 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 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 898 ms. (steps per millisecond=11 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:23:53] [INFO ] Invariant cache hit.
[2024-05-31 06:23:53] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:23:54] [INFO ] [Nat]Absence check using 363 positive place invariants in 78 ms returned sat
[2024-05-31 06:23:54] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-31 06:23:54] [INFO ] Invariant cache hit.
[2024-05-31 06:24:03] [INFO ] [Real]Absence check using 363 positive place invariants in 163 ms returned sat
[2024-05-31 06:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:24:05] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2024-05-31 06:24:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:24:18] [INFO ] [Nat]Absence check using 363 positive place invariants in 4686 ms returned sat
[2024-05-31 06:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:24:20] [INFO ] [Nat]Absence check using state equation in 1747 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 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 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:24:20] [INFO ] Invariant cache hit.
[2024-05-31 06:24:20] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-31 06:24:20] [INFO ] Invariant cache hit.
[2024-05-31 06:24:21] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2024-05-31 06:24:21] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 06:24:21] [INFO ] Invariant cache hit.
[2024-05-31 06:24:22] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2208 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-31 06:25:17] [INFO ] Invariant cache hit.
[2024-05-31 06:25:26] [INFO ] [Real]Absence check using 363 positive place invariants in 150 ms returned sat
[2024-05-31 06:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:25:27] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2024-05-31 06:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:25:40] [INFO ] [Nat]Absence check using 363 positive place invariants in 4272 ms returned sat
[2024-05-31 06:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:25:42] [INFO ] [Nat]Absence check using state equation in 2231 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 64410 steps with 1038 reset in 10001 ms.
Product exploration timeout after 64360 steps with 1038 reset in 10001 ms.
Built C files in :
/tmp/ltsmin4900458199948115007
[2024-05-31 06:26:02] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:26:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:02] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:26:02] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:02] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:26:03] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:03] [INFO ] Built C files in 391ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4900458199948115007
Running compilation step : cd /tmp/ltsmin4900458199948115007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4900458199948115007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4900458199948115007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:26:06] [INFO ] Invariant cache hit.
[2024-05-31 06:26:06] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-31 06:26:06] [INFO ] Invariant cache hit.
[2024-05-31 06:26:08] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2024-05-31 06:26:08] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-31 06:26:08] [INFO ] Invariant cache hit.
[2024-05-31 06:26:08] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2790 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin4121834061922031312
[2024-05-31 06:26:08] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:26:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:08] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:26:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:09] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:26:09] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:26:09] [INFO ] Built C files in 348ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4121834061922031312
Running compilation step : cd /tmp/ltsmin4121834061922031312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4121834061922031312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4121834061922031312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:26:12] [INFO ] Flatten gal took : 77 ms
[2024-05-31 06:26:12] [INFO ] Flatten gal took : 73 ms
[2024-05-31 06:26:12] [INFO ] Time to serialize gal into /tmp/LTL11724548631024300453.gal : 15 ms
[2024-05-31 06:26:12] [INFO ] Time to serialize properties into /tmp/LTL6772122402410242217.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11724548631024300453.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8918128504288282717.hoa' '-atoms' '/tmp/LTL6772122402410242217.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6772122402410242217.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8918128504288282717.hoa
Detected timeout of ITS tools.
[2024-05-31 06:26:27] [INFO ] Flatten gal took : 77 ms
[2024-05-31 06:26:27] [INFO ] Flatten gal took : 65 ms
[2024-05-31 06:26:27] [INFO ] Time to serialize gal into /tmp/LTL15135451980323035790.gal : 10 ms
[2024-05-31 06:26:27] [INFO ] Time to serialize properties into /tmp/LTL12154740782228793221.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15135451980323035790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12154740782228793221.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...20136
Formula 0 simplified : G(!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...20130
Detected timeout of ITS tools.
[2024-05-31 06:26:43] [INFO ] Flatten gal took : 68 ms
[2024-05-31 06:26:43] [INFO ] Applying decomposition
[2024-05-31 06:26:43] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2420290417503204400.txt' '-o' '/tmp/graph2420290417503204400.bin' '-w' '/tmp/graph2420290417503204400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2420290417503204400.bin' '-l' '-1' '-v' '-w' '/tmp/graph2420290417503204400.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:26:45] [INFO ] Decomposing Gal with order
[2024-05-31 06:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:26:48] [INFO ] Flatten gal took : 2133 ms
[2024-05-31 06:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-31 06:26:48] [INFO ] Time to serialize gal into /tmp/LTL13689927008619482670.gal : 17 ms
[2024-05-31 06:26:48] [INFO ] Time to serialize properties into /tmp/LTL9203164078597009994.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13689927008619482670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9203164078597009994.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells...26912
Formula 0 simplified : G(!"((((((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells_...26906
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11653896525922249715
[2024-05-31 06:27:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11653896525922249715
Running compilation step : cd /tmp/ltsmin11653896525922249715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2983 ms.
Running link step : cd /tmp/ltsmin11653896525922249715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11653896525922249715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-00 finished in 334733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 22 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:27:18] [INFO ] Invariant cache hit.
[2024-05-31 06:27:18] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-31 06:27:18] [INFO ] Invariant cache hit.
[2024-05-31 06:27:20] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2024-05-31 06:27:20] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-31 06:27:20] [INFO ] Invariant cache hit.
[2024-05-31 06:27:20] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2234 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 61950 steps with 999 reset in 10003 ms.
Product exploration timeout after 61280 steps with 988 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 133 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 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:28:44] [INFO ] Invariant cache hit.
[2024-05-31 06:28:45] [INFO ] [Real]Absence check using 363 positive place invariants in 80 ms returned sat
[2024-05-31 06:28:45] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:28:45] [INFO ] [Nat]Absence check using 363 positive place invariants in 77 ms returned sat
[2024-05-31 06:28:47] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:28:47] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-31 06:28:47] [INFO ] After 1908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 184 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 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 06:28:48] [INFO ] Invariant cache hit.
[2024-05-31 06:28:57] [INFO ] [Real]Absence check using 363 positive place invariants in 174 ms returned sat
[2024-05-31 06:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:28:59] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2024-05-31 06:28:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:29:14] [INFO ] [Nat]Absence check using 363 positive place invariants in 5662 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:29:14] [INFO ] Invariant cache hit.
[2024-05-31 06:29:14] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-31 06:29:14] [INFO ] Invariant cache hit.
[2024-05-31 06:29:15] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2024-05-31 06:29:15] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-31 06:29:15] [INFO ] Invariant cache hit.
[2024-05-31 06:29:16] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2201 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 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 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 821 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:30:20] [INFO ] Invariant cache hit.
[2024-05-31 06:30:20] [INFO ] [Real]Absence check using 363 positive place invariants in 79 ms returned sat
[2024-05-31 06:30:21] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:30:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 74 ms returned sat
[2024-05-31 06:30:23] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:30:23] [INFO ] After 838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-31 06:30:23] [INFO ] After 1936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 212 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 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 06:30:23] [INFO ] Invariant cache hit.
[2024-05-31 06:30:33] [INFO ] [Real]Absence check using 363 positive place invariants in 172 ms returned sat
[2024-05-31 06:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:30:34] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2024-05-31 06:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:30:50] [INFO ] [Nat]Absence check using 363 positive place invariants in 5666 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 61200 steps with 987 reset in 10002 ms.
Product exploration timeout after 61090 steps with 985 reset in 10001 ms.
Built C files in :
/tmp/ltsmin2296615197808490901
[2024-05-31 06:31:10] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:31:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:10] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:31:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:10] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:31:10] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:10] [INFO ] Built C files in 345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2296615197808490901
Running compilation step : cd /tmp/ltsmin2296615197808490901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2296615197808490901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2296615197808490901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:31:13] [INFO ] Invariant cache hit.
[2024-05-31 06:31:13] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-31 06:31:13] [INFO ] Invariant cache hit.
[2024-05-31 06:31:15] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2024-05-31 06:31:15] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-31 06:31:15] [INFO ] Invariant cache hit.
[2024-05-31 06:31:15] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2208 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin1544867495250370055
[2024-05-31 06:31:15] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:31:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:15] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:31:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:16] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:31:16] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:31:16] [INFO ] Built C files in 343ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1544867495250370055
Running compilation step : cd /tmp/ltsmin1544867495250370055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1544867495250370055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1544867495250370055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:31:19] [INFO ] Flatten gal took : 85 ms
[2024-05-31 06:31:19] [INFO ] Flatten gal took : 84 ms
[2024-05-31 06:31:19] [INFO ] Time to serialize gal into /tmp/LTL15865660021328494857.gal : 7 ms
[2024-05-31 06:31:19] [INFO ] Time to serialize properties into /tmp/LTL1198535081278607415.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15865660021328494857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12102580507295485000.hoa' '-atoms' '/tmp/LTL1198535081278607415.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1198535081278607415.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12102580507295485000.hoa
Detected timeout of ITS tools.
[2024-05-31 06:31:34] [INFO ] Flatten gal took : 57 ms
[2024-05-31 06:31:34] [INFO ] Flatten gal took : 55 ms
[2024-05-31 06:31:34] [INFO ] Time to serialize gal into /tmp/LTL6196905151707229468.gal : 9 ms
[2024-05-31 06:31:34] [INFO ] Time to serialize properties into /tmp/LTL11017800210133927825.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6196905151707229468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11017800210133927825.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((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+Ro...20149
Formula 0 simplified : F(G!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...20141
Detected timeout of ITS tools.
[2024-05-31 06:31:49] [INFO ] Flatten gal took : 56 ms
[2024-05-31 06:31:49] [INFO ] Applying decomposition
[2024-05-31 06:31:49] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11495784673085123368.txt' '-o' '/tmp/graph11495784673085123368.bin' '-w' '/tmp/graph11495784673085123368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11495784673085123368.bin' '-l' '-1' '-v' '-w' '/tmp/graph11495784673085123368.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:31:52] [INFO ] Decomposing Gal with order
[2024-05-31 06:31:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:31:53] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-31 06:31:53] [INFO ] Flatten gal took : 1423 ms
[2024-05-31 06:31:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-31 06:31:53] [INFO ] Time to serialize gal into /tmp/LTL16190780294244354133.gal : 9 ms
[2024-05-31 06:31:53] [INFO ] Time to serialize properties into /tmp/LTL13445676141248067858.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16190780294244354133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13445676141248067858.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((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...26925
Formula 0 simplified : F(G!"(((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...26917
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin914957585056427176
[2024-05-31 06:32:08] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin914957585056427176
Running compilation step : cd /tmp/ltsmin914957585056427176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2931 ms.
Running link step : cd /tmp/ltsmin914957585056427176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin914957585056427176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-03 finished in 305360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!p0) U X((p1 U X(p2))))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:32:23] [INFO ] Invariant cache hit.
[2024-05-31 06:32:24] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-31 06:32:24] [INFO ] Invariant cache hit.
[2024-05-31 06:32:25] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2024-05-31 06:32:25] [INFO ] Invariant cache hit.
[2024-05-31 06:32:25] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2110 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 689 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 5}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ (ADD s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 36400 steps with 9051 reset in 10002 ms.
Product exploration timeout after 36220 steps with 9036 reset in 10007 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1144 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2283 ms. (steps per millisecond=4 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 06:38:20] [INFO ] Invariant cache hit.
[2024-05-31 06:38:22] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 06:38:22] [INFO ] [Nat]Absence check using 363 positive place invariants in 75 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 06:38:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:38:47] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1839 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 147692 steps, run timeout after 9025 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 147692 steps, saw 97867 distinct states, run finished after 9026 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 06:38:59] [INFO ] Invariant cache hit.
[2024-05-31 06:39:01] [INFO ] [Real]Absence check using 363 positive place invariants in 77 ms returned sat
[2024-05-31 06:39:01] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 06:39:02] [INFO ] [Nat]Absence check using 363 positive place invariants in 80 ms returned sat
[2024-05-31 06:39:03] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-31 06:39:04] [INFO ] After 1527ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 337 ms.
[2024-05-31 06:39:04] [INFO ] After 2789ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 4 properties in 21 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 22 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1324 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80619 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80619 steps, saw 63231 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:39:09] [INFO ] Invariant cache hit.
[2024-05-31 06:39:10] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:39:10] [INFO ] [Nat]Absence check using 363 positive place invariants in 81 ms returned sat
[2024-05-31 06:39:11] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:39:12] [INFO ] After 1202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-31 06:39:12] [INFO ] After 2262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 11 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 5840 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:39:18] [INFO ] Invariant cache hit.
[2024-05-31 06:39:19] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-31 06:39:19] [INFO ] Invariant cache hit.
[2024-05-31 06:39:20] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2024-05-31 06:39:20] [INFO ] Invariant cache hit.
[2024-05-31 06:39:20] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2157 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1504 ms. (steps per millisecond=6 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 06:41:10] [INFO ] Invariant cache hit.
[2024-05-31 06:41:10] [INFO ] [Real]Absence check using 363 positive place invariants in 76 ms returned sat
[2024-05-31 06:41:11] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 06:41:11] [INFO ] [Nat]Absence check using 363 positive place invariants in 77 ms returned sat
[2024-05-31 06:41:13] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 06:41:13] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-31 06:41:13] [INFO ] After 2317ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 19 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 1048 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 66740 steps with 631 reset in 10001 ms.
Product exploration timeout after 66630 steps with 630 reset in 10001 ms.
Built C files in :
/tmp/ltsmin2105009298298858766
[2024-05-31 06:41:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2105009298298858766
Running compilation step : cd /tmp/ltsmin2105009298298858766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2876 ms.
Running link step : cd /tmp/ltsmin2105009298298858766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2105009298298858766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased598765891162004444.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 7 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:41:50] [INFO ] Invariant cache hit.
[2024-05-31 06:41:51] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-31 06:41:51] [INFO ] Invariant cache hit.
[2024-05-31 06:41:52] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2024-05-31 06:41:52] [INFO ] Invariant cache hit.
[2024-05-31 06:41:52] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2057 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin7364738709971968012
[2024-05-31 06:41:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7364738709971968012
Running compilation step : cd /tmp/ltsmin7364738709971968012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2868 ms.
Running link step : cd /tmp/ltsmin7364738709971968012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7364738709971968012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6322969835603402472.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:42:08] [INFO ] Flatten gal took : 49 ms
[2024-05-31 06:42:08] [INFO ] Flatten gal took : 51 ms
[2024-05-31 06:42:08] [INFO ] Time to serialize gal into /tmp/LTL11704319283753796617.gal : 8 ms
[2024-05-31 06:42:08] [INFO ] Time to serialize properties into /tmp/LTL12506705784629484623.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11704319283753796617.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1071181702929017414.hoa' '-atoms' '/tmp/LTL12506705784629484623.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12506705784629484623.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1071181702929017414.hoa
Detected timeout of ITS tools.
[2024-05-31 06:42:23] [INFO ] Flatten gal took : 52 ms
[2024-05-31 06:42:23] [INFO ] Flatten gal took : 53 ms
[2024-05-31 06:42:23] [INFO ] Time to serialize gal into /tmp/LTL11232436154597692043.gal : 7 ms
[2024-05-31 06:42:23] [INFO ] Time to serialize properties into /tmp/LTL11174212758040508953.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11232436154597692043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11174212758040508953.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((G("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...36705
Formula 0 simplified : F(F!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...36697
Detected timeout of ITS tools.
[2024-05-31 06:42:38] [INFO ] Flatten gal took : 48 ms
[2024-05-31 06:42:38] [INFO ] Applying decomposition
[2024-05-31 06:42:38] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8572892850263136966.txt' '-o' '/tmp/graph8572892850263136966.bin' '-w' '/tmp/graph8572892850263136966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8572892850263136966.bin' '-l' '-1' '-v' '-w' '/tmp/graph8572892850263136966.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:42:42] [INFO ] Decomposing Gal with order
[2024-05-31 06:42:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:42:44] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-31 06:42:44] [INFO ] Flatten gal took : 1217 ms
[2024-05-31 06:42:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-31 06:42:44] [INFO ] Time to serialize gal into /tmp/LTL8720916939245714680.gal : 10 ms
[2024-05-31 06:42:44] [INFO ] Time to serialize properties into /tmp/LTL16616142507290183352.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8720916939245714680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16616142507290183352.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((G("((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cel...59937
Formula 0 simplified : F(F!"((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells...59929
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7295179981473871538
[2024-05-31 06:42:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7295179981473871538
Running compilation step : cd /tmp/ltsmin7295179981473871538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7295179981473871538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7295179981473871538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN11-LTLCardinality-04 finished in 638644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:43:02] [INFO ] Invariant cache hit.
[2024-05-31 06:43:03] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-31 06:43:03] [INFO ] Invariant cache hit.
[2024-05-31 06:43:04] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-05-31 06:43:04] [INFO ] Invariant cache hit.
[2024-05-31 06:43:05] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2606 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 67220 steps with 1784 reset in 10001 ms.
Product exploration timeout after 66520 steps with 1850 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 244 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1359 ms. (steps per millisecond=7 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 06:47:09] [INFO ] Invariant cache hit.
[2024-05-31 06:47:10] [INFO ] [Real]Absence check using 363 positive place invariants in 87 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 06:47:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:47:34] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1502 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 131278 steps, run timeout after 6056 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 131278 steps, saw 81476 distinct states, run finished after 6056 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 06:47:43] [INFO ] Invariant cache hit.
[2024-05-31 06:47:43] [INFO ] [Real]Absence check using 363 positive place invariants in 81 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 06:48:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:48:08] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:48:08] [INFO ] Invariant cache hit.
[2024-05-31 06:48:09] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-31 06:48:09] [INFO ] Invariant cache hit.
[2024-05-31 06:48:10] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2024-05-31 06:48:10] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-31 06:48:10] [INFO ] Invariant cache hit.
[2024-05-31 06:48:11] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2653 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 06:48:11] [INFO ] Invariant cache hit.
[2024-05-31 06:48:12] [INFO ] [Real]Absence check using 363 positive place invariants in 74 ms returned sat
[2024-05-31 06:49:56] [INFO ] After 104804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:49:56] [INFO ] [Nat]Absence check using 363 positive place invariants in 76 ms returned sat
[2024-05-31 06:50:03] [INFO ] After 6312ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 06:50:03] [INFO ] After 6523ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-31 06:50:03] [INFO ] After 7436ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 15 factoid took 498 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 10 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:50:05] [INFO ] Invariant cache hit.
[2024-05-31 06:50:05] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-31 06:50:05] [INFO ] Invariant cache hit.
[2024-05-31 06:50:06] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
[2024-05-31 06:50:06] [INFO ] Invariant cache hit.
[2024-05-31 06:50:07] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 822 ms. (steps per millisecond=12 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:51:47] [INFO ] Invariant cache hit.
[2024-05-31 06:51:47] [INFO ] [Real]Absence check using 363 positive place invariants in 82 ms returned sat
[2024-05-31 06:52:12] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235429 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235429 steps, saw 124543 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 06:52:16] [INFO ] Computed 32 invariants in 40 ms
[2024-05-31 06:52:16] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 06:52:17] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:52:17] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 06:52:17] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:52:17] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-31 06:52:17] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Product exploration timeout after 67890 steps with 642 reset in 10002 ms.
Product exploration timeout after 67320 steps with 636 reset in 10001 ms.
Applying partial POR strategy [true, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 49 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:52:39] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:52:39] [INFO ] Computed 363 invariants in 10 ms
[2024-05-31 06:52:40] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin11607587386185756286
[2024-05-31 06:52:40] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11607587386185756286
Running compilation step : cd /tmp/ltsmin11607587386185756286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2976 ms.
Running link step : cd /tmp/ltsmin11607587386185756286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11607587386185756286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8070272965721267544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 32 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:52:55] [INFO ] Invariant cache hit.
[2024-05-31 06:52:55] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-31 06:52:55] [INFO ] Invariant cache hit.
[2024-05-31 06:52:57] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2024-05-31 06:52:57] [INFO ] Invariant cache hit.
[2024-05-31 06:52:57] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2608 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin7153756222754569219
[2024-05-31 06:52:57] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7153756222754569219
Running compilation step : cd /tmp/ltsmin7153756222754569219;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2857 ms.
Running link step : cd /tmp/ltsmin7153756222754569219;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7153756222754569219;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8426017971285850219.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:53:12] [INFO ] Flatten gal took : 47 ms
[2024-05-31 06:53:12] [INFO ] Flatten gal took : 48 ms
[2024-05-31 06:53:12] [INFO ] Time to serialize gal into /tmp/LTL18201526807111116645.gal : 6 ms
[2024-05-31 06:53:12] [INFO ] Time to serialize properties into /tmp/LTL7292944762772647265.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18201526807111116645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1846729380409449914.hoa' '-atoms' '/tmp/LTL7292944762772647265.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7292944762772647265.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1846729380409449914.hoa
Detected timeout of ITS tools.
[2024-05-31 06:53:28] [INFO ] Flatten gal took : 50 ms
[2024-05-31 06:53:28] [INFO ] Flatten gal took : 63 ms
[2024-05-31 06:53:28] [INFO ] Time to serialize gal into /tmp/LTL13722063405921219114.gal : 7 ms
[2024-05-31 06:53:28] [INFO ] Time to serialize properties into /tmp/LTL17510680552367013760.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13722063405921219114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17510680552367013760.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...66071
Formula 0 simplified : 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_13...66062
Detected timeout of ITS tools.
[2024-05-31 06:53:43] [INFO ] Flatten gal took : 49 ms
[2024-05-31 06:53:43] [INFO ] Applying decomposition
[2024-05-31 06:53:43] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph640291735714738361.txt' '-o' '/tmp/graph640291735714738361.bin' '-w' '/tmp/graph640291735714738361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph640291735714738361.bin' '-l' '-1' '-v' '-w' '/tmp/graph640291735714738361.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:53:50] [INFO ] Decomposing Gal with order
[2024-05-31 06:53:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:53:51] [INFO ] Removed a total of 1210 redundant transitions.
[2024-05-31 06:53:51] [INFO ] Flatten gal took : 1092 ms
[2024-05-31 06:53:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 74 ms.
[2024-05-31 06:53:51] [INFO ] Time to serialize gal into /tmp/LTL14096524196646132173.gal : 6 ms
[2024-05-31 06:53:51] [INFO ] Time to serialize properties into /tmp/LTL7284059833613433341.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14096524196646132173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7284059833613433341.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...87851
Formula 0 simplified : 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.Rows...87842
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17697378104641909689
[2024-05-31 06:54:06] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17697378104641909689
Running compilation step : cd /tmp/ltsmin17697378104641909689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2836 ms.
Running link step : cd /tmp/ltsmin17697378104641909689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17697378104641909689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U ([](((LTLAPp1==true) U (X((LTLAPp1==true))||[](!(LTLAPp1==true))))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-05 finished in 679179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 12 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 06:54:21] [INFO ] Computed 32 invariants in 33 ms
[2024-05-31 06:54:21] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 06:54:21] [INFO ] Invariant cache hit.
[2024-05-31 06:54:22] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2024-05-31 06:54:22] [INFO ] Invariant cache hit.
[2024-05-31 06:54:23] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1403 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 79060 steps with 39530 reset in 10002 ms.
Product exploration timeout after 78230 steps with 39115 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN11-LTLCardinality-06 finished in 35290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:54:56] [INFO ] Computed 363 invariants in 11 ms
[2024-05-31 06:54:57] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-31 06:54:57] [INFO ] Invariant cache hit.
[2024-05-31 06:54:58] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2024-05-31 06:54:58] [INFO ] Invariant cache hit.
[2024-05-31 06:54:59] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2183 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 68230 steps with 34115 reset in 10001 ms.
Product exploration timeout after 67770 steps with 33885 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN11-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN11-LTLCardinality-08 finished in 81416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.4 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 52 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 06:56:18] [INFO ] Computed 32 invariants in 31 ms
[2024-05-31 06:56:18] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 06:56:18] [INFO ] Invariant cache hit.
[2024-05-31 06:56:19] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2024-05-31 06:56:19] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-31 06:56:19] [INFO ] Invariant cache hit.
[2024-05-31 06:56:20] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1794 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 14 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-10 finished in 2121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X(X(G(p1))))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:56:20] [INFO ] Computed 363 invariants in 9 ms
[2024-05-31 06:56:20] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-31 06:56:20] [INFO ] Invariant cache hit.
[2024-05-31 06:56:21] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2024-05-31 06:56:21] [INFO ] Invariant cache hit.
[2024-05-31 06:56:22] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2104 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-11 finished in 2227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(G(X(p0)))))&&X(X(X((X(!p0) U p1))))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 13 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 06:56:22] [INFO ] Computed 32 invariants in 29 ms
[2024-05-31 06:56:22] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 06:56:22] [INFO ] Invariant cache hit.
[2024-05-31 06:56:23] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2024-05-31 06:56:23] [INFO ] Invariant cache hit.
[2024-05-31 06:56:24] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1417 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 19 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-12 finished in 1699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(!p1)))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 12 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:56:24] [INFO ] Invariant cache hit.
[2024-05-31 06:56:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 06:56:24] [INFO ] Invariant cache hit.
[2024-05-31 06:56:25] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2024-05-31 06:56:25] [INFO ] Invariant cache hit.
[2024-05-31 06:56:25] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1459 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 210 ms :[p1, p1, p1]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 59270 steps with 19736 reset in 10001 ms.
Product exploration timeout after 58720 steps with 19531 reset in 10004 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 200 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1111 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 115391 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115391 steps, saw 68900 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 06:57:20] [INFO ] Invariant cache hit.
[2024-05-31 06:57:20] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-31 06:57:20] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 06:57:20] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 06:57:21] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 06:57:21] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-31 06:57:21] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 17 ms.
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 363/363 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 156538 steps, run timeout after 3003 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156538 steps, saw 106688 distinct states, run finished after 3003 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:57:25] [INFO ] Invariant cache hit.
[2024-05-31 06:57:25] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 06:57:26] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:57:26] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 06:57:26] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 06:57:26] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-31 06:57:26] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p1]
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:57:27] [INFO ] Invariant cache hit.
[2024-05-31 06:57:27] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 06:57:27] [INFO ] Invariant cache hit.
[2024-05-31 06:57:28] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2024-05-31 06:57:28] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 06:57:28] [INFO ] Invariant cache hit.
[2024-05-31 06:57:28] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1413 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 212 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1114 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 92874 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92874 steps, saw 66040 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 06:58:06] [INFO ] Invariant cache hit.
[2024-05-31 06:58:07] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 06:58:07] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 06:58:07] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 06:58:07] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 06:58:07] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-31 06:58:07] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 363/363 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 985 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 160754 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160754 steps, saw 109390 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:58:11] [INFO ] Invariant cache hit.
[2024-05-31 06:58:12] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 06:58:12] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:58:12] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 06:58:12] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 06:58:12] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-31 06:58:12] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 508 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 105 ms :[p1, p1, p1]
Product exploration timeout after 54710 steps with 18217 reset in 10003 ms.
Product exploration timeout after 54350 steps with 18135 reset in 10003 ms.
Built C files in :
/tmp/ltsmin3026498367161108797
[2024-05-31 06:58:33] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:58:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:33] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:58:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:34] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:58:34] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:34] [INFO ] Built C files in 303ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3026498367161108797
Running compilation step : cd /tmp/ltsmin3026498367161108797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3026498367161108797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3026498367161108797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 06:58:37] [INFO ] Invariant cache hit.
[2024-05-31 06:58:37] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-31 06:58:37] [INFO ] Invariant cache hit.
[2024-05-31 06:58:38] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2024-05-31 06:58:38] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 06:58:38] [INFO ] Invariant cache hit.
[2024-05-31 06:58:38] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1375 ms. Remains : 363/363 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin10525336269205596341
[2024-05-31 06:58:38] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 06:58:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:38] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 06:58:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:38] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 06:58:38] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:58:38] [INFO ] Built C files in 306ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10525336269205596341
Running compilation step : cd /tmp/ltsmin10525336269205596341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10525336269205596341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10525336269205596341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:58:41] [INFO ] Flatten gal took : 38 ms
[2024-05-31 06:58:41] [INFO ] Flatten gal took : 39 ms
[2024-05-31 06:58:41] [INFO ] Time to serialize gal into /tmp/LTL11353635925722170126.gal : 5 ms
[2024-05-31 06:58:41] [INFO ] Time to serialize properties into /tmp/LTL3758266444251976997.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11353635925722170126.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3509437562732805626.hoa' '-atoms' '/tmp/LTL3758266444251976997.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3758266444251976997.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3509437562732805626.hoa
Detected timeout of ITS tools.
[2024-05-31 06:58:57] [INFO ] Flatten gal took : 38 ms
[2024-05-31 06:58:57] [INFO ] Flatten gal took : 40 ms
[2024-05-31 06:58:57] [INFO ] Time to serialize gal into /tmp/LTL16685656423763387173.gal : 5 ms
[2024-05-31 06:58:57] [INFO ] Time to serialize properties into /tmp/LTL16244083060330478105.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16685656423763387173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16244083060330478105.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2973
Formula 0 simplified : GF(!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2966
Detected timeout of ITS tools.
[2024-05-31 06:59:12] [INFO ] Flatten gal took : 40 ms
[2024-05-31 06:59:12] [INFO ] Applying decomposition
[2024-05-31 06:59:12] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph13701150371955052409.txt' '-o' '/tmp/graph13701150371955052409.bin' '-w' '/tmp/graph13701150371955052409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13701150371955052409.bin' '-l' '-1' '-v' '-w' '/tmp/graph13701150371955052409.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:59:12] [INFO ] Decomposing Gal with order
[2024-05-31 06:59:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:59:12] [INFO ] Removed a total of 3630 redundant transitions.
[2024-05-31 06:59:12] [INFO ] Flatten gal took : 222 ms
[2024-05-31 06:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-31 06:59:12] [INFO ] Time to serialize gal into /tmp/LTL4181264819770252291.gal : 4 ms
[2024-05-31 06:59:12] [INFO ] Time to serialize properties into /tmp/LTL12999256849030467021.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4181264819770252291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12999256849030467021.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((gu121.Cells_0+gu121.Cells_1)+(gu121.Cells_2+gu121.Cells_3))+((gu121.Cells_4+gu121.Cells_5)+(gu121.Cells_6+gu121.Cells...4425
Formula 0 simplified : GF(!"((((((((gu121.Cells_0+gu121.Cells_1)+(gu121.Cells_2+gu121.Cells_3))+((gu121.Cells_4+gu121.Cells_5)+(gu121.Cells_6+gu121.Cells_7...4418
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13030814496598230722
[2024-05-31 06:59:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13030814496598230722
Running compilation step : cd /tmp/ltsmin13030814496598230722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2262 ms.
Running link step : cd /tmp/ltsmin13030814496598230722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13030814496598230722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((!(LTLAPp0==true) U X(!(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-14 finished in 198346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!p0) U X((p1 U X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Found a Lengthening insensitive property : Sudoku-COL-AN11-LTLCardinality-05
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 06:59:43] [INFO ] Computed 363 invariants in 10 ms
[2024-05-31 06:59:44] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-31 06:59:44] [INFO ] Invariant cache hit.
[2024-05-31 06:59:45] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2024-05-31 06:59:45] [INFO ] Invariant cache hit.
[2024-05-31 06:59:46] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2670 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 66810 steps with 1898 reset in 10001 ms.
Product exploration timeout after 66150 steps with 1950 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 247 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1409 ms. (steps per millisecond=7 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 07:03:49] [INFO ] Invariant cache hit.
[2024-05-31 07:03:50] [INFO ] [Real]Absence check using 363 positive place invariants in 76 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 07:04:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 07:04:14] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1460 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 133092 steps, run timeout after 6041 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 133092 steps, saw 83288 distinct states, run finished after 6041 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 07:04:23] [INFO ] Invariant cache hit.
[2024-05-31 07:04:23] [INFO ] [Real]Absence check using 363 positive place invariants in 77 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 07:04:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 07:04:48] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:04:48] [INFO ] Invariant cache hit.
[2024-05-31 07:04:49] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-31 07:04:49] [INFO ] Invariant cache hit.
[2024-05-31 07:04:50] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
[2024-05-31 07:04:50] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-31 07:04:50] [INFO ] Invariant cache hit.
[2024-05-31 07:04:51] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2652 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 07:04:51] [INFO ] Invariant cache hit.
[2024-05-31 07:04:52] [INFO ] [Real]Absence check using 363 positive place invariants in 81 ms returned sat
[2024-05-31 07:06:37] [INFO ] After 105754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 07:06:37] [INFO ] [Nat]Absence check using 363 positive place invariants in 78 ms returned sat
[2024-05-31 07:06:44] [INFO ] After 6138ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 07:06:44] [INFO ] After 6350ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-31 07:06:44] [INFO ] After 7265ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 15 factoid took 530 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:06:45] [INFO ] Invariant cache hit.
[2024-05-31 07:06:46] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-31 07:06:46] [INFO ] Invariant cache hit.
[2024-05-31 07:06:47] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2024-05-31 07:06:47] [INFO ] Invariant cache hit.
[2024-05-31 07:06:48] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 07:08:29] [INFO ] Invariant cache hit.
[2024-05-31 07:08:29] [INFO ] [Real]Absence check using 363 positive place invariants in 79 ms returned sat
[2024-05-31 07:08:54] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 241207 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241207 steps, saw 125852 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 07:08:58] [INFO ] Computed 32 invariants in 30 ms
[2024-05-31 07:08:58] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 07:08:58] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 07:08:58] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 07:08:59] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 07:08:59] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-31 07:08:59] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X p0)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 307 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 256 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 285 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Product exploration timeout after 68640 steps with 650 reset in 10002 ms.
Product exploration timeout after 68410 steps with 647 reset in 10002 ms.
Applying partial POR strategy [true, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p1) (NOT p0)), p1, (NOT p0), false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0))]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:09:20] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 07:09:20] [INFO ] Computed 363 invariants in 5 ms
[2024-05-31 07:09:21] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 731 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin15686936866396502032
[2024-05-31 07:09:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15686936866396502032
Running compilation step : cd /tmp/ltsmin15686936866396502032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2952 ms.
Running link step : cd /tmp/ltsmin15686936866396502032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15686936866396502032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7705883024024954671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:09:36] [INFO ] Invariant cache hit.
[2024-05-31 07:09:37] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-31 07:09:37] [INFO ] Invariant cache hit.
[2024-05-31 07:09:38] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-05-31 07:09:38] [INFO ] Invariant cache hit.
[2024-05-31 07:09:39] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin12235616081871452759
[2024-05-31 07:09:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12235616081871452759
Running compilation step : cd /tmp/ltsmin12235616081871452759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2904 ms.
Running link step : cd /tmp/ltsmin12235616081871452759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12235616081871452759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4225759855871858369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 07:09:54] [INFO ] Flatten gal took : 61 ms
[2024-05-31 07:09:54] [INFO ] Flatten gal took : 47 ms
[2024-05-31 07:09:54] [INFO ] Time to serialize gal into /tmp/LTL11202439031625163131.gal : 7 ms
[2024-05-31 07:09:54] [INFO ] Time to serialize properties into /tmp/LTL7258162329056619411.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11202439031625163131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8813862627822070241.hoa' '-atoms' '/tmp/LTL7258162329056619411.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7258162329056619411.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8813862627822070241.hoa
Detected timeout of ITS tools.
[2024-05-31 07:10:09] [INFO ] Flatten gal took : 66 ms
[2024-05-31 07:10:09] [INFO ] Flatten gal took : 50 ms
[2024-05-31 07:10:09] [INFO ] Time to serialize gal into /tmp/LTL7795020235076030267.gal : 6 ms
[2024-05-31 07:10:09] [INFO ] Time to serialize properties into /tmp/LTL5283511434706660951.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7795020235076030267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5283511434706660951.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...66071
Formula 0 simplified : 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_13...66062
Detected timeout of ITS tools.
[2024-05-31 07:10:25] [INFO ] Flatten gal took : 63 ms
[2024-05-31 07:10:25] [INFO ] Applying decomposition
[2024-05-31 07:10:25] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3715637863906780227.txt' '-o' '/tmp/graph3715637863906780227.bin' '-w' '/tmp/graph3715637863906780227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3715637863906780227.bin' '-l' '-1' '-v' '-w' '/tmp/graph3715637863906780227.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:10:31] [INFO ] Decomposing Gal with order
[2024-05-31 07:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:10:32] [INFO ] Removed a total of 1210 redundant transitions.
[2024-05-31 07:10:33] [INFO ] Flatten gal took : 1125 ms
[2024-05-31 07:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 57 ms.
[2024-05-31 07:10:33] [INFO ] Time to serialize gal into /tmp/LTL10018662536032042995.gal : 6 ms
[2024-05-31 07:10:33] [INFO ] Time to serialize properties into /tmp/LTL9519713850404715139.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10018662536032042995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9519713850404715139.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...87851
Formula 0 simplified : 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.Rows...87842
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11904930197961832706
[2024-05-31 07:10:48] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11904930197961832706
Running compilation step : cd /tmp/ltsmin11904930197961832706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2879 ms.
Running link step : cd /tmp/ltsmin11904930197961832706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11904930197961832706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U ([](((LTLAPp1==true) U (X((LTLAPp1==true))||[](!(LTLAPp1==true))))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-05 finished in 680146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(!p1)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN11-LTLCardinality-14
Stuttering acceptance computed with spot in 118 ms :[p1, p1, p1]
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 07:11:03] [INFO ] Computed 32 invariants in 27 ms
[2024-05-31 07:11:03] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 07:11:03] [INFO ] Invariant cache hit.
[2024-05-31 07:11:04] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2024-05-31 07:11:04] [INFO ] Invariant cache hit.
[2024-05-31 07:11:04] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1382 ms. Remains : 363/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 59680 steps with 19962 reset in 10001 ms.
Product exploration timeout after 58980 steps with 19663 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 117944 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117944 steps, saw 69664 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 07:11:59] [INFO ] Invariant cache hit.
[2024-05-31 07:11:59] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-31 07:11:59] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 07:12:00] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 07:12:00] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 07:12:00] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-31 07:12:00] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 8 ms.
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 363/363 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 155893 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155893 steps, saw 106046 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 07:12:04] [INFO ] Invariant cache hit.
[2024-05-31 07:12:05] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 07:12:05] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 07:12:05] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-31 07:12:05] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 07:12:05] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-31 07:12:05] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 424 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 95 ms :[p1, p1, p1]
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:12:06] [INFO ] Invariant cache hit.
[2024-05-31 07:12:06] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 07:12:06] [INFO ] Invariant cache hit.
[2024-05-31 07:12:07] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2024-05-31 07:12:07] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-31 07:12:07] [INFO ] Invariant cache hit.
[2024-05-31 07:12:08] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1396 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 211 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1185 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 89367 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89367 steps, saw 65168 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 07:12:46] [INFO ] Invariant cache hit.
[2024-05-31 07:12:46] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-31 07:12:46] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 07:12:46] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 07:12:47] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 07:12:47] [INFO ] After 498ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-31 07:12:47] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 7 ms.
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 363/363 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162785 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162785 steps, saw 109975 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 07:12:51] [INFO ] Invariant cache hit.
[2024-05-31 07:12:51] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 07:12:52] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 07:12:52] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 07:12:52] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 07:12:52] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-31 07:12:52] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR (NOT p1) (NOT p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 501 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 91 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Product exploration timeout after 54450 steps with 18088 reset in 10001 ms.
Product exploration timeout after 54170 steps with 18085 reset in 10003 ms.
Built C files in :
/tmp/ltsmin12234302274951368476
[2024-05-31 07:13:13] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 07:13:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:13] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 07:13:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:13] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 07:13:14] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:14] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12234302274951368476
Running compilation step : cd /tmp/ltsmin12234302274951368476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12234302274951368476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12234302274951368476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 242 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 07:13:17] [INFO ] Invariant cache hit.
[2024-05-31 07:13:17] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 07:13:17] [INFO ] Invariant cache hit.
[2024-05-31 07:13:17] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2024-05-31 07:13:18] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 07:13:18] [INFO ] Invariant cache hit.
[2024-05-31 07:13:18] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1365 ms. Remains : 363/363 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin7651770217831690296
[2024-05-31 07:13:18] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 07:13:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:18] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 07:13:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:18] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 07:13:18] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:13:18] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7651770217831690296
Running compilation step : cd /tmp/ltsmin7651770217831690296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7651770217831690296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7651770217831690296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 07:13:21] [INFO ] Flatten gal took : 38 ms
[2024-05-31 07:13:21] [INFO ] Flatten gal took : 38 ms
[2024-05-31 07:13:24] [INFO ] Time to serialize gal into /tmp/LTL11391136994786625269.gal : 2650 ms
[2024-05-31 07:13:24] [INFO ] Time to serialize properties into /tmp/LTL16524100174544929602.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11391136994786625269.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11218993667692488927.hoa' '-atoms' '/tmp/LTL16524100174544929602.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16524100174544929602.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11218993667692488927.hoa
Detected timeout of ITS tools.
[2024-05-31 07:13:39] [INFO ] Flatten gal took : 37 ms
[2024-05-31 07:13:39] [INFO ] Flatten gal took : 38 ms
[2024-05-31 07:13:39] [INFO ] Time to serialize gal into /tmp/LTL17785195029364265610.gal : 6 ms
[2024-05-31 07:13:39] [INFO ] Time to serialize properties into /tmp/LTL10426609652545948992.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17785195029364265610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10426609652545948992.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2973
Formula 0 simplified : GF(!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2966
Detected timeout of ITS tools.
[2024-05-31 07:13:54] [INFO ] Flatten gal took : 38 ms
[2024-05-31 07:13:54] [INFO ] Applying decomposition
[2024-05-31 07:13:54] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10750069870010273714.txt' '-o' '/tmp/graph10750069870010273714.bin' '-w' '/tmp/graph10750069870010273714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10750069870010273714.bin' '-l' '-1' '-v' '-w' '/tmp/graph10750069870010273714.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:13:54] [INFO ] Decomposing Gal with order
[2024-05-31 07:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:13:55] [INFO ] Removed a total of 3630 redundant transitions.
[2024-05-31 07:13:55] [INFO ] Flatten gal took : 233 ms
[2024-05-31 07:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 07:13:55] [INFO ] Time to serialize gal into /tmp/LTL5565943667040587765.gal : 5 ms
[2024-05-31 07:13:55] [INFO ] Time to serialize properties into /tmp/LTL7874327071974538690.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5565943667040587765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7874327071974538690.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((gu121.Cells_0+gu121.Cells_1)+(gu121.Cells_2+gu121.Cells_3))+((gu121.Cells_4+gu121.Cells_5)+(gu121.Cells_6+gu121.Cells...4425
Formula 0 simplified : GF(!"((((((((gu121.Cells_0+gu121.Cells_1)+(gu121.Cells_2+gu121.Cells_3))+((gu121.Cells_4+gu121.Cells_5)+(gu121.Cells_6+gu121.Cells_7...4418
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10991857861516633083
[2024-05-31 07:14:10] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10991857861516633083
Running compilation step : cd /tmp/ltsmin10991857861516633083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2312 ms.
Running link step : cd /tmp/ltsmin10991857861516633083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10991857861516633083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((!(LTLAPp0==true) U X(!(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-14 finished in 202024 ms.
[2024-05-31 07:14:25] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14700995606361022632
[2024-05-31 07:14:25] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 07:14:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:14:25] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 07:14:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:14:25] [INFO ] Applying decomposition
[2024-05-31 07:14:25] [INFO ] Flatten gal took : 58 ms
[2024-05-31 07:14:26] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 07:14:26] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 07:14:26] [INFO ] Built C files in 843ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14700995606361022632
Running compilation step : cd /tmp/ltsmin14700995606361022632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 7765 ms.
Running link step : cd /tmp/ltsmin14700995606361022632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin14700995606361022632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
[2024-05-31 07:14:41] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph9852251411438020537.txt' '-o' '/tmp/graph9852251411438020537.bin' '-w' '/tmp/graph9852251411438020537.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:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 07:14:41] [INFO ] Flatten gal took : 119 ms
[2024-05-31 07:14:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality1030038045073007680.gal : 274 ms
[2024-05-31 07:14:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality7780381435588716380.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1030038045073007680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7780381435588716380.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 5 LTL properties
Checking formula 0 : !((F(("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...20136
Formula 0 simplified : G(!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...20130
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5736812 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15181276 kB

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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-AN11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Sudoku-COL-AN11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556200307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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