Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.0K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717143436021

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN09
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 08:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 08:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:17:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 08:17:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 08:17:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 699 ms
[2024-05-31 08:17:18] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 08:17:18] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 5 ms.
[2024-05-31 08:17:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-BN09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 14 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10042 steps, including 120 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 20 ms. (steps per millisecond=502 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 26 ms. (steps per millisecond=386 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 20 ms. (steps per millisecond=502 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 5 ms. (steps per millisecond=2008 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 7 ms. (steps per millisecond=1434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 5 cols
[2024-05-31 08:17:18] [INFO ] Computed 4 invariants in 2 ms
[2024-05-31 08:17:18] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 08:17:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 08:17:18] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 08:17:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-31 08:17:18] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-BN09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 08:17:18] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-31 08:17:18] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 62 ms.
[2024-05-31 08:17:18] [INFO ] Unfolded 10 HLPN properties in 7 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:17:19] [INFO ] Computed 324 invariants in 25 ms
[2024-05-31 08:17:19] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-31 08:17:19] [INFO ] Invariant cache hit.
[2024-05-31 08:17:19] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2024-05-31 08:17:19] [INFO ] Invariant cache hit.
[2024-05-31 08:17:20] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1279 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2024-05-31 08:17:20] [INFO ] Flatten gal took : 96 ms
[2024-05-31 08:17:20] [INFO ] Flatten gal took : 103 ms
[2024-05-31 08:17:20] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 1054 ms. (steps per millisecond=9 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 08:17:22] [INFO ] Invariant cache hit.
[2024-05-31 08:17:23] [INFO ] [Real]Absence check using 324 positive place invariants in 92 ms returned sat
[2024-05-31 08:17:24] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 08:17:24] [INFO ] [Nat]Absence check using 324 positive place invariants in 70 ms returned sat
[2024-05-31 08:17:49] [INFO ] After 23978ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-31 08:17:49] [INFO ] After 23980ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 08:17:49] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 9 Parikh solutions to 4 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 4 properties in 20 ms.
Support contains 162 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 52 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 324/1053 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 379554 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379554 steps, saw 89547 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 729 rows 324 cols
[2024-05-31 08:17:53] [INFO ] Computed 75 invariants in 39 ms
[2024-05-31 08:17:53] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 109 ms returned sat
[2024-05-31 08:18:07] [INFO ] After 14823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:18:07] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2024-05-31 08:18:13] [INFO ] After 5850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 08:18:20] [INFO ] After 12391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10685 ms.
[2024-05-31 08:18:31] [INFO ] After 23163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 21 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:18:31] [INFO ] Invariant cache hit.
[2024-05-31 08:18:31] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 08:18:31] [INFO ] Invariant cache hit.
[2024-05-31 08:18:32] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2024-05-31 08:18:32] [INFO ] Invariant cache hit.
[2024-05-31 08:18:32] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1241 ms. Remains : 324/1053 places, 729/729 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1509 reset in 5264 ms.
Product exploration explored 100000 steps with 1508 reset in 5242 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538886 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538886 steps, saw 114103 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:18:50] [INFO ] Invariant cache hit.
[2024-05-31 08:18:50] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2024-05-31 08:18:57] [INFO ] After 7510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:18:57] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 24 ms returned sat
[2024-05-31 08:19:03] [INFO ] After 6234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:19:05] [INFO ] After 7966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1267 ms.
[2024-05-31 08:19:06] [INFO ] After 9325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN09-LTLCardinality-00 finished in 35713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(G(!p0))||G(p1))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:19:07] [INFO ] Computed 324 invariants in 5 ms
[2024-05-31 08:19:07] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-31 08:19:07] [INFO ] Invariant cache hit.
[2024-05-31 08:19:08] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2024-05-31 08:19:08] [INFO ] Invariant cache hit.
[2024-05-31 08:19:08] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1532 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 249 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1509 reset in 8431 ms.
Product exploration explored 100000 steps with 1507 reset in 8548 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 258 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[false, p0]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[false, p0]
Stuttering acceptance computed with spot in 66 ms :[false, p0]
Support contains 810 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 29 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:20:23] [INFO ] Invariant cache hit.
[2024-05-31 08:20:24] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-31 08:20:24] [INFO ] Invariant cache hit.
[2024-05-31 08:20:24] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2024-05-31 08:20:24] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-31 08:20:24] [INFO ] Invariant cache hit.
[2024-05-31 08:20:25] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1631 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[false, p0]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[false, p0]
Stuttering acceptance computed with spot in 69 ms :[false, p0]
Stuttering acceptance computed with spot in 54 ms :[false, p0]
Product exploration explored 100000 steps with 1509 reset in 8284 ms.
Product exploration explored 100000 steps with 1510 reset in 8386 ms.
Built C files in :
/tmp/ltsmin4285225527423977985
[2024-05-31 08:20:52] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:20:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:20:52] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:20:52] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:20:52] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:20:52] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:20:52] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4285225527423977985
Running compilation step : cd /tmp/ltsmin4285225527423977985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2293 ms.
Running link step : cd /tmp/ltsmin4285225527423977985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4285225527423977985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14481740130643172421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 29 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:21:07] [INFO ] Invariant cache hit.
[2024-05-31 08:21:08] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 08:21:08] [INFO ] Invariant cache hit.
[2024-05-31 08:21:09] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2024-05-31 08:21:09] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 08:21:09] [INFO ] Invariant cache hit.
[2024-05-31 08:21:09] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1752 ms. Remains : 1053/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin4977942146434230151
[2024-05-31 08:21:09] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:21:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:21:09] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:21:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:21:09] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:21:09] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:21:09] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4977942146434230151
Running compilation step : cd /tmp/ltsmin4977942146434230151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2335 ms.
Running link step : cd /tmp/ltsmin4977942146434230151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4977942146434230151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7393088492936877172.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 08:21:24] [INFO ] Flatten gal took : 60 ms
[2024-05-31 08:21:24] [INFO ] Flatten gal took : 51 ms
[2024-05-31 08:21:24] [INFO ] Time to serialize gal into /tmp/LTL6080233734684381802.gal : 13 ms
[2024-05-31 08:21:24] [INFO ] Time to serialize properties into /tmp/LTL4682089410247892911.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6080233734684381802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12091079618396821539.hoa' '-atoms' '/tmp/LTL4682089410247892911.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4682089410247892911.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12091079618396821539.hoa
Detected timeout of ITS tools.
[2024-05-31 08:21:39] [INFO ] Flatten gal took : 45 ms
[2024-05-31 08:21:39] [INFO ] Flatten gal took : 55 ms
[2024-05-31 08:21:40] [INFO ] Time to serialize gal into /tmp/LTL10976153875899344464.gal : 20 ms
[2024-05-31 08:21:40] [INFO ] Time to serialize properties into /tmp/LTL2952093381679584033.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10976153875899344464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2952093381679584033.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...28612
Formula 0 simplified : F!"((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_13...28596
Detected timeout of ITS tools.
[2024-05-31 08:21:55] [INFO ] Flatten gal took : 44 ms
[2024-05-31 08:21:55] [INFO ] Applying decomposition
[2024-05-31 08:21:55] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6550775171124044643.txt' '-o' '/tmp/graph6550775171124044643.bin' '-w' '/tmp/graph6550775171124044643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6550775171124044643.bin' '-l' '-1' '-v' '-w' '/tmp/graph6550775171124044643.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:21:58] [INFO ] Decomposing Gal with order
[2024-05-31 08:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:21:59] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-31 08:21:59] [INFO ] Flatten gal took : 835 ms
[2024-05-31 08:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1458 labels/synchronizations in 84 ms.
[2024-05-31 08:21:59] [INFO ] Time to serialize gal into /tmp/LTL7237458911097814933.gal : 7 ms
[2024-05-31 08:21:59] [INFO ] Time to serialize properties into /tmp/LTL3920828464827070653.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7237458911097814933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3920828464827070653.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gi0.gu0.Rows_0+gi0.gu0.Rows_1)+(gi0.gu0.Rows_2+gi0.gu0.Rows_3))+((gi0.gu0.Rows_4+gi0.gu0.Rows_5)+(gi0.gu0.Rows_6+gi0.gu...47728
Formula 0 simplified : F!"((((((((gi0.gu0.Rows_0+gi0.gu0.Rows_1)+(gi0.gu0.Rows_2+gi0.gu0.Rows_3))+((gi0.gu0.Rows_4+gi0.gu0.Rows_5)+(gi0.gu0.Rows_6+gi0.gu0....47712
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9184653015524286890
[2024-05-31 08:22:15] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9184653015524286890
Running compilation step : cd /tmp/ltsmin9184653015524286890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1674 ms.
Running link step : cd /tmp/ltsmin9184653015524286890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9184653015524286890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-BN09-LTLCardinality-01 finished in 203125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U (G(p1) U p2))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:22:30] [INFO ] Invariant cache hit.
[2024-05-31 08:22:30] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-31 08:22:30] [INFO ] Invariant cache hit.
[2024-05-31 08:22:31] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-31 08:22:31] [INFO ] Invariant cache hit.
[2024-05-31 08:22:31] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1497 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 6}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1 p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 4}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p1:(LEQ (ADD s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 70340 steps with 17585 reset in 10001 ms.
Product exploration timeout after 69880 steps with 17470 reset in 10001 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 591 ms. Reduced automaton from 7 states, 18 edges and 3 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)]
Incomplete random walk after 10000 steps, including 149 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407690 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407690 steps, saw 94282 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:23:50] [INFO ] Invariant cache hit.
[2024-05-31 08:23:50] [INFO ] [Real]Absence check using 324 positive place invariants in 66 ms returned sat
[2024-05-31 08:23:51] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:23:51] [INFO ] [Nat]Absence check using 324 positive place invariants in 65 ms returned sat
[2024-05-31 08:24:01] [INFO ] After 9796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.6 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 324/1053 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 479906 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 479906 steps, saw 105291 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 324 cols
[2024-05-31 08:24:04] [INFO ] Computed 75 invariants in 29 ms
[2024-05-31 08:24:04] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 22 ms returned sat
[2024-05-31 08:24:10] [INFO ] After 6237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:24:10] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 19 ms returned sat
[2024-05-31 08:24:13] [INFO ] After 2787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:24:16] [INFO ] After 5210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1649 ms.
[2024-05-31 08:24:17] [INFO ] After 6929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 757 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 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:24:18] [INFO ] Computed 324 invariants in 5 ms
[2024-05-31 08:24:19] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 08:24:19] [INFO ] Invariant cache hit.
[2024-05-31 08:24:19] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2024-05-31 08:24:19] [INFO ] Invariant cache hit.
[2024-05-31 08:24:20] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1480 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 398841 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398841 steps, saw 92786 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:24:26] [INFO ] Invariant cache hit.
[2024-05-31 08:24:26] [INFO ] [Real]Absence check using 324 positive place invariants in 60 ms returned sat
[2024-05-31 08:24:26] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:24:27] [INFO ] [Nat]Absence check using 324 positive place invariants in 61 ms returned sat
[2024-05-31 08:24:36] [INFO ] After 9784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 324/1053 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 483736 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 483736 steps, saw 105784 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 324 cols
[2024-05-31 08:24:40] [INFO ] Computed 75 invariants in 25 ms
[2024-05-31 08:24:40] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2024-05-31 08:24:46] [INFO ] After 6334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:24:46] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 22 ms returned sat
[2024-05-31 08:24:49] [INFO ] After 2870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:24:52] [INFO ] After 5356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1648 ms.
[2024-05-31 08:24:53] [INFO ] After 7087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 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 150 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)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 86230 steps with 21557 reset in 10001 ms.
Product exploration timeout after 85430 steps with 21357 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.3 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:25:14] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:25:14] [INFO ] Invariant cache hit.
[2024-05-31 08:25:14] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 324/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin14872656443066655120
[2024-05-31 08:25:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14872656443066655120
Running compilation step : cd /tmp/ltsmin14872656443066655120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin14872656443066655120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14872656443066655120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3977440748675487576.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 16 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:25:30] [INFO ] Invariant cache hit.
[2024-05-31 08:25:30] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 08:25:30] [INFO ] Invariant cache hit.
[2024-05-31 08:25:31] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-05-31 08:25:31] [INFO ] Invariant cache hit.
[2024-05-31 08:25:31] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 324/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin244060047922501565
[2024-05-31 08:25:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin244060047922501565
Running compilation step : cd /tmp/ltsmin244060047922501565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1353 ms.
Running link step : cd /tmp/ltsmin244060047922501565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin244060047922501565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18162897660214412900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 08:25:46] [INFO ] Flatten gal took : 52 ms
[2024-05-31 08:25:46] [INFO ] Flatten gal took : 51 ms
[2024-05-31 08:25:46] [INFO ] Time to serialize gal into /tmp/LTL8820979470958321683.gal : 7 ms
[2024-05-31 08:25:46] [INFO ] Time to serialize properties into /tmp/LTL11600333094207585136.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8820979470958321683.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8437296613149750783.hoa' '-atoms' '/tmp/LTL11600333094207585136.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9...19421
Formula 0 simplified : X(XXG!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(C...19411
Detected timeout of ITS tools.
[2024-05-31 08:26:16] [INFO ] Flatten gal took : 38 ms
[2024-05-31 08:26:16] [INFO ] Applying decomposition
[2024-05-31 08:26:16] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15419218940275959411.txt' '-o' '/tmp/graph15419218940275959411.bin' '-w' '/tmp/graph15419218940275959411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15419218940275959411.bin' '-l' '-1' '-v' '-w' '/tmp/graph15419218940275959411.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:26:18] [INFO ] Decomposing Gal with order
[2024-05-31 08:26:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:26:18] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-31 08:26:18] [INFO ] Flatten gal took : 438 ms
[2024-05-31 08:26:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 24 ms.
[2024-05-31 08:26:18] [INFO ] Time to serialize gal into /tmp/LTL5714285847609275292.gal : 7 ms
[2024-05-31 08:26:18] [INFO ] Time to serialize properties into /tmp/LTL8953305773929668471.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5714285847609275292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8953305773929668471.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Col...25901
Formula 0 simplified : X(XXG!"((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns...25891
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14119001440892246464
[2024-05-31 08:26:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14119001440892246464
Running compilation step : cd /tmp/ltsmin14119001440892246464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1683 ms.
Running link step : cd /tmp/ltsmin14119001440892246464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14119001440892246464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(<>((LTLAPp0==true)))) U ([]((LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-BN09-LTLCardinality-02 finished in 258846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:26:48] [INFO ] Computed 324 invariants in 4 ms
[2024-05-31 08:26:49] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 08:26:49] [INFO ] Invariant cache hit.
[2024-05-31 08:26:49] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2024-05-31 08:26:49] [INFO ] Invariant cache hit.
[2024-05-31 08:26:50] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 85170 steps with 28390 reset in 10001 ms.
Product exploration timeout after 84460 steps with 28153 reset in 10001 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN09-LTLCardinality-05 finished in 32502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(F((p1&&F(p2)))))))))'
Support contains 972 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:27:21] [INFO ] Invariant cache hit.
[2024-05-31 08:27:21] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-31 08:27:21] [INFO ] Invariant cache hit.
[2024-05-31 08:27:22] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2024-05-31 08:27:22] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:27:22] [INFO ] Invariant cache hit.
[2024-05-31 08:27:22] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1254 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 21 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-06 finished in 1419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.3 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-05-31 08:27:22] [INFO ] Computed 75 invariants in 18 ms
[2024-05-31 08:27:23] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-31 08:27:23] [INFO ] Invariant cache hit.
[2024-05-31 08:27:23] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2024-05-31 08:27:23] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:27:23] [INFO ] Invariant cache hit.
[2024-05-31 08:27:24] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1226 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270...], 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 1508 reset in 5208 ms.
Product exploration explored 100000 steps with 1509 reset in 5310 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 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 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 484528 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 484528 steps, saw 105936 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:27:41] [INFO ] Invariant cache hit.
[2024-05-31 08:27:41] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 24 ms returned sat
[2024-05-31 08:27:47] [INFO ] After 6445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:27:47] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 20 ms returned sat
[2024-05-31 08:27:51] [INFO ] After 3471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:27:53] [INFO ] After 5814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9081 ms.
[2024-05-31 08:28:02] [INFO ] After 14972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:28:03] [INFO ] Invariant cache hit.
[2024-05-31 08:28:03] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-31 08:28:03] [INFO ] Invariant cache hit.
[2024-05-31 08:28:03] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-31 08:28:03] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:28:03] [INFO ] Invariant cache hit.
[2024-05-31 08:28:04] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1200 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472971 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472971 steps, saw 104210 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:28:10] [INFO ] Invariant cache hit.
[2024-05-31 08:28:11] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2024-05-31 08:28:17] [INFO ] After 6500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:28:17] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 19 ms returned sat
[2024-05-31 08:28:21] [INFO ] After 3590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 08:28:23] [INFO ] After 6026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9071 ms.
[2024-05-31 08:28:32] [INFO ] After 15165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 4 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1510 reset in 5239 ms.
Product exploration explored 100000 steps with 1510 reset in 5300 ms.
Built C files in :
/tmp/ltsmin15849344698327574476
[2024-05-31 08:28:43] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:28:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:43] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:28:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:43] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:28:43] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:43] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15849344698327574476
Running compilation step : cd /tmp/ltsmin15849344698327574476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1996 ms.
Running link step : cd /tmp/ltsmin15849344698327574476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15849344698327574476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5013106850329958155.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:28:58] [INFO ] Invariant cache hit.
[2024-05-31 08:28:58] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-31 08:28:58] [INFO ] Invariant cache hit.
[2024-05-31 08:28:59] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2024-05-31 08:28:59] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:28:59] [INFO ] Invariant cache hit.
[2024-05-31 08:28:59] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1207 ms. Remains : 324/324 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin3286043105667872755
[2024-05-31 08:28:59] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:28:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:59] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:28:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:59] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:28:59] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:28:59] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3286043105667872755
Running compilation step : cd /tmp/ltsmin3286043105667872755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1916 ms.
Running link step : cd /tmp/ltsmin3286043105667872755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3286043105667872755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5080932652085495178.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 08:29:14] [INFO ] Flatten gal took : 37 ms
[2024-05-31 08:29:14] [INFO ] Flatten gal took : 28 ms
[2024-05-31 08:29:14] [INFO ] Time to serialize gal into /tmp/LTL5506290450431818217.gal : 4 ms
[2024-05-31 08:29:14] [INFO ] Time to serialize properties into /tmp/LTL15888439530011638007.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5506290450431818217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15518851242446442662.hoa' '-atoms' '/tmp/LTL15888439530011638007.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+...2134
Formula 0 simplified : F(GF!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...2127
Detected timeout of ITS tools.
[2024-05-31 08:29:45] [INFO ] Flatten gal took : 32 ms
[2024-05-31 08:29:45] [INFO ] Applying decomposition
[2024-05-31 08:29:45] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph351016857333010540.txt' '-o' '/tmp/graph351016857333010540.bin' '-w' '/tmp/graph351016857333010540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph351016857333010540.bin' '-l' '-1' '-v' '-w' '/tmp/graph351016857333010540.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:29:45] [INFO ] Decomposing Gal with order
[2024-05-31 08:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:29:45] [INFO ] Removed a total of 2592 redundant transitions.
[2024-05-31 08:29:45] [INFO ] Flatten gal took : 79 ms
[2024-05-31 08:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 08:29:45] [INFO ] Time to serialize gal into /tmp/LTL18409345576827465834.gal : 4 ms
[2024-05-31 08:29:45] [INFO ] Time to serialize properties into /tmp/LTL1580157272660869755.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18409345576827465834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1580157272660869755.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((((((((gu243.Columns_0+gu243.Columns_1)+(gu243.Columns_2+gu243.Columns_3))+((gu243.Columns_4+gu243.Columns_5)+(gu243.Colum...3106
Formula 0 simplified : F(GF!"((((((((gu243.Columns_0+gu243.Columns_1)+(gu243.Columns_2+gu243.Columns_3))+((gu243.Columns_4+gu243.Columns_5)+(gu243.Columns_...3099
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17000156066402808989
[2024-05-31 08:30:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17000156066402808989
Running compilation step : cd /tmp/ltsmin17000156066402808989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1338 ms.
Running link step : cd /tmp/ltsmin17000156066402808989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17000156066402808989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-BN09-LTLCardinality-07 finished in 172648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((F(p2)&&p1)))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:30:15] [INFO ] Computed 324 invariants in 5 ms
[2024-05-31 08:30:15] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-31 08:30:15] [INFO ] Invariant cache hit.
[2024-05-31 08:30:16] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2024-05-31 08:30:16] [INFO ] Invariant cache hit.
[2024-05-31 08:30:17] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1434 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT 1 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-08 finished in 1644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&F(p2))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:30:17] [INFO ] Invariant cache hit.
[2024-05-31 08:30:17] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-31 08:30:17] [INFO ] Invariant cache hit.
[2024-05-31 08:30:18] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-05-31 08:30:18] [INFO ] Invariant cache hit.
[2024-05-31 08:30:18] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1445 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(LEQ 2 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 85830 steps with 28610 reset in 10001 ms.
Product exploration timeout after 85230 steps with 28410 reset in 10001 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN09-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN09-LTLCardinality-11 finished in 36589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 13 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-05-31 08:30:53] [INFO ] Computed 75 invariants in 19 ms
[2024-05-31 08:30:54] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-31 08:30:54] [INFO ] Invariant cache hit.
[2024-05-31 08:30:54] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-31 08:30:54] [INFO ] Invariant cache hit.
[2024-05-31 08:30:54] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1171 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-13 finished in 1259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:30:55] [INFO ] Invariant cache hit.
[2024-05-31 08:30:55] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-31 08:30:55] [INFO ] Invariant cache hit.
[2024-05-31 08:30:55] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2024-05-31 08:30:55] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:30:55] [INFO ] Invariant cache hit.
[2024-05-31 08:30:56] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1111 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-15 finished in 1161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(G(!p0))||G(p1))))))'
Found a Lengthening insensitive property : Sudoku-COL-BN09-LTLCardinality-01
Stuttering acceptance computed with spot in 236 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-05-31 08:30:56] [INFO ] Computed 324 invariants in 10 ms
[2024-05-31 08:30:56] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-31 08:30:56] [INFO ] Invariant cache hit.
[2024-05-31 08:30:57] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2024-05-31 08:30:57] [INFO ] Invariant cache hit.
[2024-05-31 08:30:57] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1470 ms. Remains : 1053/1053 places, 729/729 transitions.
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1509 reset in 8963 ms.
Product exploration explored 100000 steps with 1508 reset in 9053 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[false, p0]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[false, p0]
Stuttering acceptance computed with spot in 65 ms :[false, p0]
Support contains 810 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:32:17] [INFO ] Invariant cache hit.
[2024-05-31 08:32:18] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-31 08:32:18] [INFO ] Invariant cache hit.
[2024-05-31 08:32:19] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2024-05-31 08:32:19] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 08:32:19] [INFO ] Invariant cache hit.
[2024-05-31 08:32:19] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1595 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[false, p0]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 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 111 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[false, p0]
Stuttering acceptance computed with spot in 74 ms :[false, p0]
Stuttering acceptance computed with spot in 63 ms :[false, p0]
Product exploration explored 100000 steps with 1508 reset in 8791 ms.
Product exploration explored 100000 steps with 1509 reset in 8906 ms.
Built C files in :
/tmp/ltsmin4159491356691970602
[2024-05-31 08:32:48] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:32:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:32:48] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:32:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:32:48] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:32:48] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:32:48] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4159491356691970602
Running compilation step : cd /tmp/ltsmin4159491356691970602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2310 ms.
Running link step : cd /tmp/ltsmin4159491356691970602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4159491356691970602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7068793609089827089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 08:33:03] [INFO ] Invariant cache hit.
[2024-05-31 08:33:04] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-31 08:33:04] [INFO ] Invariant cache hit.
[2024-05-31 08:33:04] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2024-05-31 08:33:04] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 08:33:04] [INFO ] Invariant cache hit.
[2024-05-31 08:33:05] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1708 ms. Remains : 1053/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin14776968879018038866
[2024-05-31 08:33:05] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:33:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:33:05] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:33:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:33:05] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:33:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:33:05] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14776968879018038866
Running compilation step : cd /tmp/ltsmin14776968879018038866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2301 ms.
Running link step : cd /tmp/ltsmin14776968879018038866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14776968879018038866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14536741884190626968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 08:33:20] [INFO ] Flatten gal took : 33 ms
[2024-05-31 08:33:20] [INFO ] Flatten gal took : 32 ms
[2024-05-31 08:33:20] [INFO ] Time to serialize gal into /tmp/LTL18144061246999621535.gal : 5 ms
[2024-05-31 08:33:20] [INFO ] Time to serialize properties into /tmp/LTL11725246287890710036.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18144061246999621535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15372121341956428385.hoa' '-atoms' '/tmp/LTL11725246287890710036.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11725246287890710036.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15372121341956428385.hoa
Detected timeout of ITS tools.
[2024-05-31 08:33:35] [INFO ] Flatten gal took : 33 ms
[2024-05-31 08:33:35] [INFO ] Flatten gal took : 33 ms
[2024-05-31 08:33:35] [INFO ] Time to serialize gal into /tmp/LTL10522379869375071383.gal : 4 ms
[2024-05-31 08:33:35] [INFO ] Time to serialize properties into /tmp/LTL14491412242031595503.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10522379869375071383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14491412242031595503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...28612
Formula 0 simplified : F!"((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_13...28596
Detected timeout of ITS tools.
[2024-05-31 08:33:50] [INFO ] Flatten gal took : 34 ms
[2024-05-31 08:33:50] [INFO ] Applying decomposition
[2024-05-31 08:33:50] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10979338966092028691.txt' '-o' '/tmp/graph10979338966092028691.bin' '-w' '/tmp/graph10979338966092028691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10979338966092028691.bin' '-l' '-1' '-v' '-w' '/tmp/graph10979338966092028691.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:33:52] [INFO ] Decomposing Gal with order
[2024-05-31 08:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:33:53] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-31 08:33:53] [INFO ] Flatten gal took : 439 ms
[2024-05-31 08:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1458 labels/synchronizations in 47 ms.
[2024-05-31 08:33:53] [INFO ] Time to serialize gal into /tmp/LTL2661353573401483466.gal : 5 ms
[2024-05-31 08:33:53] [INFO ] Time to serialize properties into /tmp/LTL628968571361583942.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2661353573401483466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL628968571361583942.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((gi0.gu0.Rows_0+gi0.gu0.Rows_1)+(gi0.gu0.Rows_2+gi0.gu0.Rows_3))+((gi0.gu0.Rows_4+gi0.gu0.Rows_5)+(gi0.gu0.Rows_6+gi0.gu...47728
Formula 0 simplified : F!"((((((((gi0.gu0.Rows_0+gi0.gu0.Rows_1)+(gi0.gu0.Rows_2+gi0.gu0.Rows_3))+((gi0.gu0.Rows_4+gi0.gu0.Rows_5)+(gi0.gu0.Rows_6+gi0.gu0....47712
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11023227664449730214
[2024-05-31 08:34:08] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11023227664449730214
Running compilation step : cd /tmp/ltsmin11023227664449730214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1662 ms.
Running link step : cd /tmp/ltsmin11023227664449730214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11023227664449730214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-BN09-LTLCardinality-01 finished in 207235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U (G(p1) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p0)))'
[2024-05-31 08:34:23] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4988242320186605828
[2024-05-31 08:34:23] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 08:34:23] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:34:23] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 08:34:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:34:23] [INFO ] Applying decomposition
[2024-05-31 08:34:23] [INFO ] Flatten gal took : 32 ms
[2024-05-31 08:34:23] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 08:34:23] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:34:23] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4988242320186605828
Running compilation step : cd /tmp/ltsmin4988242320186605828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2455 ms.
Running link step : cd /tmp/ltsmin4988242320186605828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4988242320186605828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15323222945602123313.txt' '-o' '/tmp/graph15323222945602123313.bin' '-w' '/tmp/graph15323222945602123313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15323222945602123313.bin' '-l' '-1' '-v' '-w' '/tmp/graph15323222945602123313.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:34:27] [INFO ] Decomposing Gal with order
[2024-05-31 08:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:34:28] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 08:34:28] [INFO ] Flatten gal took : 1238 ms
[2024-05-31 08:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 08:34:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality9545987956692001769.gal : 6 ms
[2024-05-31 08:34:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality9288679535833952483.ltl : 119 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9545987956692001769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9288679535833952483.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !(((G("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...38332
Formula 0 simplified : F!"((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Rows...38316
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.076: LTL layer: formula: ([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 3/ 8), 0.076: "([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.077: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.401: There are 735 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.401: State length is 1054, there are 746 groups
pins2lts-mc-linux64( 0/ 8), 0.401: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.401: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.401: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.401: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.154: [Blue] ~66 levels ~960 states ~113520 transitions
pins2lts-mc-linux64( 6/ 8), 1.204: [Blue] ~69 levels ~1920 states ~118528 transitions
pins2lts-mc-linux64( 6/ 8), 1.269: [Blue] ~69 levels ~3840 states ~126144 transitions
pins2lts-mc-linux64( 6/ 8), 1.420: [Blue] ~69 levels ~7680 states ~144192 transitions
pins2lts-mc-linux64( 6/ 8), 1.721: [Blue] ~69 levels ~15360 states ~181448 transitions
pins2lts-mc-linux64( 6/ 8), 2.316: [Blue] ~69 levels ~30720 states ~268544 transitions
pins2lts-mc-linux64( 0/ 8), 3.595: [Blue] ~68 levels ~61440 states ~445616 transitions
pins2lts-mc-linux64( 0/ 8), 5.945: [Blue] ~68 levels ~122880 states ~842440 transitions
pins2lts-mc-linux64( 0/ 8), 10.746: [Blue] ~69 levels ~245760 states ~1702856 transitions
pins2lts-mc-linux64( 0/ 8), 19.864: [Blue] ~69 levels ~491520 states ~3411800 transitions
pins2lts-mc-linux64( 0/ 8), 38.060: [Blue] ~70 levels ~983040 states ~7102872 transitions
pins2lts-mc-linux64( 0/ 8), 75.534: [Blue] ~70 levels ~1966080 states ~15374832 transitions
pins2lts-mc-linux64( 7/ 8), 151.457: [Blue] ~69 levels ~3932160 states ~31071144 transitions
pins2lts-mc-linux64( 5/ 8), 232.719: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 232.849:
pins2lts-mc-linux64( 0/ 8), 232.849: Explored 5654272 states 46744603 transitions, fanout: 8.267
pins2lts-mc-linux64( 0/ 8), 232.849: Total exploration time 232.440 sec (232.310 sec minimum, 232.365 sec on average)
pins2lts-mc-linux64( 0/ 8), 232.849: States per second: 24326, Transitions per second: 201104
pins2lts-mc-linux64( 0/ 8), 232.849:
pins2lts-mc-linux64( 0/ 8), 232.849: State space has 5760420 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 232.849: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 232.849: blue states: 5654272 (98.16%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 232.849: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 232.849: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 232.849:
pins2lts-mc-linux64( 0/ 8), 232.849: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 232.849:
pins2lts-mc-linux64( 0/ 8), 232.849: Queue width: 8B, total height: 544, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 232.849: Tree memory: 299.9MB, 54.6 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 232.849: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 232.849: Stored 859 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 232.849: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 232.849: Est. total memory use: 300.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4988242320186605828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4988242320186605828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(X((<>([](!(LTLAPp0==true)))||[]((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.
[2024-05-31 09:00:30] [INFO ] Applying decomposition
[2024-05-31 09:00:31] [INFO ] Flatten gal took : 232 ms
[2024-05-31 09:00:31] [INFO ] Decomposing Gal with order
[2024-05-31 09:00:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:00:33] [INFO ] Removed a total of 1872 redundant transitions.
[2024-05-31 09:00:33] [INFO ] Flatten gal took : 1452 ms
[2024-05-31 09:00:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2024-05-31 09:00:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality10059807176490812817.gal : 41 ms
[2024-05-31 09:00:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality10383169365843970166.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10059807176490812817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10383169365843970166.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !(((G("((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows...47206
Formula 0 simplified : F!"((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows_8...47190
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 152740 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15185108 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-BN09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-COL-BN09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556300347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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