Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545300075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 7.7K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 30 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 11:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653062535669

Running Version 202205111006
[2022-05-20 16:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:02:16] [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.
[2022-05-20 16:02:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 16:02:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 517 ms
[2022-05-20 16:02:17] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 16:02:17] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 7 ms.
[2022-05-20 16:02:17] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-13 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 10016 steps, including 370 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 16:02:17] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-20 16:02:18] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-20 16:02:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 16:02:18] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 16:02:18] [INFO ] Flatten gal took : 12 ms
[2022-05-20 16:02:18] [INFO ] Flatten gal took : 2 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2022-05-20 16:02:18] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 9 ms.
[2022-05-20 16:02:18] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:18] [INFO ] Computed 75 place invariants in 9 ms
[2022-05-20 16:02:18] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:18] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:02:18] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:18] [INFO ] Computed 75 place invariants in 7 ms
[2022-05-20 16:02:18] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2022-05-20 16:02:18] [INFO ] Flatten gal took : 22 ms
[2022-05-20 16:02:18] [INFO ] Flatten gal took : 19 ms
[2022-05-20 16:02:18] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:19] [INFO ] Computed 75 place invariants in 9 ms
[2022-05-20 16:02:19] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-20 16:02:19] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-20 16:02:19] [INFO ] After 73ms 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.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||G(X(p1))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:19] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:19] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:19] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:19] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:19] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:19] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-00 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}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 998 steps with 45 reset in 34 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-00 finished in 699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:02:20] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 5 ms
[2022-05-20 16:02:20] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 3 (ADD s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199)), p0:(AND (LE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 217 steps with 9 reset in 7 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-01 finished in 481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(!X(X(!p0))||p1))) U (p1 U p2))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:20] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:20] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:20] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:20] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22184 reset in 2095 ms.
Product exploration explored 100000 steps with 22276 reset in 2059 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) p0)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 785 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:26] [INFO ] Computed 75 place invariants in 4 ms
[2022-05-20 16:02:27] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 16:02:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 10 ms returned sat
[2022-05-20 16:02:27] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) p0)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2)]
Knowledge based reduction with 15 factoid took 1026 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:28] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-20 16:02:28] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2022-05-20 16:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:02:28] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 16:02:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:02:29] [INFO ] [Nat]Absence check using 75 positive place invariants in 49 ms returned sat
[2022-05-20 16:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:02:29] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 16:02:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-20 16:02:29] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:29] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:29] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:29] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:29] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-20 16:02:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 688 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2312 steps, including 104 resets, run visited all 4 properties in 25 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 12 factoid took 743 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:32] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:32] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-20 16:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:02:32] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-20 16:02:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:02:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 48 ms returned sat
[2022-05-20 16:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:02:32] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-05-20 16:02:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-20 16:02:32] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22125 reset in 1805 ms.
Product exploration explored 100000 steps with 22160 reset in 1792 ms.
Built C files in :
/tmp/ltsmin14784768450831349222
[2022-05-20 16:02:36] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14784768450831349222
Running compilation step : cd /tmp/ltsmin14784768450831349222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin14784768450831349222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14784768450831349222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased607837182296693683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:51] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-20 16:02:51] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:51] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:02:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:02:52] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-20 16:02:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin14098923719429416952
[2022-05-20 16:02:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14098923719429416952
Running compilation step : cd /tmp/ltsmin14098923719429416952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin14098923719429416952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14098923719429416952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12986672431207202622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:03:07] [INFO ] Flatten gal took : 21 ms
[2022-05-20 16:03:07] [INFO ] Flatten gal took : 14 ms
[2022-05-20 16:03:07] [INFO ] Time to serialize gal into /tmp/LTL17047007552582198113.gal : 3 ms
[2022-05-20 16:03:07] [INFO ] Time to serialize properties into /tmp/LTL17142086634021218587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17047007552582198113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17142086634021218587.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1704700...268
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...5765
Formula 0 simplified : !G(F("((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colu...5751
Detected timeout of ITS tools.
[2022-05-20 16:03:22] [INFO ] Flatten gal took : 11 ms
[2022-05-20 16:03:22] [INFO ] Applying decomposition
[2022-05-20 16:03:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11540408234491642277.txt' '-o' '/tmp/graph11540408234491642277.bin' '-w' '/tmp/graph11540408234491642277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11540408234491642277.bin' '-l' '-1' '-v' '-w' '/tmp/graph11540408234491642277.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:03:22] [INFO ] Decomposing Gal with order
[2022-05-20 16:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:03:22] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-20 16:03:22] [INFO ] Flatten gal took : 177 ms
[2022-05-20 16:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 16:03:22] [INFO ] Time to serialize gal into /tmp/LTL17117881972746803999.gal : 2 ms
[2022-05-20 16:03:22] [INFO ] Time to serialize properties into /tmp/LTL14552671315601437649.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17117881972746803999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14552671315601437649.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1711788...268
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_...9365
Formula 0 simplified : !G(F("((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_7)...9351
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10373038862702611734
[2022-05-20 16:03:37] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10373038862702611734
Running compilation step : cd /tmp/ltsmin10373038862702611734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin10373038862702611734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10373038862702611734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 92302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:53] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-20 16:03:53] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:53] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:03:53] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2022-05-20 16:03:53] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:53] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-20 16:03:53] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06 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 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], 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 4548 reset in 1122 ms.
Product exploration explored 100000 steps with 4538 reset in 1132 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:56] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:03:56] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2022-05-20 16:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:03:56] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-20 16:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:03:56] [INFO ] [Nat]Absence check using 75 positive place invariants in 23 ms returned sat
[2022-05-20 16:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:03:56] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-20 16:03:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-20 16:03:56] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:56] [INFO ] Computed 75 place invariants in 0 ms
[2022-05-20 16:03:56] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:56] [INFO ] Computed 75 place invariants in 3 ms
[2022-05-20 16:03:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2022-05-20 16:03:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:57] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:03:57] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:03:57] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:03:57] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2022-05-20 16:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:03:57] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-20 16:03:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:03:58] [INFO ] [Nat]Absence check using 75 positive place invariants in 23 ms returned sat
[2022-05-20 16:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:03:58] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-20 16:03:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-20 16:03:58] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4546 reset in 1128 ms.
Product exploration explored 100000 steps with 4551 reset in 1170 ms.
Built C files in :
/tmp/ltsmin5245017162074763597
[2022-05-20 16:04:00] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-20 16:04:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:00] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-20 16:04:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:00] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-20 16:04:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5245017162074763597
Running compilation step : cd /tmp/ltsmin5245017162074763597;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin5245017162074763597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5245017162074763597;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11811625197278668409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 25 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:04:15] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:04:16] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:04:16] [INFO ] Computed 75 place invariants in 4 ms
[2022-05-20 16:04:16] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-20 16:04:16] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:04:16] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:04:16] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin16291892266807580548
[2022-05-20 16:04:16] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-20 16:04:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:16] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-20 16:04:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:16] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-20 16:04:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:04:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16291892266807580548
Running compilation step : cd /tmp/ltsmin16291892266807580548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin16291892266807580548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16291892266807580548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13518597204304791337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:04:31] [INFO ] Flatten gal took : 17 ms
[2022-05-20 16:04:31] [INFO ] Flatten gal took : 13 ms
[2022-05-20 16:04:31] [INFO ] Time to serialize gal into /tmp/LTL12135770008361674362.gal : 2 ms
[2022-05-20 16:04:31] [INFO ] Time to serialize properties into /tmp/LTL7857505066886457832.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12135770008361674362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7857505066886457832.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1213577...267
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))+((...1426
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))+((Bo...1420
Detected timeout of ITS tools.
[2022-05-20 16:04:46] [INFO ] Flatten gal took : 15 ms
[2022-05-20 16:04:46] [INFO ] Applying decomposition
[2022-05-20 16:04:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1659090515189417570.txt' '-o' '/tmp/graph1659090515189417570.bin' '-w' '/tmp/graph1659090515189417570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1659090515189417570.bin' '-l' '-1' '-v' '-w' '/tmp/graph1659090515189417570.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:04:46] [INFO ] Decomposing Gal with order
[2022-05-20 16:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:04:46] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-20 16:04:46] [INFO ] Flatten gal took : 33 ms
[2022-05-20 16:04:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2022-05-20 16:04:46] [INFO ] Time to serialize gal into /tmp/LTL15326688937132582151.gal : 1 ms
[2022-05-20 16:04:46] [INFO ] Time to serialize properties into /tmp/LTL8599016466993570598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15326688937132582151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8599016466993570598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1532668...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Boar...1926
Formula 0 simplified : !FG"((((((((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_...1920
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin984221178192994865
[2022-05-20 16:05:01] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin984221178192994865
Running compilation step : cd /tmp/ltsmin984221178192994865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin984221178192994865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin984221178192994865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-AN05-LTLCardinality-06 finished in 83699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F(p1)&&p0)))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:16] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:05:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:16] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:05:16] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:16] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:05:17] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-07 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !X(p0))))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.2 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-20 16:05:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 11 ms
[2022-05-20 16:05:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((F(p0)&&p1)))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:17] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:17] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-20 16:05:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:05:17] [INFO ] Computed 75 place invariants in 2 ms
[2022-05-20 16:05:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U G(!p2))||G(F(G(p3)))))'
Support contains 75 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.1 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-20 16:05:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-20 16:05:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p2 (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p3 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p3 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p3, acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4548 reset in 1102 ms.
Product exploration explored 100000 steps with 4550 reset in 1101 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 p3 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 p3 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (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)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 1967 ms. Reduced automaton from 6 states, 22 edges and 4 AP to 6 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 453 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:23] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 16:05:23] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-20 16:05:23] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2022-05-20 16:05:23] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-20 16:05:23] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3) p1)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 p3 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 p3 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (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)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p3 p1 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p3 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) p1 (NOT p2)))), (F (AND (NOT p3) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT p0)), (F p2), (F p3), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 51 factoid took 2264 ms. Reduced automaton from 6 states, 22 edges and 4 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:26] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 16:05:26] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:26] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 p3) p1 p0), (X p1), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) p1)), (X (X p1)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 519 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Finished random walk after 110 steps, including 4 resets, run visited all 4 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p3) p1 p0), (X p1), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) p1)), (X (X p1)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p3) p1))), (F (AND p3 (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 539 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4544 reset in 828 ms.
Product exploration explored 100000 steps with 4546 reset in 842 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2022-05-20 16:05:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Product exploration explored 100000 steps with 4548 reset in 917 ms.
Product exploration explored 100000 steps with 4544 reset in 884 ms.
Built C files in :
/tmp/ltsmin3941738332622068742
[2022-05-20 16:05:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3941738332622068742
Running compilation step : cd /tmp/ltsmin3941738332622068742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin3941738332622068742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3941738332622068742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3885314219682121820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:46] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 16:05:46] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:46] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:46] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:05:46] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:05:46] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin18379113970479031262
[2022-05-20 16:05:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18379113970479031262
Running compilation step : cd /tmp/ltsmin18379113970479031262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 253 ms.
Running link step : cd /tmp/ltsmin18379113970479031262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18379113970479031262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1566535351285448791.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:06:01] [INFO ] Flatten gal took : 8 ms
[2022-05-20 16:06:01] [INFO ] Flatten gal took : 7 ms
[2022-05-20 16:06:01] [INFO ] Time to serialize gal into /tmp/LTL6520057089183096110.gal : 1 ms
[2022-05-20 16:06:01] [INFO ] Time to serialize properties into /tmp/LTL17974909407427432545.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6520057089183096110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17974909407427432545.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6520057...267
Read 1 LTL properties
Checking formula 0 : !((((G("((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1158
Formula 0 simplified : !(G"((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cell...1142
Detected timeout of ITS tools.
[2022-05-20 16:06:17] [INFO ] Flatten gal took : 7 ms
[2022-05-20 16:06:17] [INFO ] Applying decomposition
[2022-05-20 16:06:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3668187103218494186.txt' '-o' '/tmp/graph3668187103218494186.bin' '-w' '/tmp/graph3668187103218494186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3668187103218494186.bin' '-l' '-1' '-v' '-w' '/tmp/graph3668187103218494186.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:06:17] [INFO ] Decomposing Gal with order
[2022-05-20 16:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:06:17] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 16:06:17] [INFO ] Flatten gal took : 29 ms
[2022-05-20 16:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 16:06:17] [INFO ] Time to serialize gal into /tmp/LTL3216980302664379080.gal : 1 ms
[2022-05-20 16:06:17] [INFO ] Time to serialize properties into /tmp/LTL4995903016234934652.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3216980302664379080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4995903016234934652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3216980...266
Read 1 LTL properties
Checking formula 0 : !((((G("((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells_...1558
Formula 0 simplified : !(G"((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells_8+...1542
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10533578617303624298
[2022-05-20 16:06:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10533578617303624298
Running compilation step : cd /tmp/ltsmin10533578617303624298;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin10533578617303624298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10533578617303624298;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||((LTLAPp1==true) U [](!(LTLAPp2==true)))||[](<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 89368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.2 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:06:47] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 16:06:47] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:06:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:06:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-05-20 16:06:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-20 16:06:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 16:06:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1779 steps with 80 reset in 13 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-14 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||p1)))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:06:47] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:06:47] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:06:47] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:06:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-20 16:06:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 125 rows 200 cols
[2022-05-20 16:06:47] [INFO ] Computed 75 place invariants in 1 ms
[2022-05-20 16:06:47] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199) (ADD s25 s26 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(!X(X(!p0))||p1))) U (p1 U p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U G(!p2))||G(F(G(p3)))))'
[2022-05-20 16:06:48] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9876090867048348159
[2022-05-20 16:06:48] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-20 16:06:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:06:48] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-20 16:06:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:06:48] [INFO ] Applying decomposition
[2022-05-20 16:06:48] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-20 16:06:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:06:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9876090867048348159
Running compilation step : cd /tmp/ltsmin9876090867048348159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 16:06:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11148235516386308382.txt' '-o' '/tmp/graph11148235516386308382.bin' '-w' '/tmp/graph11148235516386308382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11148235516386308382.bin' '-l' '-1' '-v' '-w' '/tmp/graph11148235516386308382.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:06:48] [INFO ] Decomposing Gal with order
[2022-05-20 16:06:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:06:48] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 16:06:48] [INFO ] Flatten gal took : 56 ms
[2022-05-20 16:06:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 16:06:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality4860167565664001476.gal : 2 ms
[2022-05-20 16:06:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality7671598806279692694.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4860167565664001476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7671598806279692694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !((G((F(("((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_...7765
Formula 0 simplified : !G(F("((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_7)...7751
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin9876090867048348159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9876090867048348159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.002: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.248: LTL layer: formula: []((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.248: "[]((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.248: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.259: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.265: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.318: DFS-FIFO for weak LTL, using special progress label 134
pins2lts-mc-linux64( 0/ 8), 0.318: There are 135 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.318: State length is 201, there are 138 groups
pins2lts-mc-linux64( 0/ 8), 0.318: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.318: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.318: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.318: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.376: ~3 levels ~960 states ~4792 transitions
pins2lts-mc-linux64( 3/ 8), 0.396: ~3 levels ~1920 states ~5688 transitions
pins2lts-mc-linux64( 4/ 8), 0.442: ~7 levels ~3840 states ~13336 transitions
pins2lts-mc-linux64( 4/ 8), 0.528: ~14 levels ~7680 states ~22016 transitions
pins2lts-mc-linux64( 4/ 8), 0.601: ~14 levels ~15360 states ~35384 transitions
pins2lts-mc-linux64( 4/ 8), 0.766: ~14 levels ~30720 states ~64608 transitions
pins2lts-mc-linux64( 4/ 8), 1.041: ~14 levels ~61440 states ~135392 transitions
pins2lts-mc-linux64( 3/ 8), 1.393: ~14 levels ~122880 states ~326728 transitions
pins2lts-mc-linux64( 3/ 8), 2.168: ~14 levels ~245760 states ~717984 transitions
pins2lts-mc-linux64( 4/ 8), 3.773: ~14 levels ~491520 states ~1488856 transitions
pins2lts-mc-linux64( 0/ 8), 6.330: ~14 levels ~983040 states ~3452728 transitions
pins2lts-mc-linux64( 4/ 8), 10.784: ~14 levels ~1966080 states ~7404880 transitions
pins2lts-mc-linux64( 4/ 8), 19.733: ~14 levels ~3932160 states ~15361432 transitions
pins2lts-mc-linux64( 0/ 8), 40.157: ~14 levels ~7864320 states ~33723200 transitions
pins2lts-mc-linux64( 5/ 8), 82.063: ~14 levels ~15728640 states ~69979696 transitions
pins2lts-mc-linux64( 1/ 8), 110.921: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 111.576:
pins2lts-mc-linux64( 0/ 8), 111.577: mean standard work distribution: 1.8% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 111.577:
pins2lts-mc-linux64( 0/ 8), 111.577: Explored 19031807 states 89923150 transitions, fanout: 4.725
pins2lts-mc-linux64( 0/ 8), 111.577: Total exploration time 111.240 sec (110.600 sec minimum, 110.879 sec on average)
pins2lts-mc-linux64( 0/ 8), 111.577: States per second: 171088, Transitions per second: 808371
pins2lts-mc-linux64( 0/ 8), 111.577:
pins2lts-mc-linux64( 0/ 8), 111.577: Progress states detected: 3
pins2lts-mc-linux64( 0/ 8), 111.577: Redundant explorations: -0.0553
pins2lts-mc-linux64( 0/ 8), 111.577:
pins2lts-mc-linux64( 0/ 8), 111.577: Queue width: 8B, total height: 162, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 111.577: Tree memory: 401.3MB, 22.1 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 111.577: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 111.577: Stored 126 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 111.577: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 111.577: Est. total memory use: 401.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9876090867048348159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9876090867048348159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)&&(!X(X(!(LTLAPp0==true)))||(LTLAPp1==true)))) U ((LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 16:28:52] [INFO ] Applying decomposition
[2022-05-20 16:28:52] [INFO ] Flatten gal took : 112 ms
[2022-05-20 16:28:52] [INFO ] Decomposing Gal with order
[2022-05-20 16:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:28:52] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 16:28:52] [INFO ] Flatten gal took : 124 ms
[2022-05-20 16:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 16:28:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality5300976897537539854.gal : 23 ms
[2022-05-20 16:28:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality13859589008236129798.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5300976897537539854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13859589008236129798.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((G((F(("((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7....9135
Formula 0 simplified : !G(F("((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Co...9121
Detected timeout of ITS tools.
[2022-05-20 16:51:10] [INFO ] Flatten gal took : 237 ms
[2022-05-20 16:51:11] [INFO ] Input system was already deterministic with 125 transitions.
[2022-05-20 16:51:11] [INFO ] Transformed 200 places.
[2022-05-20 16:51:11] [INFO ] Transformed 125 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-20 16:51:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality10843512025500297258.gal : 16 ms
[2022-05-20 16:51:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality14860747549205898556.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10843512025500297258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14860747549205898556.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(("((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...5765
Formula 0 simplified : !G(F("((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colu...5751

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-AN05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN05, 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 r258-tall-165303545300075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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