fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r417-tall-171690556400387
Last Updated
July 7, 2024

About the Execution of 2023-gold for Sudoku-PT-AN07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.079 3600000.00 4876614.00 479470.20 FFT??T?TFFTFFFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 134K Apr 12 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 674K Apr 12 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 12 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Apr 12 11:31 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 83K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 300K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 636K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 524K Apr 12 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 412K Apr 12 11:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 204K 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-PT-AN07-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717147892613

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-PT-AN07
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 09:31:34] [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 09:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 09:31:34] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 09:31:34] [INFO ] Transformed 490 places.
[2024-05-31 09:31:34] [INFO ] Transformed 343 transitions.
[2024-05-31 09:31:34] [INFO ] Found NUPN structural information;
[2024-05-31 09:31:34] [INFO ] Parsed PT model containing 490 places and 343 transitions and 1372 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 15 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-05-31 09:31:34] [INFO ] Computed 147 invariants in 17 ms
[2024-05-31 09:31:34] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-31 09:31:34] [INFO ] Invariant cache hit.
[2024-05-31 09:31:35] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-31 09:31:35] [INFO ] Invariant cache hit.
[2024-05-31 09:31:35] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2024-05-31 09:31:35] [INFO ] Flatten gal took : 64 ms
[2024-05-31 09:31:35] [INFO ] Flatten gal took : 37 ms
[2024-05-31 09:31:35] [INFO ] Input system was already deterministic with 343 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 09:31:36] [INFO ] Invariant cache hit.
[2024-05-31 09:31:36] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 09:31:36] [INFO ] [Nat]Absence check using 147 positive place invariants in 26 ms returned sat
[2024-05-31 09:31:37] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-31 09:31:38] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 505 ms.
[2024-05-31 09:31:38] [INFO ] After 2098ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 7 ms.
Support contains 49 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.1 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 147/490 places, 343/343 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1291290 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{}
Probabilistic random walk after 1291290 steps, saw 193769 distinct states, run finished after 3007 ms. (steps per millisecond=429 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 343 rows 147 cols
[2024-05-31 09:31:42] [INFO ] Computed 20 invariants in 20 ms
[2024-05-31 09:31:42] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 9 ms returned sat
[2024-05-31 09:31:42] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 09:31:42] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2024-05-31 09:31:43] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 09:31:43] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-31 09:31:43] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-PT-AN07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(((p1 U p2)&&p0)))))))'
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-05-31 09:31:43] [INFO ] Computed 147 invariants in 5 ms
[2024-05-31 09:31:43] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 09:31:43] [INFO ] Invariant cache hit.
[2024-05-31 09:31:44] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-31 09:31:44] [INFO ] Invariant cache hit.
[2024-05-31 09:31:44] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 490/490 places, 343/343 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 414 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GT (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-00 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 22 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:31:44] [INFO ] Invariant cache hit.
[2024-05-31 09:31:44] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 09:31:44] [INFO ] Invariant cache hit.
[2024-05-31 09:31:45] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-05-31 09:31:45] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-31 09:31:45] [INFO ] Invariant cache hit.
[2024-05-31 09:31:45] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 987 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2346 reset in 3591 ms.
Product exploration explored 100000 steps with 2346 reset in 3563 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 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 30 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 101 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 38 ms :[(NOT p0)]
[2024-05-31 09:31:54] [INFO ] Invariant cache hit.
[2024-05-31 09:31:55] [INFO ] [Real]Absence check using 147 positive place invariants in 91 ms returned sat
[2024-05-31 09:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:31:56] [INFO ] [Real]Absence check using state equation in 1519 ms returned sat
[2024-05-31 09:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:31:59] [INFO ] [Nat]Absence check using 147 positive place invariants in 703 ms returned sat
[2024-05-31 09:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:32:11] [INFO ] [Nat]Absence check using state equation in 11797 ms returned unknown
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:32:11] [INFO ] Invariant cache hit.
[2024-05-31 09:32:11] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 09:32:11] [INFO ] Invariant cache hit.
[2024-05-31 09:32:12] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-31 09:32:12] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 09:32:12] [INFO ] Invariant cache hit.
[2024-05-31 09:32:12] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 939 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 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 37 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-31 09:32:14] [INFO ] Invariant cache hit.
[2024-05-31 09:32:14] [INFO ] [Real]Absence check using 147 positive place invariants in 100 ms returned sat
[2024-05-31 09:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:32:16] [INFO ] [Real]Absence check using state equation in 1461 ms returned sat
[2024-05-31 09:32:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:32:19] [INFO ] [Nat]Absence check using 147 positive place invariants in 697 ms returned sat
[2024-05-31 09:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:32:31] [INFO ] [Nat]Absence check using state equation in 11607 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2345 reset in 3475 ms.
Product exploration explored 100000 steps with 2348 reset in 3528 ms.
Built C files in :
/tmp/ltsmin13021731959944427628
[2024-05-31 09:32:38] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:32:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:38] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:32:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:38] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:32:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:38] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13021731959944427628
Running compilation step : cd /tmp/ltsmin13021731959944427628;'/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 900 ms.
Running link step : cd /tmp/ltsmin13021731959944427628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13021731959944427628;'/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/stateBased11335991796709591190.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 16 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:32:53] [INFO ] Invariant cache hit.
[2024-05-31 09:32:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 09:32:53] [INFO ] Invariant cache hit.
[2024-05-31 09:32:54] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-31 09:32:54] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 09:32:54] [INFO ] Invariant cache hit.
[2024-05-31 09:32:54] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 932 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin163102032320950681
[2024-05-31 09:32:54] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:32:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:54] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:32:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:54] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:32:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:32:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin163102032320950681
Running compilation step : cd /tmp/ltsmin163102032320950681;'/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 807 ms.
Running link step : cd /tmp/ltsmin163102032320950681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin163102032320950681;'/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/stateBased3384799726781770975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:33:09] [INFO ] Flatten gal took : 26 ms
[2024-05-31 09:33:09] [INFO ] Flatten gal took : 24 ms
[2024-05-31 09:33:09] [INFO ] Time to serialize gal into /tmp/LTL7876394010126304708.gal : 6 ms
[2024-05-31 09:33:09] [INFO ] Time to serialize properties into /tmp/LTL17989365011693246903.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/LTL7876394010126304708.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9931463384386329111.hoa' '-atoms' '/tmp/LTL17989365011693246903.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/LTL17989365011693246903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9931463384386329111.hoa
Detected timeout of ITS tools.
[2024-05-31 09:33:24] [INFO ] Flatten gal took : 22 ms
[2024-05-31 09:33:24] [INFO ] Flatten gal took : 21 ms
[2024-05-31 09:33:24] [INFO ] Time to serialize gal into /tmp/LTL3733176858876455723.gal : 4 ms
[2024-05-31 09:33:24] [INFO ] Time to serialize properties into /tmp/LTL8751869916850274053.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3733176858876455723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8751869916850274053.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_1_0)))+(((Cells_1_1+Cells_1_2)+(Cel...5422
Formula 0 simplified : GF!"(((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_1_0)))+(((Cells_1_1+Cells_1_2)+(Cells...5416
Detected timeout of ITS tools.
[2024-05-31 09:33:39] [INFO ] Flatten gal took : 27 ms
[2024-05-31 09:33:39] [INFO ] Applying decomposition
[2024-05-31 09:33:39] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9695120028391570950.txt' '-o' '/tmp/graph9695120028391570950.bin' '-w' '/tmp/graph9695120028391570950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9695120028391570950.bin' '-l' '-1' '-v' '-w' '/tmp/graph9695120028391570950.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:33:40] [INFO ] Decomposing Gal with order
[2024-05-31 09:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:33:40] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-31 09:33:40] [INFO ] Flatten gal took : 214 ms
[2024-05-31 09:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 13 ms.
[2024-05-31 09:33:40] [INFO ] Time to serialize gal into /tmp/LTL4780774310748506528.gal : 23 ms
[2024-05-31 09:33:40] [INFO ] Time to serialize properties into /tmp/LTL5603568468219731099.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/LTL4780774310748506528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5603568468219731099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((gu36.Cells_0_0+gu36.Cells_0_1)+(gu36.Cells_0_2+gu36.Cells_0_3))+((gu36.Cells_0_4+gu36.Cells_0_5)+(gu36.Cells_0_6+gu36.C...7382
Formula 0 simplified : GF!"(((((((gu36.Cells_0_0+gu36.Cells_0_1)+(gu36.Cells_0_2+gu36.Cells_0_3))+((gu36.Cells_0_4+gu36.Cells_0_5)+(gu36.Cells_0_6+gu36.Cel...7376
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13698552276493023753
[2024-05-31 09:33:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13698552276493023753
Running compilation step : cd /tmp/ltsmin13698552276493023753;'/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 687 ms.
Running link step : cd /tmp/ltsmin13698552276493023753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13698552276493023753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN07-LTLCardinality-03 finished in 146105 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 22 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:34:10] [INFO ] Invariant cache hit.
[2024-05-31 09:34:11] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 09:34:11] [INFO ] Invariant cache hit.
[2024-05-31 09:34:11] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-31 09:34:11] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:34:11] [INFO ] Invariant cache hit.
[2024-05-31 09:34:11] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 997 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3846 reset in 3823 ms.
Product exploration explored 100000 steps with 3846 reset in 3821 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-31 09:34:21] [INFO ] Invariant cache hit.
[2024-05-31 09:34:22] [INFO ] [Real]Absence check using 147 positive place invariants in 138 ms returned sat
[2024-05-31 09:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:34:26] [INFO ] [Real]Absence check using state equation in 4434 ms returned sat
[2024-05-31 09:34:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:34:28] [INFO ] [Nat]Absence check using 147 positive place invariants in 555 ms returned sat
[2024-05-31 09:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:34:41] [INFO ] [Nat]Absence check using state equation in 12793 ms returned unknown
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 31 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:34:41] [INFO ] Invariant cache hit.
[2024-05-31 09:34:41] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 09:34:41] [INFO ] Invariant cache hit.
[2024-05-31 09:34:42] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-31 09:34:42] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 09:34:42] [INFO ] Invariant cache hit.
[2024-05-31 09:34:42] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 913 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-31 09:34:44] [INFO ] Invariant cache hit.
[2024-05-31 09:34:45] [INFO ] [Real]Absence check using 147 positive place invariants in 139 ms returned sat
[2024-05-31 09:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:34:49] [INFO ] [Real]Absence check using state equation in 4435 ms returned sat
[2024-05-31 09:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:34:51] [INFO ] [Nat]Absence check using 147 positive place invariants in 546 ms returned sat
[2024-05-31 09:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:35:04] [INFO ] [Nat]Absence check using state equation in 12833 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3741 ms.
Product exploration explored 100000 steps with 3846 reset in 3798 ms.
Built C files in :
/tmp/ltsmin10234938173187264189
[2024-05-31 09:35:12] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:35:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:12] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:35:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:12] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:35:12] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:12] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10234938173187264189
Running compilation step : cd /tmp/ltsmin10234938173187264189;'/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 803 ms.
Running link step : cd /tmp/ltsmin10234938173187264189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10234938173187264189;'/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/stateBased6897928719466403781.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:35:27] [INFO ] Invariant cache hit.
[2024-05-31 09:35:27] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-31 09:35:27] [INFO ] Invariant cache hit.
[2024-05-31 09:35:28] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-31 09:35:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:35:28] [INFO ] Invariant cache hit.
[2024-05-31 09:35:28] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin4888779536391331893
[2024-05-31 09:35:28] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:35:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:28] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:35:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:28] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:35:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:35:28] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4888779536391331893
Running compilation step : cd /tmp/ltsmin4888779536391331893;'/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 826 ms.
Running link step : cd /tmp/ltsmin4888779536391331893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4888779536391331893;'/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/stateBased12608646435202092683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:35:43] [INFO ] Flatten gal took : 21 ms
[2024-05-31 09:35:43] [INFO ] Flatten gal took : 20 ms
[2024-05-31 09:35:43] [INFO ] Time to serialize gal into /tmp/LTL15871094089529315883.gal : 2 ms
[2024-05-31 09:35:43] [INFO ] Time to serialize properties into /tmp/LTL1702416927601262113.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/LTL15871094089529315883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3681895514012086522.hoa' '-atoms' '/tmp/LTL1702416927601262113.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/LTL1702416927601262113.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3681895514012086522.hoa
Detected timeout of ITS tools.
[2024-05-31 09:35:58] [INFO ] Flatten gal took : 17 ms
[2024-05-31 09:35:58] [INFO ] Flatten gal took : 17 ms
[2024-05-31 09:35:58] [INFO ] Time to serialize gal into /tmp/LTL11014356521242038197.gal : 3 ms
[2024-05-31 09:35:58] [INFO ] Time to serialize properties into /tmp/LTL739708582942738505.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/LTL11014356521242038197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL739708582942738505.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_1_0)))+(((Board_0...5913
Formula 0 simplified : G!"(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_1_0)))+(((Board_0_...5909
Detected timeout of ITS tools.
[2024-05-31 09:36:13] [INFO ] Flatten gal took : 16 ms
[2024-05-31 09:36:13] [INFO ] Applying decomposition
[2024-05-31 09:36:13] [INFO ] Flatten gal took : 15 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/graph947512404768875044.txt' '-o' '/tmp/graph947512404768875044.bin' '-w' '/tmp/graph947512404768875044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph947512404768875044.bin' '-l' '-1' '-v' '-w' '/tmp/graph947512404768875044.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:36:13] [INFO ] Decomposing Gal with order
[2024-05-31 09:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:36:13] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-31 09:36:13] [INFO ] Flatten gal took : 116 ms
[2024-05-31 09:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 11 ms.
[2024-05-31 09:36:14] [INFO ] Time to serialize gal into /tmp/LTL13007035571803896038.gal : 3 ms
[2024-05-31 09:36:14] [INFO ] Time to serialize properties into /tmp/LTL2423731157745326004.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/LTL13007035571803896038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2423731157745326004.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+(gu1.Board_0_0_2+gu1.Board_0_0_3))+((gu1.Board_0_0_4+gu1.Board_0_0_5)+(gu1.Board_0_0...7677
Formula 0 simplified : G!"(((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+(gu1.Board_0_0_2+gu1.Board_0_0_3))+((gu1.Board_0_0_4+gu1.Board_0_0_5)+(gu1.Board_0_0_...7673
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15696791941269780946
[2024-05-31 09:36:29] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15696791941269780946
Running compilation step : cd /tmp/ltsmin15696791941269780946;'/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 673 ms.
Running link step : cd /tmp/ltsmin15696791941269780946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15696791941269780946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN07-LTLCardinality-04 finished in 153407 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(p2)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:36:44] [INFO ] Invariant cache hit.
[2024-05-31 09:36:44] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-31 09:36:44] [INFO ] Invariant cache hit.
[2024-05-31 09:36:44] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-31 09:36:44] [INFO ] Invariant cache hit.
[2024-05-31 09:36:44] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3846 reset in 7900 ms.
Product exploration explored 100000 steps with 3846 reset in 7949 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1870 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 235 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 09:37:13] [INFO ] Invariant cache hit.
[2024-05-31 09:37:14] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 09:37:14] [INFO ] [Nat]Absence check using 147 positive place invariants in 23 ms returned sat
[2024-05-31 09:37:14] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 5688 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 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 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:37:20] [INFO ] Invariant cache hit.
[2024-05-31 09:37:20] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 09:37:20] [INFO ] Invariant cache hit.
[2024-05-31 09:37:20] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-31 09:37:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:37:20] [INFO ] Invariant cache hit.
[2024-05-31 09:37:21] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 207 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 09:37:26] [INFO ] Invariant cache hit.
[2024-05-31 09:37:26] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 392 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 5018 ms.
Product exploration explored 100000 steps with 3846 reset in 5043 ms.
Built C files in :
/tmp/ltsmin739272688827003164
[2024-05-31 09:37:37] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:37:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:37] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:37:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:37] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:37:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin739272688827003164
Running compilation step : cd /tmp/ltsmin739272688827003164;'/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 850 ms.
Running link step : cd /tmp/ltsmin739272688827003164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin739272688827003164;'/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/stateBased5339913787524597488.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:37:52] [INFO ] Invariant cache hit.
[2024-05-31 09:37:52] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-31 09:37:52] [INFO ] Invariant cache hit.
[2024-05-31 09:37:53] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-31 09:37:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:37:53] [INFO ] Invariant cache hit.
[2024-05-31 09:37:53] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 882 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin6573245667468089718
[2024-05-31 09:37:53] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:37:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:53] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:37:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:53] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:37:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:37:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6573245667468089718
Running compilation step : cd /tmp/ltsmin6573245667468089718;'/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 899 ms.
Running link step : cd /tmp/ltsmin6573245667468089718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6573245667468089718;'/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/stateBased2487631272800842110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:38:08] [INFO ] Flatten gal took : 16 ms
[2024-05-31 09:38:08] [INFO ] Flatten gal took : 14 ms
[2024-05-31 09:38:08] [INFO ] Time to serialize gal into /tmp/LTL3119850652948737929.gal : 3 ms
[2024-05-31 09:38:08] [INFO ] Time to serialize properties into /tmp/LTL3101693121522498057.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/LTL3119850652948737929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16748659913633090060.hoa' '-atoms' '/tmp/LTL3101693121522498057.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/LTL3101693121522498057.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16748659913633090060.hoa
Detected timeout of ITS tools.
[2024-05-31 09:38:23] [INFO ] Flatten gal took : 15 ms
[2024-05-31 09:38:23] [INFO ] Flatten gal took : 15 ms
[2024-05-31 09:38:23] [INFO ] Time to serialize gal into /tmp/LTL9276613477286536640.gal : 3 ms
[2024-05-31 09:38:23] [INFO ] Time to serialize properties into /tmp/LTL6214774485773262437.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/LTL9276613477286536640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6214774485773262437.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_1_0)))+(((Columns...16372
Formula 0 simplified : G(F!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_1_0)))+(((Columns_1...16364
Detected timeout of ITS tools.
[2024-05-31 09:38:38] [INFO ] Flatten gal took : 17 ms
[2024-05-31 09:38:38] [INFO ] Applying decomposition
[2024-05-31 09:38:38] [INFO ] Flatten gal took : 15 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/graph7095322896081562797.txt' '-o' '/tmp/graph7095322896081562797.bin' '-w' '/tmp/graph7095322896081562797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7095322896081562797.bin' '-l' '-1' '-v' '-w' '/tmp/graph7095322896081562797.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:38:39] [INFO ] Decomposing Gal with order
[2024-05-31 09:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:38:39] [INFO ] Removed a total of 588 redundant transitions.
[2024-05-31 09:38:39] [INFO ] Flatten gal took : 105 ms
[2024-05-31 09:38:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 09:38:39] [INFO ] Time to serialize gal into /tmp/LTL16113053367250575640.gal : 3 ms
[2024-05-31 09:38:39] [INFO ] Time to serialize properties into /tmp/LTL7787458134105259500.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/LTL16113053367250575640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7787458134105259500.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0...21076
Formula 0 simplified : G(F!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_6...21068
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11449545044483012550
[2024-05-31 09:38:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11449545044483012550
Running compilation step : cd /tmp/ltsmin11449545044483012550;'/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 743 ms.
Running link step : cd /tmp/ltsmin11449545044483012550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11449545044483012550;'/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))||((LTLAPp1==true)&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN07-LTLCardinality-06 finished in 145412 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(((X(p0) U (X(p2)||p1)) U p2)))'
Support contains 4 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 148 transition count 343
Applied a total of 342 rules in 19 ms. Remains 148 /490 variables (removed 342) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 148 cols
[2024-05-31 09:39:09] [INFO ] Computed 20 invariants in 12 ms
[2024-05-31 09:39:09] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 09:39:09] [INFO ] Invariant cache hit.
[2024-05-31 09:39:10] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-31 09:39:10] [INFO ] Invariant cache hit.
[2024-05-31 09:39:10] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/490 places, 343/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 713 ms. Remains : 148/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s138 0) (EQ s49 1)), p1:(OR (EQ s138 0) (EQ s49 1)), p0:(OR (EQ s105 0) (EQ s17 1))], 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]]
Entered a terminal (fully accepting) state of product in 85 steps with 11 reset in 9 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-11 finished in 938 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(p1)||p0))))'
Support contains 3 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.3 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2024-05-31 09:39:10] [INFO ] Computed 20 invariants in 6 ms
[2024-05-31 09:39:10] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 09:39:10] [INFO ] Invariant cache hit.
[2024-05-31 09:39:11] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-31 09:39:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:39:11] [INFO ] Invariant cache hit.
[2024-05-31 09:39:11] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 731 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s119 1), p0:(OR (EQ s14 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 199 steps with 4 reset in 9 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-12 finished in 828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 147 transition count 343
Applied a total of 343 rules in 9 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:39:11] [INFO ] Invariant cache hit.
[2024-05-31 09:39:11] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 09:39:11] [INFO ] Invariant cache hit.
[2024-05-31 09:39:11] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-31 09:39:11] [INFO ] Invariant cache hit.
[2024-05-31 09:39:12] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s93 0) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-PT-AN07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-15 finished in 816 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&X(p2)))))'
Found a Shortening insensitive property : Sudoku-PT-AN07-LTLCardinality-06
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-05-31 09:39:12] [INFO ] Computed 147 invariants in 2 ms
[2024-05-31 09:39:12] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-31 09:39:12] [INFO ] Invariant cache hit.
[2024-05-31 09:39:13] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-31 09:39:13] [INFO ] Invariant cache hit.
[2024-05-31 09:39:13] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 743 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3846 reset in 7968 ms.
Product exploration explored 100000 steps with 3846 reset in 7949 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1866 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 09:39:41] [INFO ] Invariant cache hit.
[2024-05-31 09:39:42] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 09:39:42] [INFO ] [Nat]Absence check using 147 positive place invariants in 25 ms returned sat
[2024-05-31 09:39:42] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 5516 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 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 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:39:48] [INFO ] Invariant cache hit.
[2024-05-31 09:39:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-31 09:39:48] [INFO ] Invariant cache hit.
[2024-05-31 09:39:48] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-31 09:39:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:39:48] [INFO ] Invariant cache hit.
[2024-05-31 09:39:48] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 744 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 180 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 09:39:54] [INFO ] Invariant cache hit.
[2024-05-31 09:39:54] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 438 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 4948 ms.
Product exploration explored 100000 steps with 3846 reset in 5006 ms.
Built C files in :
/tmp/ltsmin8541879474014133726
[2024-05-31 09:40:05] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:40:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:05] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:40:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:05] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:40:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:05] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8541879474014133726
Running compilation step : cd /tmp/ltsmin8541879474014133726;'/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 864 ms.
Running link step : cd /tmp/ltsmin8541879474014133726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8541879474014133726;'/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/stateBased13168823063820537916.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 16 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-31 09:40:20] [INFO ] Invariant cache hit.
[2024-05-31 09:40:20] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 09:40:20] [INFO ] Invariant cache hit.
[2024-05-31 09:40:20] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-31 09:40:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:40:20] [INFO ] Invariant cache hit.
[2024-05-31 09:40:20] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin1841440783368687445
[2024-05-31 09:40:21] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:40:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:21] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:40:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:21] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:40:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:40:21] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1841440783368687445
Running compilation step : cd /tmp/ltsmin1841440783368687445;'/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 859 ms.
Running link step : cd /tmp/ltsmin1841440783368687445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1841440783368687445;'/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/stateBased18444429937841153128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:40:36] [INFO ] Flatten gal took : 14 ms
[2024-05-31 09:40:36] [INFO ] Flatten gal took : 14 ms
[2024-05-31 09:40:36] [INFO ] Time to serialize gal into /tmp/LTL3819375896190332280.gal : 2 ms
[2024-05-31 09:40:36] [INFO ] Time to serialize properties into /tmp/LTL16190383274559194603.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3819375896190332280.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12244430091059948780.hoa' '-atoms' '/tmp/LTL16190383274559194603.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/LTL16190383274559194603.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12244430091059948780.hoa
Detected timeout of ITS tools.
[2024-05-31 09:40:51] [INFO ] Flatten gal took : 21 ms
[2024-05-31 09:40:51] [INFO ] Flatten gal took : 16 ms
[2024-05-31 09:40:51] [INFO ] Time to serialize gal into /tmp/LTL17336938778315745733.gal : 3 ms
[2024-05-31 09:40:51] [INFO ] Time to serialize properties into /tmp/LTL14628436629332055015.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/LTL17336938778315745733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14628436629332055015.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 : !((F((G("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_1_0)))+(((Columns...16372
Formula 0 simplified : G(F!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_1_0)))+(((Columns_1...16364
Detected timeout of ITS tools.
[2024-05-31 09:41:06] [INFO ] Flatten gal took : 12 ms
[2024-05-31 09:41:06] [INFO ] Applying decomposition
[2024-05-31 09:41:06] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10470654008451308557.txt' '-o' '/tmp/graph10470654008451308557.bin' '-w' '/tmp/graph10470654008451308557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10470654008451308557.bin' '-l' '-1' '-v' '-w' '/tmp/graph10470654008451308557.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:41:06] [INFO ] Decomposing Gal with order
[2024-05-31 09:41:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:41:06] [INFO ] Removed a total of 588 redundant transitions.
[2024-05-31 09:41:06] [INFO ] Flatten gal took : 93 ms
[2024-05-31 09:41:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 09:41:06] [INFO ] Time to serialize gal into /tmp/LTL17678085331077725339.gal : 2 ms
[2024-05-31 09:41:06] [INFO ] Time to serialize properties into /tmp/LTL17015335169581857349.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/LTL17678085331077725339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17015335169581857349.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 : !((F((G("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0...21076
Formula 0 simplified : G(F!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_6...21068
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9168730552819169080
[2024-05-31 09:41:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9168730552819169080
Running compilation step : cd /tmp/ltsmin9168730552819169080;'/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 746 ms.
Running link step : cd /tmp/ltsmin9168730552819169080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9168730552819169080;'/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))||((LTLAPp1==true)&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN07-LTLCardinality-06 finished in 144569 ms.
[2024-05-31 09:41:37] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5465388663240860426
[2024-05-31 09:41:37] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-31 09:41:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:41:37] [INFO ] Applying decomposition
[2024-05-31 09:41:37] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-31 09:41:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:41:37] [INFO ] Flatten gal took : 13 ms
[2024-05-31 09:41:37] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-31 09:41:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:41:37] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5465388663240860426
Running compilation step : cd /tmp/ltsmin5465388663240860426;'/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'
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/graph16104621396767933617.txt' '-o' '/tmp/graph16104621396767933617.bin' '-w' '/tmp/graph16104621396767933617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16104621396767933617.bin' '-l' '-1' '-v' '-w' '/tmp/graph16104621396767933617.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:41:37] [INFO ] Decomposing Gal with order
[2024-05-31 09:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:41:37] [INFO ] Removed a total of 882 redundant transitions.
[2024-05-31 09:41:37] [INFO ] Flatten gal took : 119 ms
[2024-05-31 09:41:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 09:41:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality17119192351729896973.gal : 2 ms
[2024-05-31 09:41:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality9322592255062766528.ltl : 131 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/LTLCardinality17119192351729896973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9322592255062766528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(G("(((((((gu2.Cells_0_0+gu2.Cells_0_1)+(gu2.Cells_0_2+gu2.Cells_0_3))+((gu2.Cells_0_4+gu2.Cells_0_5)+(gu2.Cells_0_6+gu2.Cells_1_0...6990
Formula 0 simplified : GF!"(((((((gu2.Cells_0_0+gu2.Cells_0_1)+(gu2.Cells_0_2+gu2.Cells_0_3))+((gu2.Cells_0_4+gu2.Cells_0_5)+(gu2.Cells_0_6+gu2.Cells_1_0))...6984
Compilation finished in 1050 ms.
Running link step : cd /tmp/ltsmin5465388663240860426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5465388663240860426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Initializing POR dependencies: labels 348, guards 343
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.680: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 1.681: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 1.681: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.101: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.198: There are 349 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.198: State length is 491, there are 347 groups
pins2lts-mc-linux64( 0/ 8), 2.198: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.198: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.198: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.198: Visible groups: 0 / 347, labels: 1 / 349
pins2lts-mc-linux64( 0/ 8), 2.198: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.198: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 3.050: [Blue] ~40 levels ~960 states ~37608 transitions
pins2lts-mc-linux64( 4/ 8), 3.089: [Blue] ~40 levels ~1920 states ~41376 transitions
pins2lts-mc-linux64( 4/ 8), 3.139: [Blue] ~40 levels ~3840 states ~49016 transitions
pins2lts-mc-linux64( 4/ 8), 3.267: [Blue] ~42 levels ~7680 states ~66504 transitions
pins2lts-mc-linux64( 4/ 8), 3.460: [Blue] ~42 levels ~15360 states ~103408 transitions
pins2lts-mc-linux64( 1/ 8), 4.530: [Blue] ~43 levels ~30720 states ~179488 transitions
pins2lts-mc-linux64( 1/ 8), 7.023: [Blue] ~44 levels ~61440 states ~349304 transitions
pins2lts-mc-linux64( 1/ 8), 13.477: [Blue] ~44 levels ~122880 states ~674616 transitions
pins2lts-mc-linux64( 2/ 8), 27.956: [Blue] ~45 levels ~245760 states ~1507952 transitions
pins2lts-mc-linux64( 1/ 8), 52.530: [Blue] ~44 levels ~491520 states ~3003896 transitions
pins2lts-mc-linux64( 1/ 8), 98.855: [Blue] ~45 levels ~983040 states ~6223632 transitions
pins2lts-mc-linux64( 0/ 8), 129.857: [Blue] ~43 levels ~1966080 states ~13335344 transitions
pins2lts-mc-linux64( 0/ 8), 195.101: [Blue] ~44 levels ~3932160 states ~28107704 transitions
pins2lts-mc-linux64( 0/ 8), 326.956: [Blue] ~44 levels ~7864320 states ~58088856 transitions
pins2lts-mc-linux64( 0/ 8), 491.196: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 491.271:
pins2lts-mc-linux64( 0/ 8), 491.272: Explored 11713113 states 94277112 transitions, fanout: 8.049
pins2lts-mc-linux64( 0/ 8), 491.272: Total exploration time 489.060 sec (488.990 sec minimum, 489.012 sec on average)
pins2lts-mc-linux64( 0/ 8), 491.272: States per second: 23950, Transitions per second: 192772
pins2lts-mc-linux64( 0/ 8), 491.272:
pins2lts-mc-linux64( 0/ 8), 491.272: State space has 11746622 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 491.272: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 491.272: blue states: 11713113 (99.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 491.272: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 491.272: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 491.272:
pins2lts-mc-linux64( 0/ 8), 491.272: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 491.272:
pins2lts-mc-linux64( 0/ 8), 491.272: Queue width: 8B, total height: 363, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 491.272: Tree memory: 345.6MB, 30.9 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 491.272: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 491.272: Stored 345 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 491.272: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 491.272: Est. total memory use: 345.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5465388663240860426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5465388663240860426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
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 10:05:15] [INFO ] Applying decomposition
[2024-05-31 10:05:15] [INFO ] Flatten gal took : 106 ms
[2024-05-31 10:05:15] [INFO ] Decomposing Gal with order
[2024-05-31 10:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:05:16] [INFO ] Removed a total of 582 redundant transitions.
[2024-05-31 10:05:16] [INFO ] Flatten gal took : 393 ms
[2024-05-31 10:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-31 10:05:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality10448635791181002021.gal : 57 ms
[2024-05-31 10:05:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality17226139329783954736.ltl : 17 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/LTLCardinality10448635791181002021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17226139329783954736.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 : !((F(G("(((((((gu10.Cells_0_0+gu44.Cells_0_1)+(gu29.Cells_0_2+gu13.Cells_0_3))+((gu1.Cells_0_4+gu47.Cells_0_5)+(gu50.Cells_0_6+gu64.Ce...7324
Formula 0 simplified : GF!"(((((((gu10.Cells_0_0+gu44.Cells_0_1)+(gu29.Cells_0_2+gu13.Cells_0_3))+((gu1.Cells_0_4+gu47.Cells_0_5)+(gu50.Cells_0_6+gu64.Cell...7318
Detected timeout of ITS tools.
[2024-05-31 10:28:39] [INFO ] Flatten gal took : 135 ms
[2024-05-31 10:28:40] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-31 10:28:40] [INFO ] Transformed 490 places.
[2024-05-31 10:28:40] [INFO ] Transformed 343 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 10:28:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality3357237138873722544.gal : 125 ms
[2024-05-31 10:28:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality7428714133567765124.ltl : 15 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/LTLCardinality3357237138873722544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7428714133567765124.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_1_0)))+(((Cells_1_1+Cells_1_2)+(Cel...5422
Formula 0 simplified : GF!"(((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_1_0)))+(((Cells_1_1+Cells_1_2)+(Cells...5416
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12102500 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078348 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-PT-AN07"
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-PT-AN07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN07.tgz
mv Sudoku-PT-AN07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;