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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K Apr 12 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 11:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 15K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:00 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-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717135386846

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-AN08
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 06:03:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 06:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:03:08] [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:03:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:03:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2024-05-31 06:03:09] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 06:03:09] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-31 06:03:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-12 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 13 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 10031 steps, including 151 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 43 ms. (steps per millisecond=233 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:03:09] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 06:03:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:03:09] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-31 06:03:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:03:09] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:03:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-31 06:03:09] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:03:09] [INFO ] Flatten gal took : 2 ms
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2024-05-31 06:03:09] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 19 ms.
[2024-05-31 06:03:09] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 12 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-31 06:03:09] [INFO ] Computed 192 invariants in 11 ms
[2024-05-31 06:03:10] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 06:03:10] [INFO ] Invariant cache hit.
[2024-05-31 06:03:10] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-31 06:03:10] [INFO ] Invariant cache hit.
[2024-05-31 06:03:10] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 862 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-05-31 06:03:10] [INFO ] Flatten gal took : 66 ms
[2024-05-31 06:03:10] [INFO ] Flatten gal took : 53 ms
[2024-05-31 06:03:11] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 06:03:12] [INFO ] Invariant cache hit.
[2024-05-31 06:03:12] [INFO ] [Real]Absence check using 192 positive place invariants in 39 ms returned sat
[2024-05-31 06:03:12] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 06:03:13] [INFO ] [Nat]Absence check using 192 positive place invariants in 35 ms returned sat
[2024-05-31 06:03:17] [INFO ] After 3832ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-31 06:03:19] [INFO ] After 6509ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 3252 ms.
[2024-05-31 06:03:22] [INFO ] After 10032ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 6 ms.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 192/704 places, 512/512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 368 ms. (steps per millisecond=301 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 368 ms. (steps per millisecond=301 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((F(p0) U X(p0))))&&!(p0 U p1)))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:03:24] [INFO ] Invariant cache hit.
[2024-05-31 06:03:24] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-31 06:03:24] [INFO ] Invariant cache hit.
[2024-05-31 06:03:24] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-05-31 06:03:24] [INFO ] Invariant cache hit.
[2024-05-31 06:03:25] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 969 ms. Remains : 704/704 places, 512/512 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 272 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 2 reset in 13 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-00 finished in 1322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 27 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:03:25] [INFO ] Invariant cache hit.
[2024-05-31 06:03:25] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-31 06:03:25] [INFO ] Invariant cache hit.
[2024-05-31 06:03:26] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-31 06:03:26] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-31 06:03:26] [INFO ] Invariant cache hit.
[2024-05-31 06:03:26] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 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][true]]
Product exploration explored 100000 steps with 3030 reset in 5789 ms.
Product exploration explored 100000 steps with 3030 reset in 5735 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 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 p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-31 06:03:42] [INFO ] Invariant cache hit.
[2024-05-31 06:03:43] [INFO ] [Real]Absence check using 192 positive place invariants in 56 ms returned sat
[2024-05-31 06:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:43] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-31 06:03:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:46] [INFO ] [Nat]Absence check using 192 positive place invariants in 729 ms returned sat
[2024-05-31 06:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:46] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2024-05-31 06:03:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 06:03:47] [INFO ] Added : 0 causal constraints over 0 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:03:47] [INFO ] Invariant cache hit.
[2024-05-31 06:03:47] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 06:03:47] [INFO ] Invariant cache hit.
[2024-05-31 06:03:47] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-31 06:03:47] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 06:03:47] [INFO ] Invariant cache hit.
[2024-05-31 06:03:48] [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 984 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 37 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-31 06:03:52] [INFO ] Invariant cache hit.
[2024-05-31 06:03:53] [INFO ] [Real]Absence check using 192 positive place invariants in 53 ms returned sat
[2024-05-31 06:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:53] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-31 06:03:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:56] [INFO ] [Nat]Absence check using 192 positive place invariants in 719 ms returned sat
[2024-05-31 06:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:56] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2024-05-31 06:03:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-31 06:03:57] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5672 ms.
Product exploration explored 100000 steps with 3030 reset in 5729 ms.
Built C files in :
/tmp/ltsmin13512038569364721638
[2024-05-31 06:04:08] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:04:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:08] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:04:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:08] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:04:08] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:08] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13512038569364721638
Running compilation step : cd /tmp/ltsmin13512038569364721638;'/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 1420 ms.
Running link step : cd /tmp/ltsmin13512038569364721638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13512038569364721638;'/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/stateBased16808836635699740426.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:04:23] [INFO ] Invariant cache hit.
[2024-05-31 06:04:23] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-31 06:04:23] [INFO ] Invariant cache hit.
[2024-05-31 06:04:24] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-31 06:04:24] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 06:04:24] [INFO ] Invariant cache hit.
[2024-05-31 06:04:24] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 940 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin6945531641120332030
[2024-05-31 06:04:24] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:04:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:24] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:04:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:24] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:04:24] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:04:24] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6945531641120332030
Running compilation step : cd /tmp/ltsmin6945531641120332030;'/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 1392 ms.
Running link step : cd /tmp/ltsmin6945531641120332030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6945531641120332030;'/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/stateBased14631013007999372085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:04:39] [INFO ] Flatten gal took : 38 ms
[2024-05-31 06:04:39] [INFO ] Flatten gal took : 37 ms
[2024-05-31 06:04:39] [INFO ] Time to serialize gal into /tmp/LTL14138383024093428926.gal : 5 ms
[2024-05-31 06:04:39] [INFO ] Time to serialize properties into /tmp/LTL17816169117683759617.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/LTL14138383024093428926.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6831532808088697401.hoa' '-atoms' '/tmp/LTL17816169117683759617.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/LTL17816169117683759617.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6831532808088697401.hoa
Detected timeout of ITS tools.
[2024-05-31 06:04:54] [INFO ] Flatten gal took : 32 ms
[2024-05-31 06:04:54] [INFO ] Flatten gal took : 34 ms
[2024-05-31 06:04:54] [INFO ] Time to serialize gal into /tmp/LTL15984170275324510278.gal : 4 ms
[2024-05-31 06:04:54] [INFO ] Time to serialize properties into /tmp/LTL1121514461868754310.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15984170275324510278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1121514461868754310.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("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colum...6885
Formula 0 simplified : G!"(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Column...6881
Detected timeout of ITS tools.
[2024-05-31 06:05:10] [INFO ] Flatten gal took : 26 ms
[2024-05-31 06:05:10] [INFO ] Applying decomposition
[2024-05-31 06:05:10] [INFO ] Flatten gal took : 26 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/graph12140931858317142633.txt' '-o' '/tmp/graph12140931858317142633.bin' '-w' '/tmp/graph12140931858317142633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12140931858317142633.bin' '-l' '-1' '-v' '-w' '/tmp/graph12140931858317142633.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:05:10] [INFO ] Decomposing Gal with order
[2024-05-31 06:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:05:10] [INFO ] Removed a total of 675 redundant transitions.
[2024-05-31 06:05:10] [INFO ] Flatten gal took : 252 ms
[2024-05-31 06:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 22 ms.
[2024-05-31 06:05:10] [INFO ] Time to serialize gal into /tmp/LTL2701458763559782451.gal : 8 ms
[2024-05-31 06:05:10] [INFO ] Time to serialize properties into /tmp/LTL14557268071159619245.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/LTL2701458763559782451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14557268071159619245.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("(((((((gu95.Columns_0+gu95.Columns_1)+(gu95.Columns_2+gu95.Columns_3))+((gu95.Columns_4+gu95.Columns_5)+(gu95.Columns_6+gu95.Col...9765
Formula 0 simplified : G!"(((((((gu95.Columns_0+gu95.Columns_1)+(gu95.Columns_2+gu95.Columns_3))+((gu95.Columns_4+gu95.Columns_5)+(gu95.Columns_6+gu95.Colu...9761
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8676169903582640699
[2024-05-31 06:05:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8676169903582640699
Running compilation step : cd /tmp/ltsmin8676169903582640699;'/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 1300 ms.
Running link step : cd /tmp/ltsmin8676169903582640699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8676169903582640699;'/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-AN08-LTLCardinality-01 finished in 135792 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||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:05:41] [INFO ] Invariant cache hit.
[2024-05-31 06:05:41] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-31 06:05:41] [INFO ] Invariant cache hit.
[2024-05-31 06:05:41] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-31 06:05:41] [INFO ] Invariant cache hit.
[2024-05-31 06:05:42] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-02 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}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1798 reset in 3120 ms.
Product exploration explored 100000 steps with 1798 reset in 3125 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1620 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-31 06:06:02] [INFO ] Invariant cache hit.
[2024-05-31 06:06:02] [INFO ] [Real]Absence check using 192 positive place invariants in 40 ms returned sat
[2024-05-31 06:06:03] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:2
[2024-05-31 06:06:03] [INFO ] [Nat]Absence check using 192 positive place invariants in 29 ms returned sat
[2024-05-31 06:06:05] [INFO ] After 2118ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2024-05-31 06:06:07] [INFO ] After 3618ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 5979 ms.
[2024-05-31 06:06:13] [INFO ] After 9923ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 2 ms.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 704/704 places, 512/512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20100 steps, run visited all 1 properties in 163 ms. (steps per millisecond=123 )
Probabilistic random walk after 20100 steps, saw 20004 distinct states, run finished after 163 ms. (steps per millisecond=123 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (G (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (F (NOT (AND p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))
Knowledge based reduction with 20 factoid took 2283 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN08-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-02 finished in 34999 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' '!(((p0 U X((G(p1) U p2))) U p1))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:06:16] [INFO ] Invariant cache hit.
[2024-05-31 06:06:16] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 06:06:16] [INFO ] Invariant cache hit.
[2024-05-31 06:06:16] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-31 06:06:16] [INFO ] Invariant cache hit.
[2024-05-31 06:06:17] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 80700 steps with 18938 reset in 10001 ms.
Product exploration timeout after 79380 steps with 18690 reset in 10001 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1374 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 06:07:22] [INFO ] Invariant cache hit.
[2024-05-31 06:07:22] [INFO ] [Real]Absence check using 192 positive place invariants in 38 ms returned sat
[2024-05-31 06:07:22] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 4046 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
[2024-05-31 06:07:26] [INFO ] Invariant cache hit.
[2024-05-31 06:07:28] [INFO ] [Real]Absence check using 192 positive place invariants in 63 ms returned sat
[2024-05-31 06:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:28] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-31 06:07:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:07:30] [INFO ] [Nat]Absence check using 192 positive place invariants in 411 ms returned sat
[2024-05-31 06:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:31] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2024-05-31 06:07:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 06:07:31] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 12 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:07:31] [INFO ] Invariant cache hit.
[2024-05-31 06:07:31] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-31 06:07:31] [INFO ] Invariant cache hit.
[2024-05-31 06:07:32] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-31 06:07:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 06:07:32] [INFO ] Invariant cache hit.
[2024-05-31 06:07:32] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 969 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 85 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 33 ms :[(NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
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 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2024-05-31 06:07:36] [INFO ] Invariant cache hit.
[2024-05-31 06:07:37] [INFO ] [Real]Absence check using 192 positive place invariants in 61 ms returned sat
[2024-05-31 06:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:38] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-31 06:07:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:07:40] [INFO ] [Nat]Absence check using 192 positive place invariants in 408 ms returned sat
[2024-05-31 06:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:40] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2024-05-31 06:07:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 06:07:41] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3030 reset in 5722 ms.
Product exploration explored 100000 steps with 3030 reset in 5788 ms.
Built C files in :
/tmp/ltsmin17814561291154571367
[2024-05-31 06:07:52] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:07:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:07:52] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:07:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:07:52] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:07:52] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:07:52] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17814561291154571367
Running compilation step : cd /tmp/ltsmin17814561291154571367;'/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 1297 ms.
Running link step : cd /tmp/ltsmin17814561291154571367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17814561291154571367;'/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/stateBased10986114724368595096.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:08:07] [INFO ] Invariant cache hit.
[2024-05-31 06:08:07] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 06:08:07] [INFO ] Invariant cache hit.
[2024-05-31 06:08:08] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-05-31 06:08:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 06:08:08] [INFO ] Invariant cache hit.
[2024-05-31 06:08:08] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1015 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin12593411327604329561
[2024-05-31 06:08:08] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:08:08] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:08:08] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:08:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:08:08] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:08:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:08:08] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12593411327604329561
Running compilation step : cd /tmp/ltsmin12593411327604329561;'/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 1294 ms.
Running link step : cd /tmp/ltsmin12593411327604329561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12593411327604329561;'/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/stateBased8189414501442378599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:08:23] [INFO ] Flatten gal took : 33 ms
[2024-05-31 06:08:23] [INFO ] Flatten gal took : 32 ms
[2024-05-31 06:08:23] [INFO ] Time to serialize gal into /tmp/LTL14401811310810723876.gal : 5 ms
[2024-05-31 06:08:23] [INFO ] Time to serialize properties into /tmp/LTL5358021978373434161.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/LTL14401811310810723876.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15480808940707748298.hoa' '-atoms' '/tmp/LTL5358021978373434161.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/LTL5358021978373434161.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15480808940707748298.hoa
Detected timeout of ITS tools.
[2024-05-31 06:08:38] [INFO ] Flatten gal took : 26 ms
[2024-05-31 06:08:39] [INFO ] Flatten gal took : 26 ms
[2024-05-31 06:08:39] [INFO ] Time to serialize gal into /tmp/LTL6990800752646504521.gal : 3 ms
[2024-05-31 06:08:39] [INFO ] Time to serialize properties into /tmp/LTL2354510283193635188.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6990800752646504521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2354510283193635188.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 : !(((("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...32308
Formula 0 simplified : (!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...32303
Detected timeout of ITS tools.
[2024-05-31 06:08:54] [INFO ] Flatten gal took : 23 ms
[2024-05-31 06:08:54] [INFO ] Applying decomposition
[2024-05-31 06:08:54] [INFO ] Flatten gal took : 23 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/graph17726830918544613842.txt' '-o' '/tmp/graph17726830918544613842.bin' '-w' '/tmp/graph17726830918544613842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17726830918544613842.bin' '-l' '-1' '-v' '-w' '/tmp/graph17726830918544613842.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:08:55] [INFO ] Decomposing Gal with order
[2024-05-31 06:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:08:55] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 06:08:55] [INFO ] Flatten gal took : 205 ms
[2024-05-31 06:08:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 16 ms.
[2024-05-31 06:08:56] [INFO ] Time to serialize gal into /tmp/LTL381962811803289155.gal : 4 ms
[2024-05-31 06:08:56] [INFO ] Time to serialize properties into /tmp/LTL10922762367396767368.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/LTL381962811803289155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10922762367396767368.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 : !(((("(((((((((((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.Boa...43316
Formula 0 simplified : (!"(((((((((((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.Boar...43311
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3890841693392558340
[2024-05-31 06:09:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3890841693392558340
Running compilation step : cd /tmp/ltsmin3890841693392558340;'/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 1101 ms.
Running link step : cd /tmp/ltsmin3890841693392558340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3890841693392558340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X(([]((LTLAPp1==true)) U (LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 190021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 10 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-31 06:09:26] [INFO ] Computed 23 invariants in 22 ms
[2024-05-31 06:09:26] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 06:09:26] [INFO ] Invariant cache hit.
[2024-05-31 06:09:26] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-31 06:09:26] [INFO ] Invariant cache hit.
[2024-05-31 06:09:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-06 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 5 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:09:26] [INFO ] Invariant cache hit.
[2024-05-31 06:09:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 06:09:26] [INFO ] Invariant cache hit.
[2024-05-31 06:09:27] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-31 06:09:27] [INFO ] Invariant cache hit.
[2024-05-31 06:09:27] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4535 ms.
Product exploration explored 100000 steps with 50000 reset in 4677 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-07 finished in 10917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((!p0&&G(F(!p1)))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-31 06:09:37] [INFO ] Computed 192 invariants in 3 ms
[2024-05-31 06:09:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 06:09:37] [INFO ] Invariant cache hit.
[2024-05-31 06:09:38] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-31 06:09:38] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 06:09:38] [INFO ] Invariant cache hit.
[2024-05-31 06:09:38] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 780 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1), (OR p0 p1), true, p1, p1]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-09 finished in 942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:09:38] [INFO ] Invariant cache hit.
[2024-05-31 06:09:38] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-31 06:09:38] [INFO ] Invariant cache hit.
[2024-05-31 06:09:39] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2024-05-31 06:09:39] [INFO ] Invariant cache hit.
[2024-05-31 06:09:39] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1796 reset in 7081 ms.
Product exploration explored 100000 steps with 1798 reset in 7198 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:10:07] [INFO ] Invariant cache hit.
[2024-05-31 06:10:07] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:10:07] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 9 factoid took 528 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2024-05-31 06:10:08] [INFO ] Invariant cache hit.
[2024-05-31 06:10:09] [INFO ] [Real]Absence check using 192 positive place invariants in 47 ms returned sat
[2024-05-31 06:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:10] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-05-31 06:10:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 06:10:10] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:10:10] [INFO ] Invariant cache hit.
[2024-05-31 06:10:10] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 06:10:10] [INFO ] Invariant cache hit.
[2024-05-31 06:10:10] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-31 06:10:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 06:10:10] [INFO ] Invariant cache hit.
[2024-05-31 06:10:11] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 954 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 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 p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 104 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 p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2024-05-31 06:10:15] [INFO ] Invariant cache hit.
[2024-05-31 06:10:16] [INFO ] [Real]Absence check using 192 positive place invariants in 46 ms returned sat
[2024-05-31 06:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:16] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-31 06:10:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 06:10:16] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1798 reset in 5054 ms.
Product exploration explored 100000 steps with 1798 reset in 5109 ms.
Built C files in :
/tmp/ltsmin12035433713311299477
[2024-05-31 06:10:26] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:10:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:26] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:10:26] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:26] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:10:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:26] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12035433713311299477
Running compilation step : cd /tmp/ltsmin12035433713311299477;'/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 1315 ms.
Running link step : cd /tmp/ltsmin12035433713311299477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12035433713311299477;'/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/stateBased2262748676630161163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:10:41] [INFO ] Invariant cache hit.
[2024-05-31 06:10:42] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 06:10:42] [INFO ] Invariant cache hit.
[2024-05-31 06:10:42] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2024-05-31 06:10:42] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 06:10:42] [INFO ] Invariant cache hit.
[2024-05-31 06:10:43] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1090 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin15459854868754915738
[2024-05-31 06:10:43] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:10:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:43] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:10:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:43] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:10:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:10:43] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15459854868754915738
Running compilation step : cd /tmp/ltsmin15459854868754915738;'/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 1259 ms.
Running link step : cd /tmp/ltsmin15459854868754915738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15459854868754915738;'/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/stateBased359135555316418293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:10:58] [INFO ] Flatten gal took : 21 ms
[2024-05-31 06:10:58] [INFO ] Flatten gal took : 20 ms
[2024-05-31 06:10:58] [INFO ] Time to serialize gal into /tmp/LTL10388566129588413203.gal : 3 ms
[2024-05-31 06:10:58] [INFO ] Time to serialize properties into /tmp/LTL8958422712034154778.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/LTL10388566129588413203.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12655667629856741476.hoa' '-atoms' '/tmp/LTL8958422712034154778.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/LTL8958422712034154778.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12655667629856741476.hoa
Detected timeout of ITS tools.
[2024-05-31 06:11:13] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:11:13] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:11:13] [INFO ] Time to serialize gal into /tmp/LTL10783943288120957651.gal : 3 ms
[2024-05-31 06:11:13] [INFO ] Time to serialize properties into /tmp/LTL2562523323642562319.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/LTL10783943288120957651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2562523323642562319.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 : !((X(F(("((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))...12746
Formula 0 simplified : XG(!"((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...12736
Detected timeout of ITS tools.
[2024-05-31 06:11:28] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:11:28] [INFO ] Applying decomposition
[2024-05-31 06:11:28] [INFO ] Flatten gal took : 23 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/graph16037133682702730870.txt' '-o' '/tmp/graph16037133682702730870.bin' '-w' '/tmp/graph16037133682702730870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16037133682702730870.bin' '-l' '-1' '-v' '-w' '/tmp/graph16037133682702730870.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:11:29] [INFO ] Decomposing Gal with order
[2024-05-31 06:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:11:29] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 06:11:29] [INFO ] Flatten gal took : 216 ms
[2024-05-31 06:11:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 9 ms.
[2024-05-31 06:11:29] [INFO ] Time to serialize gal into /tmp/LTL921980870791832894.gal : 3 ms
[2024-05-31 06:11:29] [INFO ] Time to serialize properties into /tmp/LTL13824347809976392985.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/LTL921980870791832894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13824347809976392985.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 : !((X(F(("((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.B...17098
Formula 0 simplified : XG(!"((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boa...17088
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10138187525701400161
[2024-05-31 06:11:44] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10138187525701400161
Running compilation step : cd /tmp/ltsmin10138187525701400161;'/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 1010 ms.
Running link step : cd /tmp/ltsmin10138187525701400161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10138187525701400161;'/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' 'X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 140763 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))'
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' '!(((p0 U X((G(p1) U p2))) U p1))'
Found a Lengthening insensitive property : Sudoku-COL-AN08-LTLCardinality-04
Stuttering acceptance computed with spot in 413 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:12:00] [INFO ] Invariant cache hit.
[2024-05-31 06:12:00] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-31 06:12:00] [INFO ] Invariant cache hit.
[2024-05-31 06:12:00] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-31 06:12:00] [INFO ] Invariant cache hit.
[2024-05-31 06:12:01] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1030 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 80530 steps with 18999 reset in 10002 ms.
Product exploration timeout after 80340 steps with 18933 reset in 10001 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1359 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 06:13:05] [INFO ] Invariant cache hit.
[2024-05-31 06:13:06] [INFO ] [Real]Absence check using 192 positive place invariants in 40 ms returned sat
[2024-05-31 06:13:06] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 3977 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
[2024-05-31 06:13:10] [INFO ] Invariant cache hit.
[2024-05-31 06:13:11] [INFO ] [Real]Absence check using 192 positive place invariants in 62 ms returned sat
[2024-05-31 06:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:13:12] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2024-05-31 06:13:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:13:13] [INFO ] [Nat]Absence check using 192 positive place invariants in 409 ms returned sat
[2024-05-31 06:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:13:14] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2024-05-31 06:13:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 06:13:14] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:13:14] [INFO ] Invariant cache hit.
[2024-05-31 06:13:15] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-31 06:13:15] [INFO ] Invariant cache hit.
[2024-05-31 06:13:15] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-31 06:13:15] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 06:13:15] [INFO ] Invariant cache hit.
[2024-05-31 06:13:15] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1005 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=6 )
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 140 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2024-05-31 06:13:19] [INFO ] Invariant cache hit.
[2024-05-31 06:13:21] [INFO ] [Real]Absence check using 192 positive place invariants in 62 ms returned sat
[2024-05-31 06:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:13:21] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-31 06:13:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:13:23] [INFO ] [Nat]Absence check using 192 positive place invariants in 410 ms returned sat
[2024-05-31 06:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:13:24] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2024-05-31 06:13:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 06:13:24] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3030 reset in 5696 ms.
Product exploration explored 100000 steps with 3030 reset in 5798 ms.
Built C files in :
/tmp/ltsmin6071634641816548308
[2024-05-31 06:13:36] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:13:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:36] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:13:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:36] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:13:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:36] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6071634641816548308
Running compilation step : cd /tmp/ltsmin6071634641816548308;'/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 1284 ms.
Running link step : cd /tmp/ltsmin6071634641816548308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6071634641816548308;'/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/stateBased3282790698029211109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:13:51] [INFO ] Invariant cache hit.
[2024-05-31 06:13:51] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-31 06:13:51] [INFO ] Invariant cache hit.
[2024-05-31 06:13:51] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-31 06:13:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 06:13:51] [INFO ] Invariant cache hit.
[2024-05-31 06:13:52] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 967 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin18287706678086747701
[2024-05-31 06:13:52] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:13:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:52] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:13:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:52] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:13:52] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:13:52] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18287706678086747701
Running compilation step : cd /tmp/ltsmin18287706678086747701;'/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 1273 ms.
Running link step : cd /tmp/ltsmin18287706678086747701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18287706678086747701;'/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/stateBased5327616697118907755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:14:07] [INFO ] Flatten gal took : 30 ms
[2024-05-31 06:14:07] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:14:07] [INFO ] Time to serialize gal into /tmp/LTL2702370627406671272.gal : 5 ms
[2024-05-31 06:14:07] [INFO ] Time to serialize properties into /tmp/LTL6195783967777363104.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/LTL2702370627406671272.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3915694982966607386.hoa' '-atoms' '/tmp/LTL6195783967777363104.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/LTL6195783967777363104.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3915694982966607386.hoa
Detected timeout of ITS tools.
[2024-05-31 06:14:22] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:14:22] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:14:22] [INFO ] Time to serialize gal into /tmp/LTL10338684126467533440.gal : 3 ms
[2024-05-31 06:14:22] [INFO ] Time to serialize properties into /tmp/LTL16075704233015643773.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/LTL10338684126467533440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16075704233015643773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...32308
Formula 0 simplified : (!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...32303
Detected timeout of ITS tools.
[2024-05-31 06:14:37] [INFO ] Flatten gal took : 21 ms
[2024-05-31 06:14:37] [INFO ] Applying decomposition
[2024-05-31 06:14:37] [INFO ] Flatten gal took : 19 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/graph14310348188495229213.txt' '-o' '/tmp/graph14310348188495229213.bin' '-w' '/tmp/graph14310348188495229213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14310348188495229213.bin' '-l' '-1' '-v' '-w' '/tmp/graph14310348188495229213.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:14:38] [INFO ] Decomposing Gal with order
[2024-05-31 06:14:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:14:39] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 06:14:39] [INFO ] Flatten gal took : 183 ms
[2024-05-31 06:14:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 8 ms.
[2024-05-31 06:14:39] [INFO ] Time to serialize gal into /tmp/LTL10431512007730975037.gal : 3 ms
[2024-05-31 06:14:39] [INFO ] Time to serialize properties into /tmp/LTL13312761732429537564.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/LTL10431512007730975037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13312761732429537564.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((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.Boa...43316
Formula 0 simplified : (!"(((((((((((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.Boar...43311
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6580724896916610041
[2024-05-31 06:14:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6580724896916610041
Running compilation step : cd /tmp/ltsmin6580724896916610041;'/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 1187 ms.
Running link step : cd /tmp/ltsmin6580724896916610041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6580724896916610041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X(([]((LTLAPp1==true)) U (LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 189650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : Sudoku-COL-AN08-LTLCardinality-10
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:15:09] [INFO ] Invariant cache hit.
[2024-05-31 06:15:09] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-31 06:15:09] [INFO ] Invariant cache hit.
[2024-05-31 06:15:10] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-31 06:15:10] [INFO ] Invariant cache hit.
[2024-05-31 06:15:10] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 943 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1797 reset in 7111 ms.
Product exploration explored 100000 steps with 1796 reset in 7165 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:15:38] [INFO ] Invariant cache hit.
[2024-05-31 06:15:38] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:15:38] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 9 factoid took 393 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-31 06:15:39] [INFO ] Invariant cache hit.
[2024-05-31 06:15:40] [INFO ] [Real]Absence check using 192 positive place invariants in 46 ms returned sat
[2024-05-31 06:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:15:40] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-31 06:15:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 06:15:40] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:15:40] [INFO ] Invariant cache hit.
[2024-05-31 06:15:41] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 06:15:41] [INFO ] Invariant cache hit.
[2024-05-31 06:15:41] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-31 06:15:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 06:15:41] [INFO ] Invariant cache hit.
[2024-05-31 06:15:41] [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 936 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 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 26 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 105 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 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
[2024-05-31 06:15:45] [INFO ] Invariant cache hit.
[2024-05-31 06:15:46] [INFO ] [Real]Absence check using 192 positive place invariants in 46 ms returned sat
[2024-05-31 06:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:15:47] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2024-05-31 06:15:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-31 06:15:47] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1796 reset in 4994 ms.
Product exploration explored 100000 steps with 1798 reset in 5052 ms.
Built C files in :
/tmp/ltsmin1554200283163404392
[2024-05-31 06:15:57] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:15:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:15:57] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:15:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:15:57] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:15:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:15:57] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1554200283163404392
Running compilation step : cd /tmp/ltsmin1554200283163404392;'/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 1343 ms.
Running link step : cd /tmp/ltsmin1554200283163404392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1554200283163404392;'/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/stateBased7923991882562623790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 06:16:12] [INFO ] Invariant cache hit.
[2024-05-31 06:16:12] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 06:16:12] [INFO ] Invariant cache hit.
[2024-05-31 06:16:13] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2024-05-31 06:16:13] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 06:16:13] [INFO ] Invariant cache hit.
[2024-05-31 06:16:13] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1089 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin13755998532937295994
[2024-05-31 06:16:13] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:16:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:16:13] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:16:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:16:13] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:16:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:16:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13755998532937295994
Running compilation step : cd /tmp/ltsmin13755998532937295994;'/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 1291 ms.
Running link step : cd /tmp/ltsmin13755998532937295994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13755998532937295994;'/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/stateBased5219841327798999551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 06:16:28] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:16:28] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:16:28] [INFO ] Time to serialize gal into /tmp/LTL10964109297181160887.gal : 3 ms
[2024-05-31 06:16:28] [INFO ] Time to serialize properties into /tmp/LTL4989524638275476519.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10964109297181160887.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16398515915684520221.hoa' '-atoms' '/tmp/LTL4989524638275476519.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/LTL4989524638275476519.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16398515915684520221.hoa
Detected timeout of ITS tools.
[2024-05-31 06:16:43] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:16:43] [INFO ] Flatten gal took : 18 ms
[2024-05-31 06:16:43] [INFO ] Time to serialize gal into /tmp/LTL10197439079701952622.gal : 4 ms
[2024-05-31 06:16:43] [INFO ] Time to serialize properties into /tmp/LTL2680441327508667209.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/LTL10197439079701952622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2680441327508667209.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 : !((X(F(("((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))...12746
Formula 0 simplified : XG(!"((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...12736
Detected timeout of ITS tools.
[2024-05-31 06:16:58] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:16:58] [INFO ] Applying decomposition
[2024-05-31 06:16:58] [INFO ] Flatten gal took : 17 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/graph1025174784678587269.txt' '-o' '/tmp/graph1025174784678587269.bin' '-w' '/tmp/graph1025174784678587269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1025174784678587269.bin' '-l' '-1' '-v' '-w' '/tmp/graph1025174784678587269.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:16:59] [INFO ] Decomposing Gal with order
[2024-05-31 06:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:16:59] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 06:16:59] [INFO ] Flatten gal took : 187 ms
[2024-05-31 06:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 8 ms.
[2024-05-31 06:16:59] [INFO ] Time to serialize gal into /tmp/LTL8155495818392661952.gal : 2 ms
[2024-05-31 06:16:59] [INFO ] Time to serialize properties into /tmp/LTL14078238045785508735.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/LTL8155495818392661952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14078238045785508735.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 : !((X(F(("((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.B...17098
Formula 0 simplified : XG(!"((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boa...17088
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin130534620873674379
[2024-05-31 06:17:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin130534620873674379
Running compilation step : cd /tmp/ltsmin130534620873674379;'/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 1005 ms.
Running link step : cd /tmp/ltsmin130534620873674379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin130534620873674379;'/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' 'X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 140612 ms.
[2024-05-31 06:17:29] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15326832253518247809
[2024-05-31 06:17:29] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 06:17:29] [INFO ] Applying decomposition
[2024-05-31 06:17:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:29] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 06:17:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:29] [INFO ] Flatten gal took : 19 ms
[2024-05-31 06:17:30] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 06:17:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 06:17:30] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15326832253518247809
Running compilation step : cd /tmp/ltsmin15326832253518247809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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 1699 ms.
Running link step : cd /tmp/ltsmin15326832253518247809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15326832253518247809;'/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))' '--buchi-type=spotba'
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/graph17775715401659166540.txt' '-o' '/tmp/graph17775715401659166540.bin' '-w' '/tmp/graph17775715401659166540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17775715401659166540.bin' '-l' '-1' '-v' '-w' '/tmp/graph17775715401659166540.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:17:32] [INFO ] Decomposing Gal with order
[2024-05-31 06:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:17:33] [INFO ] Removed a total of 1344 redundant transitions.
[2024-05-31 06:17:33] [INFO ] Flatten gal took : 643 ms
[2024-05-31 06:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-31 06:17:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality17768312371376027382.gal : 4 ms
[2024-05-31 06:17:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality4429831469433619887.ltl : 322 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/LTLCardinality17768312371376027382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4429831469433619887.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...298
Read 3 LTL properties
Checking formula 0 : !((F("(((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_7))...9189
Formula 0 simplified : G!"(((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_7)))...9185
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15326832253518247809;'/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))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15326832253518247809;'/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' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.035: LTL layer: formula: (((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))
pins2lts-mc-linux64( 0/ 8), 0.035: "(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.056: buchi has 8 states
pins2lts-mc-linux64( 2/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.234: There are 519 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.234: State length is 705, there are 532 groups
pins2lts-mc-linux64( 0/ 8), 0.234: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.234: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.234: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.234: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.749: [Blue] ~33 levels ~960 states ~65096 transitions
pins2lts-mc-linux64( 5/ 8), 0.763: [Blue] ~33 levels ~1920 states ~67032 transitions
pins2lts-mc-linux64( 5/ 8), 0.808: [Blue] ~33 levels ~3840 states ~68984 transitions
pins2lts-mc-linux64( 5/ 8), 0.886: [Blue] ~33 levels ~7680 states ~72912 transitions
pins2lts-mc-linux64( 5/ 8), 1.072: [Blue] ~33 levels ~15360 states ~82680 transitions
pins2lts-mc-linux64( 5/ 8), 1.418: [Blue] ~33 levels ~30720 states ~124104 transitions
pins2lts-mc-linux64( 7/ 8), 2.105: [Blue] ~33 levels ~61440 states ~180304 transitions
pins2lts-mc-linux64( 1/ 8), 3.510: [Blue] ~33 levels ~122880 states ~311392 transitions
pins2lts-mc-linux64( 1/ 8), 6.204: [Blue] ~33 levels ~245760 states ~563872 transitions
pins2lts-mc-linux64( 7/ 8), 11.322: [Blue] ~33 levels ~491520 states ~1137664 transitions
pins2lts-mc-linux64( 1/ 8), 21.563: [Blue] ~33 levels ~983040 states ~2774520 transitions
pins2lts-mc-linux64( 1/ 8), 41.251: [Blue] ~33 levels ~1966080 states ~5582344 transitions
pins2lts-mc-linux64( 1/ 8), 80.987: [Blue] ~33 levels ~3932160 states ~11711496 transitions
pins2lts-mc-linux64( 1/ 8), 162.466: [Blue] ~33 levels ~7864320 states ~24513264 transitions
pins2lts-mc-linux64( 0/ 8), 218.346: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 219.539:
pins2lts-mc-linux64( 0/ 8), 219.540: Explored 10276075 states 32329670 transitions, fanout: 3.146
pins2lts-mc-linux64( 0/ 8), 219.540: Total exploration time 219.280 sec (218.130 sec minimum, 218.854 sec on average)
pins2lts-mc-linux64( 0/ 8), 219.540: States per second: 46863, Transitions per second: 147436
pins2lts-mc-linux64( 0/ 8), 219.540:
pins2lts-mc-linux64( 0/ 8), 219.540: State space has 10335892 states, 10275819 are accepting
pins2lts-mc-linux64( 0/ 8), 219.540: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 219.540: blue states: 10276075 (99.42%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 219.540: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 219.540: all-red states: 10275819 (99.42%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 219.540:
pins2lts-mc-linux64( 0/ 8), 219.540: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 219.540:
pins2lts-mc-linux64( 0/ 8), 219.540: Queue width: 8B, total height: 264, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 219.540: Tree memory: 334.9MB, 34.0 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 219.540: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 219.540: Stored 524 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 219.540: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 219.540: Est. total memory use: 334.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15326832253518247809;'/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' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15326832253518247809;'/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' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 06:42:22] [INFO ] Applying decomposition
[2024-05-31 06:42:22] [INFO ] Flatten gal took : 48 ms
[2024-05-31 06:42:22] [INFO ] Decomposing Gal with order
[2024-05-31 06:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:42:22] [INFO ] Removed a total of 1096 redundant transitions.
[2024-05-31 06:42:22] [INFO ] Flatten gal took : 230 ms
[2024-05-31 06:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-31 06:42:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality10439567227047850561.gal : 43 ms
[2024-05-31 06:42:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality804785026950599867.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10439567227047850561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality804785026950599867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((F("(((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Col...11245
Formula 0 simplified : G!"(((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Colu...11241
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 138300 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12834204 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-AN08"
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-AN08, 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-171690556200292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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