Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 08:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 26 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-AN07-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679150169868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 14:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 14:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:36:11] [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.
[2023-03-18 14:36:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 14:36:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2023-03-18 14:36:12] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 14:36:12] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 14:36:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-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 10046 steps, including 196 resets, run finished after 63 ms. (steps per millisecond=159 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 28 ms. (steps per millisecond=358 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 18 ms. (steps per millisecond=558 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 14:36:12] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 14:36:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 14:36:12] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-18 14:36:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 14:36:12] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-18 14:36:12] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 14:36:12] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 14:36:12] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 14:36:12] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 14:36:12] [INFO ] Flatten gal took : 2 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2023-03-18 14:36:12] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 16 ms.
[2023-03-18 14:36:12] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 18 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 14:36:12] [INFO ] Computed 147 place invariants in 26 ms
[2023-03-18 14:36:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-18 14:36:12] [INFO ] Invariant cache hit.
[2023-03-18 14:36:13] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-18 14:36:13] [INFO ] Invariant cache hit.
[2023-03-18 14:36:13] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2023-03-18 14:36:13] [INFO ] Flatten gal took : 47 ms
[2023-03-18 14:36:13] [INFO ] Flatten gal took : 36 ms
[2023-03-18 14:36:13] [INFO ] Input system was already deterministic with 343 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 744 ms. (steps per millisecond=13 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 14:36:14] [INFO ] Invariant cache hit.
[2023-03-18 14:36:15] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 14:36:15] [INFO ] [Nat]Absence check using 147 positive place invariants in 26 ms returned sat
[2023-03-18 14:36:16] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-18 14:36:17] [INFO ] After 2453ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 907 ms.
[2023-03-18 14:36:18] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 3 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(p1)))))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:36:18] [INFO ] Invariant cache hit.
[2023-03-18 14:36:19] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 14:36:19] [INFO ] Invariant cache hit.
[2023-03-18 14:36:19] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-18 14:36:19] [INFO ] Invariant cache hit.
[2023-03-18 14:36:19] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (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-AN07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-01 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 24 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:36:19] [INFO ] Invariant cache hit.
[2023-03-18 14:36:20] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-18 14:36:20] [INFO ] Invariant cache hit.
[2023-03-18 14:36:20] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-18 14:36:20] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 14:36:20] [INFO ] Invariant cache hit.
[2023-03-18 14:36:20] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3846 reset in 3688 ms.
Product exploration explored 100000 steps with 3846 reset in 3617 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
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 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2023-03-18 14:36:29] [INFO ] Invariant cache hit.
[2023-03-18 14:36:30] [INFO ] [Real]Absence check using 147 positive place invariants in 36 ms returned sat
[2023-03-18 14:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:36:30] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-18 14:36:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:36:31] [INFO ] [Nat]Absence check using 147 positive place invariants in 225 ms returned sat
[2023-03-18 14:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:36:32] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-18 14:36:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 14:36:32] [INFO ] Added : 0 causal constraints over 0 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 25 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-18 14:36:32] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:33] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 728 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
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 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
[2023-03-18 14:36:34] [INFO ] Invariant cache hit.
[2023-03-18 14:36:35] [INFO ] [Real]Absence check using 147 positive place invariants in 35 ms returned sat
[2023-03-18 14:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:36:35] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-18 14:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:36:36] [INFO ] [Nat]Absence check using 147 positive place invariants in 223 ms returned sat
[2023-03-18 14:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:36:37] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2023-03-18 14:36:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 14:36:37] [INFO ] Added : 0 causal constraints over 0 iterations in 58 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3545 ms.
Product exploration explored 100000 steps with 3846 reset in 3683 ms.
Built C files in :
/tmp/ltsmin5059302908890954677
[2023-03-18 14:36:44] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5059302908890954677
Running compilation step : cd /tmp/ltsmin5059302908890954677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 948 ms.
Running link step : cd /tmp/ltsmin5059302908890954677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5059302908890954677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1525485272362700353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 14 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:36:59] [INFO ] Invariant cache hit.
[2023-03-18 14:36:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-18 14:36:59] [INFO ] Invariant cache hit.
[2023-03-18 14:37:00] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-18 14:37:00] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 14:37:00] [INFO ] Invariant cache hit.
[2023-03-18 14:37:00] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 786 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin6440605270649191632
[2023-03-18 14:37:00] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2023-03-18 14:37:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:37:00] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2023-03-18 14:37:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:37:00] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2023-03-18 14:37:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:37:00] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6440605270649191632
Running compilation step : cd /tmp/ltsmin6440605270649191632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 837 ms.
Running link step : cd /tmp/ltsmin6440605270649191632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6440605270649191632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18239019573414801034.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:37:15] [INFO ] Flatten gal took : 34 ms
[2023-03-18 14:37:15] [INFO ] Flatten gal took : 27 ms
[2023-03-18 14:37:15] [INFO ] Time to serialize gal into /tmp/LTL16794920888921539174.gal : 4 ms
[2023-03-18 14:37:15] [INFO ] Time to serialize properties into /tmp/LTL6348261927547154771.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16794920888921539174.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3389783581631335545.hoa' '-atoms' '/tmp/LTL6348261927547154771.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6348261927547154771.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3389783581631335545.hoa
Detected timeout of ITS tools.
[2023-03-18 14:37:30] [INFO ] Flatten gal took : 24 ms
[2023-03-18 14:37:30] [INFO ] Flatten gal took : 21 ms
[2023-03-18 14:37:30] [INFO ] Time to serialize gal into /tmp/LTL888304672769663092.gal : 3 ms
[2023-03-18 14:37:30] [INFO ] Time to serialize properties into /tmp/LTL17617983896377858949.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL888304672769663092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17617983896377858949.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...4567
Formula 0 simplified : FG!"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...4561
Detected timeout of ITS tools.
[2023-03-18 14:37:45] [INFO ] Flatten gal took : 24 ms
[2023-03-18 14:37:45] [INFO ] Applying decomposition
[2023-03-18 14:37:45] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph68402778009511814.txt' '-o' '/tmp/graph68402778009511814.bin' '-w' '/tmp/graph68402778009511814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph68402778009511814.bin' '-l' '-1' '-v' '-w' '/tmp/graph68402778009511814.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:37:46] [INFO ] Decomposing Gal with order
[2023-03-18 14:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:37:46] [INFO ] Removed a total of 422 redundant transitions.
[2023-03-18 14:37:46] [INFO ] Flatten gal took : 181 ms
[2023-03-18 14:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 13 ms.
[2023-03-18 14:37:46] [INFO ] Time to serialize gal into /tmp/LTL7566160720915074640.gal : 6 ms
[2023-03-18 14:37:46] [INFO ] Time to serialize properties into /tmp/LTL13054174752003460530.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7566160720915074640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13054174752003460530.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((gu69.Cells_0+gu69.Cells_1)+(gu69.Cells_2+gu69.Cells_3))+((gu69.Cells_4+gu69.Cells_5)+(gu69.Cells_6+gu69.Cells_7)))+(((g...6527
Formula 0 simplified : FG!"(((((((gu69.Cells_0+gu69.Cells_1)+(gu69.Cells_2+gu69.Cells_3))+((gu69.Cells_4+gu69.Cells_5)+(gu69.Cells_6+gu69.Cells_7)))+(((gu6...6521
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6910153888433771864
[2023-03-18 14:38:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6910153888433771864
Running compilation step : cd /tmp/ltsmin6910153888433771864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin6910153888433771864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6910153888433771864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-AN07-LTLCardinality-02 finished in 116820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 49 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.5 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2023-03-18 14:38:16] [INFO ] Computed 20 place invariants in 18 ms
[2023-03-18 14:38:16] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-18 14:38:16] [INFO ] Invariant cache hit.
[2023-03-18 14:38:17] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-18 14:38:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 14:38:17] [INFO ] Invariant cache hit.
[2023-03-18 14:38:17] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-03 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 1 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83...], 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 2349 reset in 2033 ms.
Product exploration explored 100000 steps with 2345 reset in 2060 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1185125 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :{}
Probabilistic random walk after 1185125 steps, saw 178907 distinct states, run finished after 3002 ms. (steps per millisecond=394 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 14:38:25] [INFO ] Invariant cache hit.
[2023-03-18 14:38:25] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 14 ms returned sat
[2023-03-18 14:38:25] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 14:38:25] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-18 14:38:26] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 14:38:26] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-18 14:38:26] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 19 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:38:26] [INFO ] Invariant cache hit.
[2023-03-18 14:38:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 14:38:26] [INFO ] Invariant cache hit.
[2023-03-18 14:38:27] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-18 14:38:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 14:38:27] [INFO ] Invariant cache hit.
[2023-03-18 14:38:27] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 147/147 places, 343/343 transitions.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 235 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1163048 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{}
Probabilistic random walk after 1163048 steps, saw 175579 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 14:38:30] [INFO ] Invariant cache hit.
[2023-03-18 14:38:31] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-18 14:38:31] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 14:38:31] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-18 14:38:31] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 14:38:31] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-18 14:38:32] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2348 reset in 1985 ms.
Product exploration explored 100000 steps with 2347 reset in 2023 ms.
Built C files in :
/tmp/ltsmin11417301497453981331
[2023-03-18 14:38:36] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2023-03-18 14:38:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:36] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2023-03-18 14:38:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:36] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2023-03-18 14:38:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:36] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11417301497453981331
Running compilation step : cd /tmp/ltsmin11417301497453981331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 722 ms.
Running link step : cd /tmp/ltsmin11417301497453981331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11417301497453981331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8775985378011322148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:38:51] [INFO ] Invariant cache hit.
[2023-03-18 14:38:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 14:38:51] [INFO ] Invariant cache hit.
[2023-03-18 14:38:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-18 14:38:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 14:38:51] [INFO ] Invariant cache hit.
[2023-03-18 14:38:52] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 467 ms. Remains : 147/147 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin9611050641952972044
[2023-03-18 14:38:52] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2023-03-18 14:38:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:52] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2023-03-18 14:38:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:52] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2023-03-18 14:38:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:38:52] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9611050641952972044
Running compilation step : cd /tmp/ltsmin9611050641952972044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 725 ms.
Running link step : cd /tmp/ltsmin9611050641952972044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9611050641952972044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10511480962331976778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:39:07] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:39:07] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:39:07] [INFO ] Time to serialize gal into /tmp/LTL4006403625193107058.gal : 3 ms
[2023-03-18 14:39:07] [INFO ] Time to serialize properties into /tmp/LTL10211749482765505939.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4006403625193107058.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12773205244935272900.hoa' '-atoms' '/tmp/LTL10211749482765505939.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10211749482765505939.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12773205244935272900.hoa
Detected timeout of ITS tools.
[2023-03-18 14:39:22] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:39:22] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:39:22] [INFO ] Time to serialize gal into /tmp/LTL4181445830312141551.gal : 2 ms
[2023-03-18 14:39:22] [INFO ] Time to serialize properties into /tmp/LTL16123386444643579769.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4181445830312141551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16123386444643579769.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...565
Formula 0 simplified : GF!"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...559
Detected timeout of ITS tools.
[2023-03-18 14:39:37] [INFO ] Flatten gal took : 18 ms
[2023-03-18 14:39:37] [INFO ] Applying decomposition
[2023-03-18 14:39:37] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12960797939455004181.txt' '-o' '/tmp/graph12960797939455004181.bin' '-w' '/tmp/graph12960797939455004181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12960797939455004181.bin' '-l' '-1' '-v' '-w' '/tmp/graph12960797939455004181.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:39:37] [INFO ] Decomposing Gal with order
[2023-03-18 14:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:39:37] [INFO ] Removed a total of 882 redundant transitions.
[2023-03-18 14:39:37] [INFO ] Flatten gal took : 39 ms
[2023-03-18 14:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-18 14:39:37] [INFO ] Time to serialize gal into /tmp/LTL14241416735805653626.gal : 3 ms
[2023-03-18 14:39:37] [INFO ] Time to serialize properties into /tmp/LTL11845579190422453560.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14241416735805653626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11845579190422453560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((gu49.Cells_0+gu49.Cells_1)+(gu49.Cells_2+gu49.Cells_3))+((gu49.Cells_4+gu49.Cells_5)+(gu49.Cells_6+gu49.Cells_7)))+(((g...810
Formula 0 simplified : GF!"(((((((gu49.Cells_0+gu49.Cells_1)+(gu49.Cells_2+gu49.Cells_3))+((gu49.Cells_4+gu49.Cells_5)+(gu49.Cells_6+gu49.Cells_7)))+(((gu4...804
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15795817638746714003
[2023-03-18 14:39:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15795817638746714003
Running compilation step : cd /tmp/ltsmin15795817638746714003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 595 ms.
Running link step : cd /tmp/ltsmin15795817638746714003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15795817638746714003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-AN07-LTLCardinality-03 finished in 110971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F(!p0)))))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 14:40:07] [INFO ] Computed 147 place invariants in 4 ms
[2023-03-18 14:40:07] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-18 14:40:07] [INFO ] Invariant cache hit.
[2023-03-18 14:40:08] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-18 14:40:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 14:40:08] [INFO ] Invariant cache hit.
[2023-03-18 14:40:08] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 690 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), p0]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83 s8...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 5 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-04 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:08] [INFO ] Invariant cache hit.
[2023-03-18 14:40:08] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-18 14:40:08] [INFO ] Invariant cache hit.
[2023-03-18 14:40:09] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-18 14:40:09] [INFO ] Invariant cache hit.
[2023-03-18 14:40:09] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83 s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-05 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:09] [INFO ] Invariant cache hit.
[2023-03-18 14:40:09] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-18 14:40:09] [INFO ] Invariant cache hit.
[2023-03-18 14:40:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-18 14:40:09] [INFO ] Invariant cache hit.
[2023-03-18 14:40:10] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT 3 (ADD s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 ...], 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 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-07 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:10] [INFO ] Invariant cache hit.
[2023-03-18 14:40:10] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 14:40:10] [INFO ] Invariant cache hit.
[2023-03-18 14:40:10] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-18 14:40:10] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 14:40:10] [INFO ] Invariant cache hit.
[2023-03-18 14:40:10] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 804 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-09 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:11] [INFO ] Invariant cache hit.
[2023-03-18 14:40:11] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-18 14:40:11] [INFO ] Invariant cache hit.
[2023-03-18 14:40:11] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-18 14:40:11] [INFO ] Invariant cache hit.
[2023-03-18 14:40:11] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4198 ms.
Product exploration explored 100000 steps with 25000 reset in 4275 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 14:40:21] [INFO ] Invariant cache hit.
[2023-03-18 14:40:22] [INFO ] [Real]Absence check using 147 positive place invariants in 34 ms returned sat
[2023-03-18 14:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:40:22] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2023-03-18 14:40:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:40:23] [INFO ] [Nat]Absence check using 147 positive place invariants in 43 ms returned sat
[2023-03-18 14:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:40:23] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-18 14:40:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-18 14:40:23] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:23] [INFO ] Invariant cache hit.
[2023-03-18 14:40:23] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-18 14:40:23] [INFO ] Invariant cache hit.
[2023-03-18 14:40:24] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-18 14:40:24] [INFO ] Invariant cache hit.
[2023-03-18 14:40:24] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 14:40:25] [INFO ] Invariant cache hit.
[2023-03-18 14:40:26] [INFO ] [Real]Absence check using 147 positive place invariants in 34 ms returned sat
[2023-03-18 14:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:40:26] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-18 14:40:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:40:26] [INFO ] [Nat]Absence check using 147 positive place invariants in 57 ms returned sat
[2023-03-18 14:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:40:27] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-18 14:40:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 14:40:27] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 4198 ms.
Product exploration explored 100000 steps with 25000 reset in 4272 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 27 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:40:36] [INFO ] Invariant cache hit.
[2023-03-18 14:40:36] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin817999083193360456
[2023-03-18 14:40:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin817999083193360456
Running compilation step : cd /tmp/ltsmin817999083193360456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 650 ms.
Running link step : cd /tmp/ltsmin817999083193360456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin817999083193360456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14125384746389603151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 23 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:40:51] [INFO ] Invariant cache hit.
[2023-03-18 14:40:51] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-18 14:40:51] [INFO ] Invariant cache hit.
[2023-03-18 14:40:52] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-18 14:40:52] [INFO ] Invariant cache hit.
[2023-03-18 14:40:52] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin15161710041997841875
[2023-03-18 14:40:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15161710041997841875
Running compilation step : cd /tmp/ltsmin15161710041997841875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin15161710041997841875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15161710041997841875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7657588558970432882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:41:07] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:41:07] [INFO ] Flatten gal took : 16 ms
[2023-03-18 14:41:07] [INFO ] Time to serialize gal into /tmp/LTL7628952580264983847.gal : 9 ms
[2023-03-18 14:41:07] [INFO ] Time to serialize properties into /tmp/LTL4003664493782323617.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7628952580264983847.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18183826932546594086.hoa' '-atoms' '/tmp/LTL4003664493782323617.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4003664493782323617.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18183826932546594086.hoa
Detected timeout of ITS tools.
[2023-03-18 14:41:22] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:41:22] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:41:22] [INFO ] Time to serialize gal into /tmp/LTL9685420972976784734.gal : 3 ms
[2023-03-18 14:41:22] [INFO ] Time to serialize properties into /tmp/LTL3967773528345453766.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9685420972976784734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3967773528345453766.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...4048
Formula 0 simplified : XXXG!"((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...4038
Detected timeout of ITS tools.
[2023-03-18 14:41:37] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:41:37] [INFO ] Applying decomposition
[2023-03-18 14:41:37] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11971506389512755756.txt' '-o' '/tmp/graph11971506389512755756.bin' '-w' '/tmp/graph11971506389512755756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11971506389512755756.bin' '-l' '-1' '-v' '-w' '/tmp/graph11971506389512755756.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:41:37] [INFO ] Decomposing Gal with order
[2023-03-18 14:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:41:38] [INFO ] Removed a total of 620 redundant transitions.
[2023-03-18 14:41:38] [INFO ] Flatten gal took : 57 ms
[2023-03-18 14:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2023-03-18 14:41:38] [INFO ] Time to serialize gal into /tmp/LTL3713186958843021606.gal : 3 ms
[2023-03-18 14:41:38] [INFO ] Time to serialize properties into /tmp/LTL768992269568382980.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3713186958843021606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL768992269568382980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((((((((gu26.Board_0+gu26.Board_1)+(gu26.Board_2+gu26.Board_3))+((gu26.Board_4+gu26.Board_5)+(gu26.Board_6+gu26.Board_7)...5763
Formula 0 simplified : XXXG!"((((((((((gu26.Board_0+gu26.Board_1)+(gu26.Board_2+gu26.Board_3))+((gu26.Board_4+gu26.Board_5)+(gu26.Board_6+gu26.Board_7)))+(...5753
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15887709149709650181
[2023-03-18 14:41:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15887709149709650181
Running compilation step : cd /tmp/ltsmin15887709149709650181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 666 ms.
Running link step : cd /tmp/ltsmin15887709149709650181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15887709149709650181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN07-LTLCardinality-10 finished in 117263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(!p1)&&F((G(F(p2))||(G(!p1)&&F(p2)))))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:42:08] [INFO ] Invariant cache hit.
[2023-03-18 14:42:08] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-18 14:42:08] [INFO ] Invariant cache hit.
[2023-03-18 14:42:08] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-18 14:42:08] [INFO ] Invariant cache hit.
[2023-03-18 14:42:08] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 194 ms :[p1, (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p0) p1), true]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 2 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-11 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 49 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.1 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2023-03-18 14:42:09] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-18 14:42:09] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 14:42:09] [INFO ] Invariant cache hit.
[2023-03-18 14:42:09] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-18 14:42:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 14:42:09] [INFO ] Invariant cache hit.
[2023-03-18 14:42:09] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 451 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-12 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 14:42:09] [INFO ] Computed 147 place invariants in 2 ms
[2023-03-18 14:42:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 14:42:09] [INFO ] Invariant cache hit.
[2023-03-18 14:42:10] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-18 14:42:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 14:42:10] [INFO ] Invariant cache hit.
[2023-03-18 14:42:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 601 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-15 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : Sudoku-COL-AN07-LTLCardinality-10
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:42:10] [INFO ] Invariant cache hit.
[2023-03-18 14:42:10] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-18 14:42:10] [INFO ] Invariant cache hit.
[2023-03-18 14:42:11] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-18 14:42:11] [INFO ] Invariant cache hit.
[2023-03-18 14:42:11] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 823 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s49 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 s75 s76 s77 s78 s79 s80 s81 s82 s83...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4209 ms.
Product exploration explored 100000 steps with 25000 reset in 4262 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 14:42:21] [INFO ] Invariant cache hit.
[2023-03-18 14:42:21] [INFO ] [Real]Absence check using 147 positive place invariants in 34 ms returned sat
[2023-03-18 14:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:42:21] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2023-03-18 14:42:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:42:22] [INFO ] [Nat]Absence check using 147 positive place invariants in 45 ms returned sat
[2023-03-18 14:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:42:23] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2023-03-18 14:42:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 14:42:23] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:42:23] [INFO ] Invariant cache hit.
[2023-03-18 14:42:23] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-18 14:42:23] [INFO ] Invariant cache hit.
[2023-03-18 14:42:23] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-18 14:42:23] [INFO ] Invariant cache hit.
[2023-03-18 14:42:23] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 14:42:24] [INFO ] Invariant cache hit.
[2023-03-18 14:42:25] [INFO ] [Real]Absence check using 147 positive place invariants in 35 ms returned sat
[2023-03-18 14:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:42:25] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-18 14:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:42:26] [INFO ] [Nat]Absence check using 147 positive place invariants in 45 ms returned sat
[2023-03-18 14:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:42:26] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-18 14:42:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-18 14:42:26] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 4178 ms.
Product exploration explored 100000 steps with 25000 reset in 4254 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 14 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:42:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 14:42:35] [INFO ] Invariant cache hit.
[2023-03-18 14:42:36] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin6860231103044164696
[2023-03-18 14:42:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6860231103044164696
Running compilation step : cd /tmp/ltsmin6860231103044164696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 678 ms.
Running link step : cd /tmp/ltsmin6860231103044164696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6860231103044164696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7404192080201141624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 14:42:51] [INFO ] Invariant cache hit.
[2023-03-18 14:42:51] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-18 14:42:51] [INFO ] Invariant cache hit.
[2023-03-18 14:42:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-18 14:42:51] [INFO ] Invariant cache hit.
[2023-03-18 14:42:51] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin9036937040303135349
[2023-03-18 14:42:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9036937040303135349
Running compilation step : cd /tmp/ltsmin9036937040303135349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 674 ms.
Running link step : cd /tmp/ltsmin9036937040303135349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9036937040303135349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9268883961369299410.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:43:07] [INFO ] Flatten gal took : 18 ms
[2023-03-18 14:43:07] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:43:07] [INFO ] Time to serialize gal into /tmp/LTL1152373735462175867.gal : 3 ms
[2023-03-18 14:43:07] [INFO ] Time to serialize properties into /tmp/LTL13706298267985713760.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1152373735462175867.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2269450826246060281.hoa' '-atoms' '/tmp/LTL13706298267985713760.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13706298267985713760.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2269450826246060281.hoa
Detected timeout of ITS tools.
[2023-03-18 14:43:22] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:43:22] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:43:22] [INFO ] Time to serialize gal into /tmp/LTL1825838858577194805.gal : 2 ms
[2023-03-18 14:43:22] [INFO ] Time to serialize properties into /tmp/LTL12747943981704973577.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1825838858577194805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12747943981704973577.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...4048
Formula 0 simplified : XXXG!"((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...4038
Detected timeout of ITS tools.
[2023-03-18 14:43:37] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:43:37] [INFO ] Applying decomposition
[2023-03-18 14:43:37] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3023476511120991662.txt' '-o' '/tmp/graph3023476511120991662.bin' '-w' '/tmp/graph3023476511120991662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3023476511120991662.bin' '-l' '-1' '-v' '-w' '/tmp/graph3023476511120991662.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:43:37] [INFO ] Decomposing Gal with order
[2023-03-18 14:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:43:37] [INFO ] Removed a total of 684 redundant transitions.
[2023-03-18 14:43:37] [INFO ] Flatten gal took : 57 ms
[2023-03-18 14:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-18 14:43:37] [INFO ] Time to serialize gal into /tmp/LTL4811455818654832874.gal : 3 ms
[2023-03-18 14:43:37] [INFO ] Time to serialize properties into /tmp/LTL18118618041665979839.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4811455818654832874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18118618041665979839.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu...5420
Formula 0 simplified : XXXG!"((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Bo...5410
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14328554601793928437
[2023-03-18 14:43:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14328554601793928437
Running compilation step : cd /tmp/ltsmin14328554601793928437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 692 ms.
Running link step : cd /tmp/ltsmin14328554601793928437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14328554601793928437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN07-LTLCardinality-10 finished in 117221 ms.
[2023-03-18 14:44:07] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14435937396794485099
[2023-03-18 14:44:07] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2023-03-18 14:44:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:44:07] [INFO ] Applying decomposition
[2023-03-18 14:44:07] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2023-03-18 14:44:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:44:07] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:44:07] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2023-03-18 14:44:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:44:07] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14435937396794485099
Running compilation step : cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15686669615825862856.txt' '-o' '/tmp/graph15686669615825862856.bin' '-w' '/tmp/graph15686669615825862856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15686669615825862856.bin' '-l' '-1' '-v' '-w' '/tmp/graph15686669615825862856.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:44:08] [INFO ] Decomposing Gal with order
[2023-03-18 14:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:44:08] [INFO ] Removed a total of 294 redundant transitions.
[2023-03-18 14:44:08] [INFO ] Flatten gal took : 188 ms
[2023-03-18 14:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 9 ms.
[2023-03-18 14:44:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality11776527175038328497.gal : 15 ms
[2023-03-18 14:44:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality16647940730141275306.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11776527175038328497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16647940730141275306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((G(F("(((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells...6135
Formula 0 simplified : FG!"(((((((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...6129
Compilation finished in 972 ms.
Running link step : cd /tmp/ltsmin14435937396794485099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 15:06:47] [INFO ] Applying decomposition
[2023-03-18 15:06:47] [INFO ] Flatten gal took : 47 ms
[2023-03-18 15:06:47] [INFO ] Decomposing Gal with order
[2023-03-18 15:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 15:06:47] [INFO ] Removed a total of 693 redundant transitions.
[2023-03-18 15:06:47] [INFO ] Flatten gal took : 99 ms
[2023-03-18 15:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-18 15:06:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality5112945233495641575.gal : 26 ms
[2023-03-18 15:06:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality3420006120002944219.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5112945233495641575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3420006120002944219.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((G(F("(((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((g...7485
Formula 0 simplified : FG!"(((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gNN...7479
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Initializing POR dependencies: labels 346, guards 343
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.582: LTL layer: formula: <>([]((LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 1.582: "<>([]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.582: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.599: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 1.742: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.779: There are 347 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.779: State length is 491, there are 347 groups
pins2lts-mc-linux64( 0/ 8), 1.779: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.779: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.779: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.779: Visible groups: 0 / 347, labels: 1 / 347
pins2lts-mc-linux64( 0/ 8), 1.779: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.779: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 2.271: [Blue] ~42 levels ~960 states ~37448 transitions
pins2lts-mc-linux64( 4/ 8), 2.297: [Blue] ~42 levels ~1920 states ~41136 transitions
pins2lts-mc-linux64( 4/ 8), 2.361: [Blue] ~42 levels ~3840 states ~49544 transitions
pins2lts-mc-linux64( 4/ 8), 2.456: [Blue] ~42 levels ~7680 states ~65872 transitions
pins2lts-mc-linux64( 4/ 8), 2.686: [Blue] ~42 levels ~15360 states ~105176 transitions
pins2lts-mc-linux64( 4/ 8), 3.121: [Blue] ~42 levels ~30720 states ~176800 transitions
pins2lts-mc-linux64( 5/ 8), 4.037: [Blue] ~41 levels ~61440 states ~351536 transitions
pins2lts-mc-linux64( 1/ 8), 5.680: [Blue] ~43 levels ~122880 states ~684144 transitions
pins2lts-mc-linux64( 5/ 8), 9.282: [Blue] ~41 levels ~245760 states ~1441384 transitions
pins2lts-mc-linux64( 7/ 8), 16.593: [Blue] ~44 levels ~491520 states ~3152232 transitions
pins2lts-mc-linux64( 5/ 8), 30.268: [Blue] ~41 levels ~983040 states ~6343144 transitions
pins2lts-mc-linux64( 5/ 8), 58.748: [Blue] ~42 levels ~1966080 states ~13382720 transitions
pins2lts-mc-linux64( 5/ 8), 118.416: [Blue] ~42 levels ~3932160 states ~28454848 transitions
pins2lts-mc-linux64( 5/ 8), 241.519: [Blue] ~42 levels ~7864320 states ~58982272 transitions
pins2lts-mc-linux64( 1/ 8), 383.253: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 383.326:
pins2lts-mc-linux64( 0/ 8), 383.326: Explored 11363881 states 92795012 transitions, fanout: 8.166
pins2lts-mc-linux64( 0/ 8), 383.326: Total exploration time 381.510 sec (381.450 sec minimum, 381.479 sec on average)
pins2lts-mc-linux64( 0/ 8), 383.326: States per second: 29787, Transitions per second: 243231
pins2lts-mc-linux64( 0/ 8), 383.326:
pins2lts-mc-linux64( 0/ 8), 383.326: State space has 11396539 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 383.326: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 383.326: blue states: 11363881 (99.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 383.326: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 383.326: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 383.326:
pins2lts-mc-linux64( 0/ 8), 383.326: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 383.326:
pins2lts-mc-linux64( 0/ 8), 383.326: Queue width: 8B, total height: 355, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 383.326: Tree memory: 342.9MB, 31.6 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 383.326: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 383.326: Stored 345 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 383.326: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 383.326: Est. total memory use: 343.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14435937396794485099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 15:29:27] [INFO ] Flatten gal took : 98 ms
[2023-03-18 15:29:28] [INFO ] Input system was already deterministic with 343 transitions.
[2023-03-18 15:29:29] [INFO ] Transformed 490 places.
[2023-03-18 15:29:29] [INFO ] Transformed 343 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 15:29:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality7648974709137245772.gal : 18 ms
[2023-03-18 15:29:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality3285892722343410800.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7648974709137245772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3285892722343410800.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...4567
Formula 0 simplified : FG!"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...4561
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6809332 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16118244 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN07"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN07, 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 r485-tall-167912698800051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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