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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 10:06 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 28K 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 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717135593204

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-AN09
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 06:06:34] [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:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:06:34] [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:06:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:06:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2024-05-31 06:06:35] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 06:06:35] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 17 ms.
[2024-05-31 06:06:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN09-LTLCardinality-07 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 15 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 10042 steps, including 120 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 16 ms. (steps per millisecond=627 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 24 ms. (steps per millisecond=418 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 48 ms. (steps per millisecond=209 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 33 ms. (steps per millisecond=304 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 4 ms. (steps per millisecond=2510 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:06:35] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 06:06:35] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 06:06:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:06:35] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:06:35] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:06:35] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-31 06:06:35] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 41 ms.
[2024-05-31 06:06:35] [INFO ] Unfolded 11 HLPN properties in 2 ms.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 35 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 06:06:36] [INFO ] Computed 243 invariants in 22 ms
[2024-05-31 06:06:36] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 06:06:36] [INFO ] Invariant cache hit.
[2024-05-31 06:06:36] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-05-31 06:06:36] [INFO ] Invariant cache hit.
[2024-05-31 06:06:37] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1278 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 972 out of 972 places after structural reductions.
[2024-05-31 06:06:37] [INFO ] Flatten gal took : 136 ms
[2024-05-31 06:06:37] [INFO ] Flatten gal took : 98 ms
[2024-05-31 06:06:38] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 1147 ms. (steps per millisecond=8 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-31 06:06:39] [INFO ] Invariant cache hit.
[2024-05-31 06:06:40] [INFO ] [Real]Absence check using 243 positive place invariants in 51 ms returned sat
[2024-05-31 06:06:40] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 06:06:41] [INFO ] [Nat]Absence check using 243 positive place invariants in 58 ms returned sat
[2024-05-31 06:06:56] [INFO ] After 14418ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-31 06:07:05] [INFO ] After 24158ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-31 06:07:05] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 11 ms.
Support contains 162 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.12 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 243/972 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 425311 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425311 steps, saw 100183 distinct states, run finished after 3005 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 06:07:09] [INFO ] Computed 26 invariants in 43 ms
[2024-05-31 06:07:09] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 06:07:17] [INFO ] After 7823ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 06:07:29] [INFO ] After 19569ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5306 ms.
[2024-05-31 06:07:34] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished Parikh walk after 80 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 10 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 38 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:07:35] [INFO ] Invariant cache hit.
[2024-05-31 06:07:35] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 06:07:35] [INFO ] Invariant cache hit.
[2024-05-31 06:07:35] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2024-05-31 06:07:35] [INFO ] Invariant cache hit.
[2024-05-31 06:07:36] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1177 ms. Remains : 243/972 places, 729/729 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 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-00 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189...], 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][false, false, false]]
Product exploration explored 100000 steps with 1419 reset in 4902 ms.
Product exploration explored 100000 steps with 1421 reset in 4869 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662652 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662652 steps, saw 135379 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:07:52] [INFO ] Invariant cache hit.
[2024-05-31 06:07:52] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-31 06:07:59] [INFO ] After 6402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:07:59] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 06:08:01] [INFO ] After 2308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:08:02] [INFO ] After 3271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1309 ms.
[2024-05-31 06:08:03] [INFO ] After 4660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLCardinality-00 finished in 28749 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&&X(p0))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 27 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 06:08:03] [INFO ] Computed 243 invariants in 5 ms
[2024-05-31 06:08:04] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-31 06:08:04] [INFO ] Invariant cache hit.
[2024-05-31 06:08:05] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2024-05-31 06:08:05] [INFO ] Invariant cache hit.
[2024-05-31 06:08:05] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1612 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9566 ms.
Product exploration explored 100000 steps with 50000 reset in 9672 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLCardinality-01 finished in 30214 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(X(p0)) U X(!p1)))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:08:34] [INFO ] Invariant cache hit.
[2024-05-31 06:08:34] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 06:08:34] [INFO ] Invariant cache hit.
[2024-05-31 06:08:34] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-31 06:08:34] [INFO ] Invariant cache hit.
[2024-05-31 06:08:35] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1283 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (OR (LEQ 1 (ADD s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 ...], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8307 ms.
Product exploration explored 100000 steps with 50000 reset in 8392 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 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-AN09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLCardinality-02 finished in 34483 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&&F(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:09:08] [INFO ] Invariant cache hit.
[2024-05-31 06:09:08] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 06:09:08] [INFO ] Invariant cache hit.
[2024-05-31 06:09:09] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-05-31 06:09:09] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-31 06:09:09] [INFO ] Invariant cache hit.
[2024-05-31 06:09:09] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1225 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], 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, null][true, true]]
Product exploration explored 100000 steps with 2380 reset in 8674 ms.
Product exploration explored 100000 steps with 2380 reset in 8784 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2024-05-31 06:09:44] [INFO ] Invariant cache hit.
[2024-05-31 06:09:46] [INFO ] [Real]Absence check using 243 positive place invariants in 87 ms returned sat
[2024-05-31 06:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:46] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-05-31 06:09:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:09:50] [INFO ] [Nat]Absence check using 243 positive place invariants in 2116 ms returned sat
[2024-05-31 06:09:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:52] [INFO ] [Nat]Absence check using state equation in 1319 ms returned sat
[2024-05-31 06:09:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 06:09:52] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 810 out of 972 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 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:09:52] [INFO ] Invariant cache hit.
[2024-05-31 06:09:52] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 06:09:52] [INFO ] Invariant cache hit.
[2024-05-31 06:09:52] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2024-05-31 06:09:52] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 06:09:52] [INFO ] Invariant cache hit.
[2024-05-31 06:09:53] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1164 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2024-05-31 06:10:02] [INFO ] Invariant cache hit.
[2024-05-31 06:10:04] [INFO ] [Real]Absence check using 243 positive place invariants in 87 ms returned sat
[2024-05-31 06:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:05] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-05-31 06:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:10:08] [INFO ] [Nat]Absence check using 243 positive place invariants in 2099 ms returned sat
[2024-05-31 06:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:10] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2024-05-31 06:10:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-31 06:10:10] [INFO ] Added : 0 causal constraints over 0 iterations in 112 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2380 reset in 8676 ms.
Product exploration explored 100000 steps with 2380 reset in 8785 ms.
Built C files in :
/tmp/ltsmin12142360265703288703
[2024-05-31 06:10:28] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:10:28] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:28] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:10:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:28] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:10:28] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:28] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12142360265703288703
Running compilation step : cd /tmp/ltsmin12142360265703288703;'/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 2141 ms.
Running link step : cd /tmp/ltsmin12142360265703288703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin12142360265703288703;'/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' '--hoa' '/tmp/stateBased1748490027542019511.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:10:43] [INFO ] Invariant cache hit.
[2024-05-31 06:10:43] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-31 06:10:43] [INFO ] Invariant cache hit.
[2024-05-31 06:10:44] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2024-05-31 06:10:44] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 06:10:44] [INFO ] Invariant cache hit.
[2024-05-31 06:10:44] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 972/972 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin12239707450225586471
[2024-05-31 06:10:44] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:10:44] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:44] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:10:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:44] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:10:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:44] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12239707450225586471
Running compilation step : cd /tmp/ltsmin12239707450225586471;'/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 2092 ms.
Running link step : cd /tmp/ltsmin12239707450225586471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12239707450225586471;'/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' '--hoa' '/tmp/stateBased77616005132216437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:10:59] [INFO ] Flatten gal took : 47 ms
[2024-05-31 06:10:59] [INFO ] Flatten gal took : 42 ms
[2024-05-31 06:10:59] [INFO ] Time to serialize gal into /tmp/LTL1027667755416961786.gal : 10 ms
[2024-05-31 06:10:59] [INFO ] Time to serialize properties into /tmp/LTL4732852157202107771.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1027667755416961786.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11669920388407206361.hoa' '-atoms' '/tmp/LTL4732852157202107771.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/LTL4732852157202107771.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11669920388407206361.hoa
Detected timeout of ITS tools.
[2024-05-31 06:11:14] [INFO ] Flatten gal took : 39 ms
[2024-05-31 06:11:14] [INFO ] Flatten gal took : 37 ms
[2024-05-31 06:11:14] [INFO ] Time to serialize gal into /tmp/LTL12119246826923164247.gal : 5 ms
[2024-05-31 06:11:14] [INFO ] Time to serialize properties into /tmp/LTL4950375399359195413.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12119246826923164247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4950375399359195413.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(("((((((((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_...10522
Formula 0 simplified : G(!"((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_1...10516
Detected timeout of ITS tools.
[2024-05-31 06:11:30] [INFO ] Flatten gal took : 37 ms
[2024-05-31 06:11:30] [INFO ] Applying decomposition
[2024-05-31 06:11:30] [INFO ] Flatten gal took : 37 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/graph6550457055685285890.txt' '-o' '/tmp/graph6550457055685285890.bin' '-w' '/tmp/graph6550457055685285890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6550457055685285890.bin' '-l' '-1' '-v' '-w' '/tmp/graph6550457055685285890.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:11:31] [INFO ] Decomposing Gal with order
[2024-05-31 06:11:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:11:31] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-31 06:11:31] [INFO ] Flatten gal took : 634 ms
[2024-05-31 06:11:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 42 ms.
[2024-05-31 06:11:32] [INFO ] Time to serialize gal into /tmp/LTL14560274128770704104.gal : 6 ms
[2024-05-31 06:11:32] [INFO ] Time to serialize properties into /tmp/LTL5851157023551065011.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/LTL14560274128770704104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5851157023551065011.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.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...14086
Formula 0 simplified : G(!"((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...14080
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10020473429275537788
[2024-05-31 06:11:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10020473429275537788
Running compilation step : cd /tmp/ltsmin10020473429275537788;'/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 1499 ms.
Running link step : cd /tmp/ltsmin10020473429275537788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10020473429275537788;'/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-AN09-LTLCardinality-03 finished in 173661 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)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.7 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 06:12:02] [INFO ] Computed 26 invariants in 19 ms
[2024-05-31 06:12:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-31 06:12:02] [INFO ] Invariant cache hit.
[2024-05-31 06:12:02] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-31 06:12:02] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 06:12:02] [INFO ] Invariant cache hit.
[2024-05-31 06:12:03] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 825 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1419 reset in 4584 ms.
Product exploration explored 100000 steps with 1419 reset in 4666 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 581483 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581483 steps, saw 123000 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:12:18] [INFO ] Invariant cache hit.
[2024-05-31 06:12:18] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:12:24] [INFO ] After 5663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:12:24] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 06:12:28] [INFO ] After 4161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:12:29] [INFO ] After 5085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4519 ms.
[2024-05-31 06:12:34] [INFO ] After 9671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:12:34] [INFO ] Invariant cache hit.
[2024-05-31 06:12:34] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-31 06:12:34] [INFO ] Invariant cache hit.
[2024-05-31 06:12:34] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-31 06:12:34] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 06:12:34] [INFO ] Invariant cache hit.
[2024-05-31 06:12:35] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 142 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 565296 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565296 steps, saw 120034 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:12:41] [INFO ] Invariant cache hit.
[2024-05-31 06:12:41] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 06:12:47] [INFO ] After 5736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:12:47] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:12:51] [INFO ] After 4121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:12:52] [INFO ] After 5043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4473 ms.
[2024-05-31 06:12:56] [INFO ] After 9582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1418 reset in 4609 ms.
Product exploration explored 100000 steps with 1418 reset in 4661 ms.
Built C files in :
/tmp/ltsmin1970256874780300739
[2024-05-31 06:13:06] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:13:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:06] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:13:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:06] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:13:06] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:06] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1970256874780300739
Running compilation step : cd /tmp/ltsmin1970256874780300739;'/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 2075 ms.
Running link step : cd /tmp/ltsmin1970256874780300739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1970256874780300739;'/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' '--hoa' '/tmp/stateBased2180666423977067792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:13:21] [INFO ] Invariant cache hit.
[2024-05-31 06:13:21] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 06:13:21] [INFO ] Invariant cache hit.
[2024-05-31 06:13:22] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-31 06:13:22] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 06:13:22] [INFO ] Invariant cache hit.
[2024-05-31 06:13:22] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin5278002877297430956
[2024-05-31 06:13:22] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:13:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:22] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:13:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:22] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:13:22] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:22] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5278002877297430956
Running compilation step : cd /tmp/ltsmin5278002877297430956;'/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 1827 ms.
Running link step : cd /tmp/ltsmin5278002877297430956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5278002877297430956;'/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' '--hoa' '/tmp/stateBased488860067693779050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:13:37] [INFO ] Flatten gal took : 40 ms
[2024-05-31 06:13:37] [INFO ] Flatten gal took : 39 ms
[2024-05-31 06:13:37] [INFO ] Time to serialize gal into /tmp/LTL12537406261299130017.gal : 3 ms
[2024-05-31 06:13:37] [INFO ] Time to serialize properties into /tmp/LTL2943260626793534562.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/LTL12537406261299130017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17801242233564896605.hoa' '-atoms' '/tmp/LTL2943260626793534562.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/LTL2943260626793534562.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17801242233564896605.hoa
Detected timeout of ITS tools.
[2024-05-31 06:13:52] [INFO ] Flatten gal took : 27 ms
[2024-05-31 06:13:52] [INFO ] Flatten gal took : 27 ms
[2024-05-31 06:13:52] [INFO ] Time to serialize gal into /tmp/LTL12139635081963970153.gal : 5 ms
[2024-05-31 06:13:52] [INFO ] Time to serialize properties into /tmp/LTL5403812025196152799.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/LTL12139635081963970153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5403812025196152799.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+Rows...836
Formula 0 simplified : FG!"((((((((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_1...830
Detected timeout of ITS tools.
[2024-05-31 06:14:08] [INFO ] Flatten gal took : 24 ms
[2024-05-31 06:14:08] [INFO ] Applying decomposition
[2024-05-31 06:14:08] [INFO ] Flatten gal took : 24 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/graph6414898204996502998.txt' '-o' '/tmp/graph6414898204996502998.bin' '-w' '/tmp/graph6414898204996502998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6414898204996502998.bin' '-l' '-1' '-v' '-w' '/tmp/graph6414898204996502998.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:14:08] [INFO ] Decomposing Gal with order
[2024-05-31 06:14:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:14:08] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 06:14:08] [INFO ] Flatten gal took : 89 ms
[2024-05-31 06:14:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 06:14:08] [INFO ] Time to serialize gal into /tmp/LTL7705645708777863309.gal : 5 ms
[2024-05-31 06:14:08] [INFO ] Time to serialize properties into /tmp/LTL10922494506555257648.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/LTL7705645708777863309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10922494506555257648.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("((((((((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...1160
Formula 0 simplified : FG!"((((((((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.Row...1154
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15792469191848379161
[2024-05-31 06:14:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15792469191848379161
Running compilation step : cd /tmp/ltsmin15792469191848379161;'/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 1263 ms.
Running link step : cd /tmp/ltsmin15792469191848379161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15792469191848379161;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN09-LTLCardinality-04 finished in 156286 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((X(G(p0))&&G(p1))) U (p2 U (p1 U p0))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 06:14:38] [INFO ] Computed 243 invariants in 5 ms
[2024-05-31 06:14:38] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 06:14:38] [INFO ] Invariant cache hit.
[2024-05-31 06:14:39] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-31 06:14:39] [INFO ] Invariant cache hit.
[2024-05-31 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1156 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ 1 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s11...], 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 85310 steps with 42655 reset in 10001 ms.
Product exploration timeout after 85270 steps with 42635 reset in 10001 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p1), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 18 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLCardinality-05 finished in 69228 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(p0) U p1)))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:15:47] [INFO ] Invariant cache hit.
[2024-05-31 06:15:48] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-31 06:15:48] [INFO ] Invariant cache hit.
[2024-05-31 06:15:48] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-31 06:15:48] [INFO ] Invariant cache hit.
[2024-05-31 06:15:49] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1422 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (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 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-06 finished in 1563 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)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 06:15:49] [INFO ] Computed 26 invariants in 14 ms
[2024-05-31 06:15:49] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 06:15:49] [INFO ] Invariant cache hit.
[2024-05-31 06:15:49] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-05-31 06:15:49] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 06:15:49] [INFO ] Invariant cache hit.
[2024-05-31 06:15:50] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 950 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1417 reset in 4762 ms.
Product exploration explored 100000 steps with 1421 reset in 4813 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 500 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 142 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 577222 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577222 steps, saw 122261 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:16:06] [INFO ] Invariant cache hit.
[2024-05-31 06:16:06] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:16:11] [INFO ] After 4751ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 06:16:18] [INFO ] After 11163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:16:18] [INFO ] After 11235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:16:18] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:16:20] [INFO ] After 2875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:16:22] [INFO ] After 4105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9073 ms.
[2024-05-31 06:16:31] [INFO ] After 13272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:16:31] [INFO ] Invariant cache hit.
[2024-05-31 06:16:31] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 06:16:31] [INFO ] Invariant cache hit.
[2024-05-31 06:16:32] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-31 06:16:32] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 06:16:32] [INFO ] Invariant cache hit.
[2024-05-31 06:16:32] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 868 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 552546 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552546 steps, saw 118289 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:16:38] [INFO ] Invariant cache hit.
[2024-05-31 06:16:38] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:16:43] [INFO ] After 4613ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 06:16:49] [INFO ] After 11004ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:16:49] [INFO ] After 11073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:16:49] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 06:16:52] [INFO ] After 2949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:16:54] [INFO ] After 4149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9071 ms.
[2024-05-31 06:17:03] [INFO ] After 13290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1419 reset in 4687 ms.
Product exploration explored 100000 steps with 1419 reset in 4808 ms.
Built C files in :
/tmp/ltsmin16656020823960451377
[2024-05-31 06:17:12] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:17:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:12] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:17:12] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:13] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:17:13] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:13] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16656020823960451377
Running compilation step : cd /tmp/ltsmin16656020823960451377;'/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 1767 ms.
Running link step : cd /tmp/ltsmin16656020823960451377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16656020823960451377;'/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' '--hoa' '/tmp/stateBased6305111549788017047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:17:28] [INFO ] Invariant cache hit.
[2024-05-31 06:17:28] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-31 06:17:28] [INFO ] Invariant cache hit.
[2024-05-31 06:17:28] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-31 06:17:28] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 06:17:28] [INFO ] Invariant cache hit.
[2024-05-31 06:17:28] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 942 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin14083491281286330583
[2024-05-31 06:17:29] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:17:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:29] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:17:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:29] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:17:29] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:29] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14083491281286330583
Running compilation step : cd /tmp/ltsmin14083491281286330583;'/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 1808 ms.
Running link step : cd /tmp/ltsmin14083491281286330583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14083491281286330583;'/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' '--hoa' '/tmp/stateBased1144782996592739777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:17:44] [INFO ] Flatten gal took : 22 ms
[2024-05-31 06:17:44] [INFO ] Flatten gal took : 22 ms
[2024-05-31 06:17:44] [INFO ] Time to serialize gal into /tmp/LTL5810640104701046434.gal : 4 ms
[2024-05-31 06:17:44] [INFO ] Time to serialize properties into /tmp/LTL13208015535533422691.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/LTL5810640104701046434.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4634440516373436845.hoa' '-atoms' '/tmp/LTL13208015535533422691.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/LTL13208015535533422691.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4634440516373436845.hoa
Detected timeout of ITS tools.
[2024-05-31 06:17:59] [INFO ] Flatten gal took : 23 ms
[2024-05-31 06:17:59] [INFO ] Flatten gal took : 22 ms
[2024-05-31 06:17:59] [INFO ] Time to serialize gal into /tmp/LTL14090605979667128474.gal : 4 ms
[2024-05-31 06:17:59] [INFO ] Time to serialize properties into /tmp/LTL7459982157870577483.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/LTL14090605979667128474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7459982157870577483.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("((((((((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...836
Formula 0 simplified : GF!"((((((((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_1...830
Detected timeout of ITS tools.
[2024-05-31 06:18:14] [INFO ] Flatten gal took : 23 ms
[2024-05-31 06:18:14] [INFO ] Applying decomposition
[2024-05-31 06:18:14] [INFO ] Flatten gal took : 22 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/graph7924930169235548788.txt' '-o' '/tmp/graph7924930169235548788.bin' '-w' '/tmp/graph7924930169235548788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7924930169235548788.bin' '-l' '-1' '-v' '-w' '/tmp/graph7924930169235548788.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:18:14] [INFO ] Decomposing Gal with order
[2024-05-31 06:18:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:18:14] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 06:18:14] [INFO ] Flatten gal took : 73 ms
[2024-05-31 06:18:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 06:18:14] [INFO ] Time to serialize gal into /tmp/LTL6972516984134564156.gal : 3 ms
[2024-05-31 06:18:14] [INFO ] Time to serialize properties into /tmp/LTL11776430710644400208.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/LTL6972516984134564156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11776430710644400208.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("((((((((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...1160
Formula 0 simplified : GF!"((((((((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.Row...1154
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3279090906266728436
[2024-05-31 06:18:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3279090906266728436
Running compilation step : cd /tmp/ltsmin3279090906266728436;'/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 1204 ms.
Running link step : cd /tmp/ltsmin3279090906266728436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3279090906266728436;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN09-LTLCardinality-09 finished in 175523 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(G((p1 U p2))))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 06:18:44] [INFO ] Computed 243 invariants in 3 ms
[2024-05-31 06:18:45] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-31 06:18:45] [INFO ] Invariant cache hit.
[2024-05-31 06:18:45] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-31 06:18:45] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 06:18:45] [INFO ] Invariant cache hit.
[2024-05-31 06:18:46] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1304 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 8 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-10 finished in 1505 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(X(F(p0))))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 12 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 06:18:46] [INFO ] Computed 26 invariants in 11 ms
[2024-05-31 06:18:46] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-31 06:18:46] [INFO ] Invariant cache hit.
[2024-05-31 06:18:46] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-31 06:18:46] [INFO ] Invariant cache hit.
[2024-05-31 06:18:47] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189...], 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 9271 ms.
Product exploration explored 100000 steps with 33333 reset in 9296 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (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 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLCardinality-13 finished in 22286 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)||G(F(!p1)))))'
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 06:19:08] [INFO ] Computed 243 invariants in 9 ms
[2024-05-31 06:19:09] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-31 06:19:09] [INFO ] Invariant cache hit.
[2024-05-31 06:19:09] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-31 06:19:09] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 06:19:09] [INFO ] Invariant cache hit.
[2024-05-31 06:19:10] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1419 reset in 7716 ms.
Product exploration explored 100000 steps with 1419 reset in 7660 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) 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 7 factoid took 156 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 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 234 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 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:19:47] [INFO ] Invariant cache hit.
[2024-05-31 06:19:47] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-31 06:19:47] [INFO ] Invariant cache hit.
[2024-05-31 06:19:48] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-31 06:19:48] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 06:19:48] [INFO ] Invariant cache hit.
[2024-05-31 06:19:48] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1669 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) 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 7 factoid took 144 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 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 231 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 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1420 reset in 7642 ms.
Product exploration explored 100000 steps with 1419 reset in 7632 ms.
Built C files in :
/tmp/ltsmin1687440870110429526
[2024-05-31 06:20:25] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:20:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:25] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:20:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:25] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:20:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:25] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1687440870110429526
Running compilation step : cd /tmp/ltsmin1687440870110429526;'/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 2179 ms.
Running link step : cd /tmp/ltsmin1687440870110429526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1687440870110429526;'/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' '--hoa' '/tmp/stateBased15170590338401830060.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 06:20:40] [INFO ] Invariant cache hit.
[2024-05-31 06:20:41] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-31 06:20:41] [INFO ] Invariant cache hit.
[2024-05-31 06:20:42] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2024-05-31 06:20:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 06:20:42] [INFO ] Invariant cache hit.
[2024-05-31 06:20:42] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1638 ms. Remains : 972/972 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin15661797598080000003
[2024-05-31 06:20:42] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:20:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:42] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:20:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:42] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:20:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:20:42] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15661797598080000003
Running compilation step : cd /tmp/ltsmin15661797598080000003;'/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 2187 ms.
Running link step : cd /tmp/ltsmin15661797598080000003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15661797598080000003;'/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' '--hoa' '/tmp/stateBased3262707864366826851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:20:57] [INFO ] Flatten gal took : 27 ms
[2024-05-31 06:20:57] [INFO ] Flatten gal took : 27 ms
[2024-05-31 06:20:57] [INFO ] Time to serialize gal into /tmp/LTL8029588279987775177.gal : 4 ms
[2024-05-31 06:20:57] [INFO ] Time to serialize properties into /tmp/LTL3218620212809723183.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/LTL8029588279987775177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7944232566413043625.hoa' '-atoms' '/tmp/LTL3218620212809723183.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...317
Loading property file /tmp/LTL3218620212809723183.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7944232566413043625.hoa
Detected timeout of ITS tools.
[2024-05-31 06:21:12] [INFO ] Flatten gal took : 32 ms
[2024-05-31 06:21:12] [INFO ] Flatten gal took : 29 ms
[2024-05-31 06:21:12] [INFO ] Time to serialize gal into /tmp/LTL15335515582832380313.gal : 5 ms
[2024-05-31 06:21:12] [INFO ] Time to serialize properties into /tmp/LTL7249013779094083825.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/LTL15335515582832380313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7249013779094083825.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("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...17327
Formula 0 simplified : G(F!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...17317
Detected timeout of ITS tools.
[2024-05-31 06:21:27] [INFO ] Flatten gal took : 31 ms
[2024-05-31 06:21:27] [INFO ] Applying decomposition
[2024-05-31 06:21:27] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5883219153938907817.txt' '-o' '/tmp/graph5883219153938907817.bin' '-w' '/tmp/graph5883219153938907817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5883219153938907817.bin' '-l' '-1' '-v' '-w' '/tmp/graph5883219153938907817.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:21:28] [INFO ] Decomposing Gal with order
[2024-05-31 06:21:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:21:29] [INFO ] Removed a total of 1422 redundant transitions.
[2024-05-31 06:21:29] [INFO ] Flatten gal took : 789 ms
[2024-05-31 06:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 29 ms.
[2024-05-31 06:21:30] [INFO ] Time to serialize gal into /tmp/LTL9879281232032030889.gal : 20 ms
[2024-05-31 06:21:30] [INFO ] Time to serialize properties into /tmp/LTL9206514342811485703.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/LTL9879281232032030889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9206514342811485703.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("(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0....23159
Formula 0 simplified : G(F!"(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Bo...23149
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8728528945224660836
[2024-05-31 06:21:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8728528945224660836
Running compilation step : cd /tmp/ltsmin8728528945224660836;'/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 1577 ms.
Running link step : cd /tmp/ltsmin8728528945224660836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8728528945224660836;'/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-AN09-LTLCardinality-14 finished in 171589 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&&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(F(p0)))'
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)))'
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)||G(F(!p1)))))'
[2024-05-31 06:22:00] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13466307774036422773
[2024-05-31 06:22:00] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 06:22:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:22:00] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 06:22:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:22:00] [INFO ] Applying decomposition
[2024-05-31 06:22:00] [INFO ] Flatten gal took : 45 ms
[2024-05-31 06:22:00] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 06:22:00] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:22:00] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13466307774036422773
Running compilation step : cd /tmp/ltsmin13466307774036422773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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'
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/graph557444771565933878.txt' '-o' '/tmp/graph557444771565933878.bin' '-w' '/tmp/graph557444771565933878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph557444771565933878.bin' '-l' '-1' '-v' '-w' '/tmp/graph557444771565933878.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:22:02] [INFO ] Decomposing Gal with order
[2024-05-31 06:22:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:22:02] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-31 06:22:02] [INFO ] Flatten gal took : 455 ms
[2024-05-31 06:22:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 06:22:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality13420125956322928683.gal : 5 ms
[2024-05-31 06:22:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality15152215669872874631.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/LTLCardinality13420125956322928683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15152215669872874631.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...299
Read 4 LTL properties
Checking formula 0 : !((F(("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...14086
Formula 0 simplified : G(!"((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...14080
Compilation finished in 2505 ms.
Running link step : cd /tmp/ltsmin13466307774036422773;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13466307774036422773;'/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'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13466307774036422773;'/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'
Running LTSmin : cd /tmp/ltsmin13466307774036422773;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 06:47:13] [INFO ] Applying decomposition
[2024-05-31 06:47:13] [INFO ] Flatten gal took : 175 ms
[2024-05-31 06:47:14] [INFO ] Decomposing Gal with order
[2024-05-31 06:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:47:14] [INFO ] Removed a total of 1629 redundant transitions.
[2024-05-31 06:47:14] [INFO ] Flatten gal took : 306 ms
[2024-05-31 06:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2024-05-31 06:47:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality7284278900237454011.gal : 35 ms
[2024-05-31 06:47:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality674640577838521181.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7284278900237454011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality674640577838521181.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...296
Read 4 LTL properties
Checking formula 0 : !((F(("((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows...17196
Formula 0 simplified : G(!"((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows_...17190
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13466307774036422773;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13466307774036422773;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3595428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16185988 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-AN09"
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-AN09, 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-171690556200297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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