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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717132867011

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-AN06
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 05:21: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 05:21:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:21: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 05:21:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:21:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 629 ms
[2024-05-31 05:21:09] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:21:09] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-05-31 05:21:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 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 263 resets, run finished after 85 ms. (steps per millisecond=118 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 05:21:09] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 05:21:09] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 05:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 05:21:09] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 05:21:09] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:21:09] [INFO ] Flatten gal took : 1 ms
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2024-05-31 05:21:09] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 13 ms.
[2024-05-31 05:21:09] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 05:21:09] [INFO ] Computed 108 invariants in 14 ms
[2024-05-31 05:21:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 05:21:10] [INFO ] Invariant cache hit.
[2024-05-31 05:21:10] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-31 05:21:10] [INFO ] Invariant cache hit.
[2024-05-31 05:21:10] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2024-05-31 05:21:10] [INFO ] Flatten gal took : 31 ms
[2024-05-31 05:21:10] [INFO ] Flatten gal took : 27 ms
[2024-05-31 05:21:10] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 05:21:11] [INFO ] Invariant cache hit.
[2024-05-31 05:21:11] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 05:21:11] [INFO ] [Nat]Absence check using 108 positive place invariants in 16 ms returned sat
[2024-05-31 05:21:11] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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' '!((p0 U G((p1&&X(p1)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 05:21:11] [INFO ] Computed 17 invariants in 20 ms
[2024-05-31 05:21:11] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 05:21:11] [INFO ] Invariant cache hit.
[2024-05-31 05:21:12] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-31 05:21:12] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-31 05:21:12] [INFO ] Invariant cache hit.
[2024-05-31 05:21:13] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1464 ms. Remains : 108/324 places, 216/216 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 255 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33319 reset in 2684 ms.
Product exploration explored 100000 steps with 33320 reset in 2674 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 265 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 552702 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552702 steps, saw 94313 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 05:21:23] [INFO ] Invariant cache hit.
[2024-05-31 05:21:23] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 05:21:23] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-31 05:21:23] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:23] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 05:21:23] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-31 05:21:24] [INFO ] After 887ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 3 ms.
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 108/108 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1472527 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :{}
Probabilistic random walk after 1472527 steps, saw 227103 distinct states, run finished after 3003 ms. (steps per millisecond=490 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:21:27] [INFO ] Invariant cache hit.
[2024-05-31 05:21:27] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 05:21:27] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:21:27] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 11 ms returned sat
[2024-05-31 05:21:27] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:21:27] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-31 05:21:27] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 15 factoid took 545 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-02 finished in 16677 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)||(p1&&G(p2)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 7 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:21:28] [INFO ] Invariant cache hit.
[2024-05-31 05:21:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 05:21:28] [INFO ] Invariant cache hit.
[2024-05-31 05:21:28] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 05:21:28] [INFO ] Invariant cache hit.
[2024-05-31 05:21:28] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 (ADD 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 s99 s100 s101 s102 s103 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3176 reset in 1573 ms.
Product exploration explored 100000 steps with 3184 reset in 1574 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 482 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 317 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 712192 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 712192 steps, saw 115829 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 05:21:36] [INFO ] Invariant cache hit.
[2024-05-31 05:21:36] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:36] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-31 05:21:36] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:36] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 05:21:36] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 173 ms.
[2024-05-31 05:21:37] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 2 ms.
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 108/108 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 320 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1578622 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :{}
Probabilistic random walk after 1578622 steps, saw 241744 distinct states, run finished after 3001 ms. (steps per millisecond=526 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:21:40] [INFO ] Invariant cache hit.
[2024-05-31 05:21:40] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:40] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:21:40] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:40] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:21:40] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-31 05:21:40] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 1197 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 72 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:21:42] [INFO ] Invariant cache hit.
[2024-05-31 05:21:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 05:21:42] [INFO ] Invariant cache hit.
[2024-05-31 05:21:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-31 05:21:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 05:21:42] [INFO ] Invariant cache hit.
[2024-05-31 05:21:42] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 215 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 775005 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 775005 steps, saw 121630 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 05:21:46] [INFO ] Invariant cache hit.
[2024-05-31 05:21:46] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 05:21:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 05:21:46] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:46] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-31 05:21:47] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-31 05:21:47] [INFO ] After 608ms 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 36 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 1 ms.
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 108/108 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1550542 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1550542 steps, saw 238041 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:21:50] [INFO ] Invariant cache hit.
[2024-05-31 05:21:50] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 05:21:50] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:21:50] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 05:21:50] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 05:21:50] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-31 05:21:50] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 468 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3183 reset in 1362 ms.
Product exploration explored 100000 steps with 3184 reset in 1383 ms.
Built C files in :
/tmp/ltsmin13187467752908787971
[2024-05-31 05:21:54] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:21:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:21:54] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:21:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:21:54] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:21:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:21:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13187467752908787971
Running compilation step : cd /tmp/ltsmin13187467752908787971;'/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 502 ms.
Running link step : cd /tmp/ltsmin13187467752908787971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13187467752908787971;'/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/stateBased9221201793949504527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 72 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:22:09] [INFO ] Invariant cache hit.
[2024-05-31 05:22:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 05:22:09] [INFO ] Invariant cache hit.
[2024-05-31 05:22:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-31 05:22:09] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:22:09] [INFO ] Invariant cache hit.
[2024-05-31 05:22:10] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin15723584330952879432
[2024-05-31 05:22:10] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:22:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:22:10] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:22:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:22:10] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:22:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:22:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15723584330952879432
Running compilation step : cd /tmp/ltsmin15723584330952879432;'/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 422 ms.
Running link step : cd /tmp/ltsmin15723584330952879432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15723584330952879432;'/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/stateBased9802488661482201135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:22:25] [INFO ] Flatten gal took : 17 ms
[2024-05-31 05:22:25] [INFO ] Flatten gal took : 16 ms
[2024-05-31 05:22:25] [INFO ] Time to serialize gal into /tmp/LTL2733597860995555066.gal : 4 ms
[2024-05-31 05:22:25] [INFO ] Time to serialize properties into /tmp/LTL13109732848713415911.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/LTL2733597860995555066.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7002450558810112906.hoa' '-atoms' '/tmp/LTL13109732848713415911.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13109732848713415911.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7002450558810112906.hoa
Detected timeout of ITS tools.
[2024-05-31 05:22:40] [INFO ] Flatten gal took : 13 ms
[2024-05-31 05:22:40] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:22:40] [INFO ] Time to serialize gal into /tmp/LTL17288012107204242238.gal : 2 ms
[2024-05-31 05:22:40] [INFO ] Time to serialize properties into /tmp/LTL2032509634550916592.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/LTL17288012107204242238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2032509634550916592.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("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...1216
Formula 0 simplified : X(G!"(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colu...1208
Detected timeout of ITS tools.
[2024-05-31 05:22:55] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:22:55] [INFO ] Applying decomposition
[2024-05-31 05:22:55] [INFO ] Flatten gal took : 12 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/graph5241050723387185553.txt' '-o' '/tmp/graph5241050723387185553.bin' '-w' '/tmp/graph5241050723387185553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5241050723387185553.bin' '-l' '-1' '-v' '-w' '/tmp/graph5241050723387185553.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:22:55] [INFO ] Decomposing Gal with order
[2024-05-31 05:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:22:55] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-31 05:22:55] [INFO ] Flatten gal took : 71 ms
[2024-05-31 05:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 05:22:55] [INFO ] Time to serialize gal into /tmp/LTL6778283432504648164.gal : 3 ms
[2024-05-31 05:22:55] [INFO ] Time to serialize properties into /tmp/LTL12853764273741037534.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/LTL6778283432504648164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12853764273741037534.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("(((((((gu37.Columns_0+gu37.Columns_1)+(gu37.Columns_2+gu37.Columns_3))+((gu37.Columns_4+gu37.Columns_5)+(gu37.Columns_6+gu37....1684
Formula 0 simplified : X(G!"(((((((gu37.Columns_0+gu37.Columns_1)+(gu37.Columns_2+gu37.Columns_3))+((gu37.Columns_4+gu37.Columns_5)+(gu37.Columns_6+gu37.Co...1676
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17555212117604557576
[2024-05-31 05:23:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17555212117604557576
Running compilation step : cd /tmp/ltsmin17555212117604557576;'/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 352 ms.
Running link step : cd /tmp/ltsmin17555212117604557576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17555212117604557576;'/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))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN06-LTLCardinality-03 finished in 117586 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 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 05:23:25] [INFO ] Computed 108 invariants in 7 ms
[2024-05-31 05:23:26] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 05:23:26] [INFO ] Invariant cache hit.
[2024-05-31 05:23:26] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-31 05:23:26] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:23:26] [INFO ] Invariant cache hit.
[2024-05-31 05:23:26] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s7...], 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 5000 reset in 2291 ms.
Product exploration explored 100000 steps with 5000 reset in 2318 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 88 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 39 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 118 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-31 05:23:31] [INFO ] Invariant cache hit.
[2024-05-31 05:23:32] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2024-05-31 05:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:32] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-31 05:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:23:32] [INFO ] [Nat]Absence check using 108 positive place invariants in 90 ms returned sat
[2024-05-31 05:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:32] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2024-05-31 05:23:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 05:23:32] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:23:32] [INFO ] Invariant cache hit.
[2024-05-31 05:23:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 05:23:33] [INFO ] Invariant cache hit.
[2024-05-31 05:23:33] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-31 05:23:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 05:23:33] [INFO ] Invariant cache hit.
[2024-05-31 05:23:33] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 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 29 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 109 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-31 05:23:34] [INFO ] Invariant cache hit.
[2024-05-31 05:23:34] [INFO ] [Real]Absence check using 108 positive place invariants in 32 ms returned sat
[2024-05-31 05:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:34] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-31 05:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:23:34] [INFO ] [Nat]Absence check using 108 positive place invariants in 81 ms returned sat
[2024-05-31 05:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:35] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-31 05:23:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 05:23:35] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2257 ms.
Product exploration explored 100000 steps with 5000 reset in 2304 ms.
Built C files in :
/tmp/ltsmin17211303359166055565
[2024-05-31 05:23:39] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:23:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:39] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:23:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:39] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:23:39] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:39] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17211303359166055565
Running compilation step : cd /tmp/ltsmin17211303359166055565;'/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 496 ms.
Running link step : cd /tmp/ltsmin17211303359166055565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17211303359166055565;'/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/stateBased10395114103343628117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:23:55] [INFO ] Invariant cache hit.
[2024-05-31 05:23:55] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-31 05:23:55] [INFO ] Invariant cache hit.
[2024-05-31 05:23:55] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-31 05:23:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:23:55] [INFO ] Invariant cache hit.
[2024-05-31 05:23:55] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin1189072900091921664
[2024-05-31 05:23:55] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:23:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:55] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:23:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:55] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:23:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:23:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1189072900091921664
Running compilation step : cd /tmp/ltsmin1189072900091921664;'/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 514 ms.
Running link step : cd /tmp/ltsmin1189072900091921664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1189072900091921664;'/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/stateBased12278909413529103209.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:24:10] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:24:10] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:24:10] [INFO ] Time to serialize gal into /tmp/LTL10090241580699672136.gal : 2 ms
[2024-05-31 05:24:10] [INFO ] Time to serialize properties into /tmp/LTL6763163097544400605.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/LTL10090241580699672136.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10470338949836095018.hoa' '-atoms' '/tmp/LTL6763163097544400605.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/LTL6763163097544400605.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10470338949836095018.hoa
Detected timeout of ITS tools.
[2024-05-31 05:24:25] [INFO ] Flatten gal took : 14 ms
[2024-05-31 05:24:25] [INFO ] Flatten gal took : 25 ms
[2024-05-31 05:24:25] [INFO ] Time to serialize gal into /tmp/LTL10956121184731428189.gal : 3 ms
[2024-05-31 05:24:25] [INFO ] Time to serialize properties into /tmp/LTL265374524418421721.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/LTL10956121184731428189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL265374524418421721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...2860
Formula 0 simplified : G!"(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Bo...2856
Detected timeout of ITS tools.
[2024-05-31 05:24:40] [INFO ] Flatten gal took : 16 ms
[2024-05-31 05:24:40] [INFO ] Applying decomposition
[2024-05-31 05:24:40] [INFO ] Flatten gal took : 11 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/graph8290848058519169846.txt' '-o' '/tmp/graph8290848058519169846.bin' '-w' '/tmp/graph8290848058519169846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8290848058519169846.bin' '-l' '-1' '-v' '-w' '/tmp/graph8290848058519169846.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:24:40] [INFO ] Decomposing Gal with order
[2024-05-31 05:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:24:40] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-31 05:24:40] [INFO ] Flatten gal took : 49 ms
[2024-05-31 05:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 6 ms.
[2024-05-31 05:24:41] [INFO ] Time to serialize gal into /tmp/LTL8995154723398056306.gal : 4 ms
[2024-05-31 05:24:41] [INFO ] Time to serialize properties into /tmp/LTL2335409955035683584.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8995154723398056306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2335409955035683584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((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.Board...3868
Formula 0 simplified : G!"(((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Board_...3864
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11748554128667496893
[2024-05-31 05:24:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11748554128667496893
Running compilation step : cd /tmp/ltsmin11748554128667496893;'/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 414 ms.
Running link step : cd /tmp/ltsmin11748554128667496893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11748554128667496893;'/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-AN06-LTLCardinality-05 finished in 105305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.3 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 05:25:11] [INFO ] Computed 17 invariants in 12 ms
[2024-05-31 05:25:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 05:25:11] [INFO ] Invariant cache hit.
[2024-05-31 05:25:11] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-31 05:25:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:25:11] [INFO ] Invariant cache hit.
[2024-05-31 05:25:11] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-06 finished in 381 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 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 05:25:11] [INFO ] Computed 108 invariants in 2 ms
[2024-05-31 05:25:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 05:25:11] [INFO ] Invariant cache hit.
[2024-05-31 05:25:11] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-31 05:25:11] [INFO ] Invariant cache hit.
[2024-05-31 05:25:11] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-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:(GT (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s3...], 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 1992 ms.
Product exploration explored 100000 steps with 50000 reset in 2013 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 14 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-AN06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-07 finished in 5077 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))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:25:16] [INFO ] Invariant cache hit.
[2024-05-31 05:25:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 05:25:16] [INFO ] Invariant cache hit.
[2024-05-31 05:25:16] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 05:25:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:25:16] [INFO ] Invariant cache hit.
[2024-05-31 05:25:17] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-09 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:25:17] [INFO ] Invariant cache hit.
[2024-05-31 05:25:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 05:25:17] [INFO ] Invariant cache hit.
[2024-05-31 05:25:17] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-31 05:25:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:25:17] [INFO ] Invariant cache hit.
[2024-05-31 05:25:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5000 reset in 2254 ms.
Product exploration explored 100000 steps with 5000 reset in 2328 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-31 05:25:22] [INFO ] Invariant cache hit.
[2024-05-31 05:25:23] [INFO ] [Real]Absence check using 108 positive place invariants in 25 ms returned sat
[2024-05-31 05:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:25:23] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-31 05:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:25:23] [INFO ] [Nat]Absence check using 108 positive place invariants in 96 ms returned sat
[2024-05-31 05:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:25:24] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-05-31 05:25:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 05:25:24] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:25:24] [INFO ] Invariant cache hit.
[2024-05-31 05:25:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 05:25:24] [INFO ] Invariant cache hit.
[2024-05-31 05:25:24] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-31 05:25:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:25:24] [INFO ] Invariant cache hit.
[2024-05-31 05:25:24] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
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 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-31 05:25:25] [INFO ] Invariant cache hit.
[2024-05-31 05:25:25] [INFO ] [Real]Absence check using 108 positive place invariants in 23 ms returned sat
[2024-05-31 05:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:25:25] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-31 05:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:25:26] [INFO ] [Nat]Absence check using 108 positive place invariants in 95 ms returned sat
[2024-05-31 05:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:25:26] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-31 05:25:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 05:25:26] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2251 ms.
Product exploration explored 100000 steps with 5000 reset in 2315 ms.
Built C files in :
/tmp/ltsmin15070587950372493336
[2024-05-31 05:25:31] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:25:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:31] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:25:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:31] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:25:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070587950372493336
Running compilation step : cd /tmp/ltsmin15070587950372493336;'/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 527 ms.
Running link step : cd /tmp/ltsmin15070587950372493336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15070587950372493336;'/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/stateBased6137171722056284853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:25:46] [INFO ] Invariant cache hit.
[2024-05-31 05:25:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-31 05:25:46] [INFO ] Invariant cache hit.
[2024-05-31 05:25:46] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-31 05:25:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:25:46] [INFO ] Invariant cache hit.
[2024-05-31 05:25:46] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin12298875558980368164
[2024-05-31 05:25:46] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:25:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:46] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:25:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:46] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:25:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:25:46] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12298875558980368164
Running compilation step : cd /tmp/ltsmin12298875558980368164;'/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 471 ms.
Running link step : cd /tmp/ltsmin12298875558980368164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12298875558980368164;'/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/stateBased7810832175205036982.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:26:01] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:26:01] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:26:01] [INFO ] Time to serialize gal into /tmp/LTL13372841269044750298.gal : 3 ms
[2024-05-31 05:26:01] [INFO ] Time to serialize properties into /tmp/LTL5007184463616852351.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/LTL13372841269044750298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14243631202779167605.hoa' '-atoms' '/tmp/LTL5007184463616852351.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/LTL5007184463616852351.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14243631202779167605.hoa
Detected timeout of ITS tools.
[2024-05-31 05:26:16] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:26:17] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:26:17] [INFO ] Time to serialize gal into /tmp/LTL9786175152085630321.gal : 2 ms
[2024-05-31 05:26:17] [INFO ] Time to serialize properties into /tmp/LTL10196968197374065458.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/LTL9786175152085630321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10196968197374065458.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...2971
Formula 0 simplified : FG!"(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...2965
Detected timeout of ITS tools.
[2024-05-31 05:26:32] [INFO ] Flatten gal took : 14 ms
[2024-05-31 05:26:32] [INFO ] Applying decomposition
[2024-05-31 05:26:32] [INFO ] Flatten gal took : 10 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/graph5543782110466636607.txt' '-o' '/tmp/graph5543782110466636607.bin' '-w' '/tmp/graph5543782110466636607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5543782110466636607.bin' '-l' '-1' '-v' '-w' '/tmp/graph5543782110466636607.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:26:32] [INFO ] Decomposing Gal with order
[2024-05-31 05:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:26:32] [INFO ] Removed a total of 258 redundant transitions.
[2024-05-31 05:26:32] [INFO ] Flatten gal took : 43 ms
[2024-05-31 05:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 4 ms.
[2024-05-31 05:26:32] [INFO ] Time to serialize gal into /tmp/LTL17549821213675515425.gal : 2 ms
[2024-05-31 05:26:32] [INFO ] Time to serialize properties into /tmp/LTL157701645909705127.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/LTL17549821213675515425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL157701645909705127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((gu51.Board_0+gu51.Board_1)+(gu51.Board_2+gu51.Board_3))+((gu51.Board_4+gu51.Board_5)+(gu51.Board_6+gu51.Board_7)))+((...4231
Formula 0 simplified : FG!"(((((((((gu51.Board_0+gu51.Board_1)+(gu51.Board_2+gu51.Board_3))+((gu51.Board_4+gu51.Board_5)+(gu51.Board_6+gu51.Board_7)))+(((g...4225
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2691257249184951669
[2024-05-31 05:26:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2691257249184951669
Running compilation step : cd /tmp/ltsmin2691257249184951669;'/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 411 ms.
Running link step : cd /tmp/ltsmin2691257249184951669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2691257249184951669;'/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-AN06-LTLCardinality-10 finished in 105271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 05:27:02] [INFO ] Computed 17 invariants in 3 ms
[2024-05-31 05:27:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 05:27:02] [INFO ] Invariant cache hit.
[2024-05-31 05:27:02] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-31 05:27:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:27:02] [INFO ] Invariant cache hit.
[2024-05-31 05:27:02] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 38 ms :[false]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3183 reset in 1348 ms.
Product exploration explored 100000 steps with 3185 reset in 1332 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-12 finished in 3226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 216 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 05:27:05] [INFO ] Computed 108 invariants in 4 ms
[2024-05-31 05:27:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-31 05:27:05] [INFO ] Invariant cache hit.
[2024-05-31 05:27:06] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-31 05:27:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:27:06] [INFO ] Invariant cache hit.
[2024-05-31 05:27:06] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3184 reset in 1977 ms.
Product exploration explored 100000 steps with 3183 reset in 2040 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 84 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 p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 92 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-31 05:27:10] [INFO ] Invariant cache hit.
[2024-05-31 05:27:11] [INFO ] [Real]Absence check using 108 positive place invariants in 22 ms returned sat
[2024-05-31 05:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:27:11] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 05:27:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:27:11] [INFO ] [Nat]Absence check using 108 positive place invariants in 36 ms returned sat
[2024-05-31 05:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:27:13] [INFO ] [Nat]Absence check using state equation in 1572 ms returned sat
[2024-05-31 05:27:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 05:27:13] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 216 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:27:13] [INFO ] Invariant cache hit.
[2024-05-31 05:27:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 05:27:13] [INFO ] Invariant cache hit.
[2024-05-31 05:27:13] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-31 05:27:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:27:13] [INFO ] Invariant cache hit.
[2024-05-31 05:27:13] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 78 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 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 112 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 p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-31 05:27:14] [INFO ] Invariant cache hit.
[2024-05-31 05:27:14] [INFO ] [Real]Absence check using 108 positive place invariants in 23 ms returned sat
[2024-05-31 05:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:27:14] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-31 05:27:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:27:15] [INFO ] [Nat]Absence check using 108 positive place invariants in 39 ms returned sat
[2024-05-31 05:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:27:16] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2024-05-31 05:27:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 05:27:16] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3187 reset in 1986 ms.
Product exploration explored 100000 steps with 3189 reset in 2022 ms.
Built C files in :
/tmp/ltsmin5757883139226486045
[2024-05-31 05:27:20] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:27:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:20] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:27:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:20] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:27:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5757883139226486045
Running compilation step : cd /tmp/ltsmin5757883139226486045;'/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 472 ms.
Running link step : cd /tmp/ltsmin5757883139226486045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5757883139226486045;'/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/stateBased11707302173273630419.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 216 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 05:27:35] [INFO ] Invariant cache hit.
[2024-05-31 05:27:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 05:27:36] [INFO ] Invariant cache hit.
[2024-05-31 05:27:36] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-31 05:27:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:27:36] [INFO ] Invariant cache hit.
[2024-05-31 05:27:36] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin12490666093712032509
[2024-05-31 05:27:36] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:27:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:36] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:27:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:36] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:27:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:27:36] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12490666093712032509
Running compilation step : cd /tmp/ltsmin12490666093712032509;'/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 479 ms.
Running link step : cd /tmp/ltsmin12490666093712032509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12490666093712032509;'/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/stateBased12855269878983888581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:27:51] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:27:51] [INFO ] Flatten gal took : 9 ms
[2024-05-31 05:27:51] [INFO ] Time to serialize gal into /tmp/LTL1330693794785022963.gal : 2 ms
[2024-05-31 05:27:51] [INFO ] Time to serialize properties into /tmp/LTL14036260369473083570.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/LTL1330693794785022963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1444363521651712437.hoa' '-atoms' '/tmp/LTL14036260369473083570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14036260369473083570.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1444363521651712437.hoa
Detected timeout of ITS tools.
[2024-05-31 05:28:06] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:28:06] [INFO ] Flatten gal took : 9 ms
[2024-05-31 05:28:06] [INFO ] Time to serialize gal into /tmp/LTL8406909549342240730.gal : 1 ms
[2024-05-31 05:28:06] [INFO ] Time to serialize properties into /tmp/LTL7681639938303349903.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8406909549342240730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7681639938303349903.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...2518
Formula 0 simplified : GF!"(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...2512
Detected timeout of ITS tools.
[2024-05-31 05:28:21] [INFO ] Flatten gal took : 23 ms
[2024-05-31 05:28:21] [INFO ] Applying decomposition
[2024-05-31 05:28:21] [INFO ] Flatten gal took : 9 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/graph11622676765428867672.txt' '-o' '/tmp/graph11622676765428867672.bin' '-w' '/tmp/graph11622676765428867672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11622676765428867672.bin' '-l' '-1' '-v' '-w' '/tmp/graph11622676765428867672.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:28:21] [INFO ] Decomposing Gal with order
[2024-05-31 05:28:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:28:21] [INFO ] Removed a total of 379 redundant transitions.
[2024-05-31 05:28:21] [INFO ] Flatten gal took : 28 ms
[2024-05-31 05:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-31 05:28:21] [INFO ] Time to serialize gal into /tmp/LTL4503837158101983109.gal : 2 ms
[2024-05-31 05:28:21] [INFO ] Time to serialize properties into /tmp/LTL9742285119456477247.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/LTL4503837158101983109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9742285119456477247.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((gu34.Board_0+gu34.Board_1)+(gu34.Board_2+gu34.Board_3))+((gu34.Board_4+gu34.Board_5)+(gu34.Board_6+gu34.Board_7)))+((...3598
Formula 0 simplified : GF!"(((((((((gu34.Board_0+gu34.Board_1)+(gu34.Board_2+gu34.Board_3))+((gu34.Board_4+gu34.Board_5)+(gu34.Board_6+gu34.Board_7)))+(((g...3592
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17610995615509542561
[2024-05-31 05:28:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17610995615509542561
Running compilation step : cd /tmp/ltsmin17610995615509542561;'/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 414 ms.
Running link step : cd /tmp/ltsmin17610995615509542561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17610995615509542561;'/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-AN06-LTLCardinality-13 finished in 106374 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)||(p1&&G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-31 05:28:52] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7933778620205886895
[2024-05-31 05:28:52] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 05:28:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:28:52] [INFO ] Applying decomposition
[2024-05-31 05:28:52] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 05:28:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:28:52] [INFO ] Flatten gal took : 9 ms
[2024-05-31 05:28:52] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 05:28:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:28:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7933778620205886895
Running compilation step : cd /tmp/ltsmin7933778620205886895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14160160982481794061.txt' '-o' '/tmp/graph14160160982481794061.bin' '-w' '/tmp/graph14160160982481794061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14160160982481794061.bin' '-l' '-1' '-v' '-w' '/tmp/graph14160160982481794061.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:28:52] [INFO ] Decomposing Gal with order
[2024-05-31 05:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:28:52] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-31 05:28:52] [INFO ] Flatten gal took : 51 ms
[2024-05-31 05:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-31 05:28:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality12748995879194687458.gal : 3 ms
[2024-05-31 05:28:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality1524547432233015139.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/LTLCardinality12748995879194687458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1524547432233015139.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 4 LTL properties
Checking formula 0 : !((X((F("(((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_...1648
Formula 0 simplified : X(G!"(((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_7)...1640
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin7933778620205886895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7933778620205886895;'/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))||((LTLAPp1==true)&&[]((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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
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( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: LTL layer: formula: X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))
pins2lts-mc-linux64( 5/ 8), 0.005: "X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.097: DFS-FIFO for weak LTL, using special progress label 223
pins2lts-mc-linux64( 0/ 8), 0.097: There are 224 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.097: State length is 325, there are 223 groups
pins2lts-mc-linux64( 0/ 8), 0.097: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.097: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.097: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.097: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.962: ~1 levels ~960 states ~179056 transitions
pins2lts-mc-linux64( 7/ 8), 1.355: ~1 levels ~1920 states ~356464 transitions
pins2lts-mc-linux64( 7/ 8), 2.028: ~1 levels ~3840 states ~711152 transitions
pins2lts-mc-linux64( 7/ 8), 2.895: ~1 levels ~7680 states ~1420752 transitions
pins2lts-mc-linux64( 7/ 8), 4.229: ~1 levels ~15360 states ~2839488 transitions
pins2lts-mc-linux64( 1/ 8), 6.639: ~1 levels ~30720 states ~5195600 transitions
pins2lts-mc-linux64( 1/ 8), 10.938: ~1 levels ~61440 states ~9974416 transitions
pins2lts-mc-linux64( 1/ 8), 19.921: ~1 levels ~122880 states ~19631584 transitions
pins2lts-mc-linux64( 1/ 8), 35.440: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 38.027:
pins2lts-mc-linux64( 0/ 8), 38.027: mean standard work distribution: 3.3% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 38.027:
pins2lts-mc-linux64( 0/ 8), 38.027: Explored 199867 states 33356577 transitions, fanout: 166.894
pins2lts-mc-linux64( 0/ 8), 38.027: Total exploration time 37.910 sec (36.030 sec minimum, 37.217 sec on average)
pins2lts-mc-linux64( 0/ 8), 38.027: States per second: 5272, Transitions per second: 879889
pins2lts-mc-linux64( 0/ 8), 38.027:
pins2lts-mc-linux64( 0/ 8), 38.027: Progress states detected: 14229121
pins2lts-mc-linux64( 0/ 8), 38.027: Redundant explorations: -98.5954
pins2lts-mc-linux64( 0/ 8), 38.027:
pins2lts-mc-linux64( 0/ 8), 38.027: Queue width: 8B, total height: 18393632, memory: 140.33MB
pins2lts-mc-linux64( 0/ 8), 38.027: Tree memory: 364.6MB, 26.9 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 38.027: Tree fill ratio (roots/leafs): 10.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 38.027: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 38.027: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 38.027: Est. total memory use: 504.9MB (~1164.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7933778620205886895;'/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))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7933778620205886895;'/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))||((LTLAPp1==true)&&[]((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 05:51:52] [INFO ] Applying decomposition
[2024-05-31 05:51:52] [INFO ] Flatten gal took : 77 ms
[2024-05-31 05:51:52] [INFO ] Decomposing Gal with order
[2024-05-31 05:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:51:53] [INFO ] Removed a total of 402 redundant transitions.
[2024-05-31 05:51:53] [INFO ] Flatten gal took : 235 ms
[2024-05-31 05:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-31 05:51:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality790141963604829381.gal : 23 ms
[2024-05-31 05:51:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality3538786434512373610.ltl : 12 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/LTLCardinality790141963604829381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3538786434512373610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 4 LTL properties
Checking formula 0 : !((X((F("(((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7....1834
Formula 0 simplified : X(G!"(((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Co...1826
Detected timeout of ITS tools.
[2024-05-31 06:14:38] [INFO ] Flatten gal took : 294 ms
[2024-05-31 06:14:39] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-31 06:14:39] [INFO ] Transformed 324 places.
[2024-05-31 06:14:39] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 06:14:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9918256656049648894.gal : 19 ms
[2024-05-31 06:14:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality12858837725766172785.ltl : 12 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/LTLCardinality9918256656049648894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12858837725766172785.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...1216
Formula 0 simplified : X(G!"(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colu...1208
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6153220 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035456 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN06"
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-AN06, 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-171690556100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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