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.r400-tall-171690532700611.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 itstools
Input is Sudoku-PT-AN06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532700611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 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 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 132K 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-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717049182207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 06:06:23] [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-30 06:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:06:23] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-30 06:06:23] [INFO ] Transformed 324 places.
[2024-05-30 06:06:23] [INFO ] Transformed 216 transitions.
[2024-05-30 06:06:23] [INFO ] Found NUPN structural information;
[2024-05-30 06:06:23] [INFO ] Parsed PT model containing 324 places and 216 transitions and 864 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-30 06:06:23] [INFO ] Computed 108 invariants in 17 ms
[2024-05-30 06:06:23] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-30 06:06:23] [INFO ] Invariant cache hit.
[2024-05-30 06:06:24] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 80ms
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2024-05-30 06:06:24] [INFO ] Flatten gal took : 45 ms
[2024-05-30 06:06:24] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:06:24] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (1273 resets) in 2721 ms. (14 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40004 steps (16 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
[2024-05-30 06:06:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 324/540 variables, and 216 constraints, problems are : Problem set: 3 solved, 0 unsolved in 134 ms.
Refiners :[Domain max(s): 108/324 constraints, Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 0/324 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&X(p1)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.4 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-30 06:06:26] [INFO ] Computed 17 invariants in 12 ms
[2024-05-30 06:06:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 06:06:26] [INFO ] Invariant cache hit.
[2024-05-30 06:06:26] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-30 06:06:26] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-02
Product exploration explored 100000 steps with 33469 reset in 2686 ms.
Product exploration explored 100000 steps with 33351 reset in 2663 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 301 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1273 resets) in 968 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 769462 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 6
Probabilistic random walk after 769462 steps, saw 121111 distinct states, run finished after 3007 ms. (steps per millisecond=255 ) properties seen :0
[2024-05-30 06:06:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 233 constraints, problems are : Problem set: 2 solved, 4 unsolved in 196 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 4/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 237 constraints, problems are : Problem set: 2 solved, 4 unsolved in 515 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 759ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=11 )
Parikh walk visited 4 properties in 8 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 17 factoid took 238 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-02 finished in 11446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 12 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-05-30 06:06:37] [INFO ] Invariant cache hit.
[2024-05-30 06:06:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 06:06:37] [INFO ] Invariant cache hit.
[2024-05-30 06:06:37] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-03
Product exploration explored 100000 steps with 3185 reset in 1632 ms.
Product exploration explored 100000 steps with 3186 reset in 1587 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (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 13 factoid took 785 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1274 resets) in 816 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 716606 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 4
Probabilistic random walk after 716606 steps, saw 116299 distinct states, run finished after 3002 ms. (steps per millisecond=238 ) properties seen :0
[2024-05-30 06:06:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 233 constraints, problems are : Problem set: 1 solved, 3 unsolved in 134 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 3/236 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 236 constraints, problems are : Problem set: 1 solved, 3 unsolved in 389 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 562ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-03 finished in 8852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-30 06:06:46] [INFO ] Computed 108 invariants in 5 ms
[2024-05-30 06:06:46] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-30 06:06:46] [INFO ] Invariant cache hit.
[2024-05-30 06:06:46] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-30 06:06:46] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-05
Product exploration explored 100000 steps with 5000 reset in 2229 ms.
Product exploration explored 100000 steps with 5000 reset in 2241 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 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 28 ms :[(NOT p0)]
RANDOM walk for 76 steps (0 resets) in 10 ms. (6 steps per ms) remains 0/1 properties
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 108 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 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-30 06:06:52] [INFO ] Invariant cache hit.
[2024-05-30 06:06:52] [INFO ] [Real]Absence check using 108 positive place invariants in 126 ms returned sat
[2024-05-30 06:06:53] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-05-30 06:06:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:06:55] [INFO ] [Nat]Absence check using 108 positive place invariants in 19 ms returned sat
[2024-05-30 06:06:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-30 06:06:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 06:06:55] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 06:06:55] [INFO ] Invariant cache hit.
[2024-05-30 06:06:55] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-30 06:06:55] [INFO ] Invariant cache hit.
[2024-05-30 06:06:55] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-30 06:06:55] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 378 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 38 ms :[(NOT p0)]
RANDOM walk for 76 steps (0 resets) in 9 ms. (7 steps per ms) remains 0/1 properties
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 134 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-30 06:06:56] [INFO ] Invariant cache hit.
[2024-05-30 06:06:57] [INFO ] [Real]Absence check using 108 positive place invariants in 118 ms returned sat
[2024-05-30 06:06:58] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-05-30 06:06:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:06:59] [INFO ] [Nat]Absence check using 108 positive place invariants in 22 ms returned sat
[2024-05-30 06:07:00] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-30 06:07:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 06:07:00] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2213 ms.
Product exploration explored 100000 steps with 5000 reset in 2253 ms.
Built C files in :
/tmp/ltsmin14740775432031197066
[2024-05-30 06:07:04] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-30 06:07:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:04] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-30 06:07:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:04] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-30 06:07:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:04] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14740775432031197066
Running compilation step : cd /tmp/ltsmin14740775432031197066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 787 ms.
Running link step : cd /tmp/ltsmin14740775432031197066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14740775432031197066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9982786252258601544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 06:07:19] [INFO ] Invariant cache hit.
[2024-05-30 06:07:19] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 06:07:19] [INFO ] Invariant cache hit.
[2024-05-30 06:07:20] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-30 06:07:20] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin34543563427691178
[2024-05-30 06:07:20] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-30 06:07:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:20] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-30 06:07:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:20] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-30 06:07:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:07:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin34543563427691178
Running compilation step : cd /tmp/ltsmin34543563427691178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 587 ms.
Running link step : cd /tmp/ltsmin34543563427691178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin34543563427691178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased425558625822957465.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 06:07:35] [INFO ] Flatten gal took : 18 ms
[2024-05-30 06:07:35] [INFO ] Flatten gal took : 23 ms
[2024-05-30 06:07:35] [INFO ] Time to serialize gal into /tmp/LTL5878189969041850065.gal : 4 ms
[2024-05-30 06:07:35] [INFO ] Time to serialize properties into /tmp/LTL8122712508175840667.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5878189969041850065.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13777379202306363657.hoa' '-atoms' '/tmp/LTL8122712508175840667.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8122712508175840667.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13777379202306363657.hoa
Detected timeout of ITS tools.
[2024-05-30 06:07:50] [INFO ] Flatten gal took : 15 ms
[2024-05-30 06:07:50] [INFO ] Flatten gal took : 14 ms
[2024-05-30 06:07:50] [INFO ] Time to serialize gal into /tmp/LTL7690342890405727379.gal : 3 ms
[2024-05-30 06:07:50] [INFO ] Time to serialize properties into /tmp/LTL398732775753394215.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7690342890405727379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL398732775753394215.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
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_1_0+Board_0_1_1)))+(((Board_0_1...3448
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_1_0+Board_0_1_1)))+(((Board_0_1_...3444
Detected timeout of ITS tools.
[2024-05-30 06:08:05] [INFO ] Flatten gal took : 13 ms
[2024-05-30 06:08:05] [INFO ] Applying decomposition
[2024-05-30 06:08:05] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph16551267751819892127.txt' '-o' '/tmp/graph16551267751819892127.bin' '-w' '/tmp/graph16551267751819892127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16551267751819892127.bin' '-l' '-1' '-v' '-w' '/tmp/graph16551267751819892127.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:08:05] [INFO ] Decomposing Gal with order
[2024-05-30 06:08:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:08:05] [INFO ] Removed a total of 279 redundant transitions.
[2024-05-30 06:08:05] [INFO ] Flatten gal took : 137 ms
[2024-05-30 06:08:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 10 ms.
[2024-05-30 06:08:06] [INFO ] Time to serialize gal into /tmp/LTL17944837959154975362.gal : 8 ms
[2024-05-30 06:08:06] [INFO ] Time to serialize properties into /tmp/LTL2765990100026809421.ltl : 4 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17944837959154975362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2765990100026809421.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0...4456
Formula 0 simplified : G!"(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0+...4452
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN06-LTLCardinality-05 finished in 94699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.4 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-30 06:08:21] [INFO ] Computed 17 invariants in 12 ms
[2024-05-30 06:08:21] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-30 06:08:21] [INFO ] Invariant cache hit.
[2024-05-30 06:08:21] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-30 06:08:21] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-06
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-06 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-30 06:08:21] [INFO ] Computed 108 invariants in 2 ms
[2024-05-30 06:08:21] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-30 06:08:21] [INFO ] Invariant cache hit.
[2024-05-30 06:08:21] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 1893 ms.
Product exploration explored 100000 steps with 50000 reset in 1925 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-07 finished in 4760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 110 are kept as prefixes of interest. Removing 214 places using SCC suffix rule.2 ms
Discarding 214 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 110 /324 variables (removed 214) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 110 cols
[2024-05-30 06:08:26] [INFO ] Computed 17 invariants in 4 ms
[2024-05-30 06:08:26] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 06:08:26] [INFO ] Invariant cache hit.
[2024-05-30 06:08:26] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-30 06:08:26] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 110/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-08
Stuttering criterion allowed to conclude after 1224 steps with 100 reset in 27 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-08 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(F((X(p0)&&!p0)) U X(!X(!p1))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 7 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-30 06:08:26] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 06:08:26] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-30 06:08:26] [INFO ] Invariant cache hit.
[2024-05-30 06:08:27] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 388 ms :[true, (AND p0 p1), p0, p1, false, false, p1, p1, p1, p1, p1]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-09 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1||G(p2)))))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 109 are kept as prefixes of interest. Removing 215 places using SCC suffix rule.1 ms
Discarding 215 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2024-05-30 06:08:27] [INFO ] Computed 17 invariants in 5 ms
[2024-05-30 06:08:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-30 06:08:27] [INFO ] Invariant cache hit.
[2024-05-30 06:08:27] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-30 06:08:27] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-12
Stuttering criterion allowed to conclude after 43 steps with 1 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-12 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&X(F(p1))) U X(p2)))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-30 06:08:27] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 06:08:28] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-30 06:08:28] [INFO ] Invariant cache hit.
[2024-05-30 06:08:28] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), false]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-15
Stuttering criterion allowed to conclude after 4527 steps with 1766 reset in 95 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-15 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-30 06:08:28] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15905476048521845574
[2024-05-30 06:08:28] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-30 06:08:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:08:28] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-30 06:08:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:08:28] [INFO ] Applying decomposition
[2024-05-30 06:08:28] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-30 06:08:28] [INFO ] Flatten gal took : 16 ms
[2024-05-30 06:08:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:08:28] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15905476048521845574
Running compilation step : cd /tmp/ltsmin15905476048521845574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph11454726074915946137.txt' '-o' '/tmp/graph11454726074915946137.bin' '-w' '/tmp/graph11454726074915946137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11454726074915946137.bin' '-l' '-1' '-v' '-w' '/tmp/graph11454726074915946137.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:08:28] [INFO ] Decomposing Gal with order
[2024-05-30 06:08:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:08:28] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-30 06:08:28] [INFO ] Flatten gal took : 53 ms
[2024-05-30 06:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 4 ms.
[2024-05-30 06:08:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality11695081105322773523.gal : 3 ms
[2024-05-30 06:08:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality3564075704023717261.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11695081105322773523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3564075704023717261.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0...4456
Formula 0 simplified : G!"(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0+...4452
Compilation finished in 698 ms.
Running link step : cd /tmp/ltsmin15905476048521845574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15905476048521845574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Initializing POR dependencies: labels 217, guards 216
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.479: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 7/ 8), 0.479: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.480: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.577: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.587: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.603: There are 219 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.603: State length is 325, there are 217 groups
pins2lts-mc-linux64( 0/ 8), 0.603: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.603: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.603: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.603: Visible groups: 0 / 217, labels: 1 / 219
pins2lts-mc-linux64( 0/ 8), 0.603: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.603: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.868: [Blue] ~20 levels ~960 states ~17112 transitions
pins2lts-mc-linux64( 3/ 8), 0.934: [Blue] ~20 levels ~1920 states ~18080 transitions
pins2lts-mc-linux64( 7/ 8), 1.053: [Blue] ~20 levels ~3840 states ~22168 transitions
pins2lts-mc-linux64( 7/ 8), 1.256: [Blue] ~20 levels ~7680 states ~30544 transitions
pins2lts-mc-linux64( 7/ 8), 1.649: [Blue] ~20 levels ~15360 states ~45728 transitions
pins2lts-mc-linux64( 7/ 8), 2.398: [Blue] ~20 levels ~30720 states ~83424 transitions
pins2lts-mc-linux64( 7/ 8), 3.831: [Blue] ~20 levels ~61440 states ~179392 transitions
pins2lts-mc-linux64( 7/ 8), 6.641: [Blue] ~20 levels ~122880 states ~361408 transitions
pins2lts-mc-linux64( 7/ 8), 12.136: [Blue] ~20 levels ~245760 states ~756224 transitions
pins2lts-mc-linux64( 7/ 8), 23.548: [Blue] ~20 levels ~491520 states ~1843160 transitions
pins2lts-mc-linux64( 7/ 8), 46.016: [Blue] ~20 levels ~983040 states ~3519984 transitions
pins2lts-mc-linux64( 7/ 8), 91.602: [Blue] ~20 levels ~1966080 states ~7507088 transitions
pins2lts-mc-linux64( 7/ 8), 182.759: [Blue] ~20 levels ~3932160 states ~16082184 transitions
pins2lts-mc-linux64( 7/ 8), 369.935: [Blue] ~20 levels ~7864320 states ~37171672 transitions
pins2lts-mc-linux64( 3/ 8), 742.387: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 742.782:
pins2lts-mc-linux64( 0/ 8), 742.782: Explored 14351642 states 66712236 transitions, fanout: 4.648
pins2lts-mc-linux64( 0/ 8), 742.782: Total exploration time 742.160 sec (741.920 sec minimum, 742.004 sec on average)
pins2lts-mc-linux64( 0/ 8), 742.782: States per second: 19338, Transitions per second: 89889
pins2lts-mc-linux64( 0/ 8), 742.782:
pins2lts-mc-linux64( 0/ 8), 742.782: State space has 14365512 states, 14351488 are accepting
pins2lts-mc-linux64( 0/ 8), 742.782: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 742.782: blue states: 14351642 (99.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 742.782: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 742.782: all-red states: 14351488 (99.90%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 742.782:
pins2lts-mc-linux64( 0/ 8), 742.782: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 742.782:
pins2lts-mc-linux64( 0/ 8), 742.782: Queue width: 8B, total height: 160, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 742.782: Tree memory: 365.6MB, 26.7 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 742.782: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 742.782: Stored 217 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 742.782: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 742.782: Est. total memory use: 365.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15905476048521845574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15905476048521845574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 06:26:29] [INFO ] Applying decomposition
[2024-05-30 06:26:29] [INFO ] Flatten gal took : 14 ms
[2024-05-30 06:26:29] [INFO ] Decomposing Gal with order
[2024-05-30 06:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:26:29] [INFO ] Removed a total of 353 redundant transitions.
[2024-05-30 06:26:29] [INFO ] Flatten gal took : 26 ms
[2024-05-30 06:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 06:26:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality13354943247884455746.gal : 3 ms
[2024-05-30 06:26:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality163364213216660927.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13354943247884455746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality163364213216660927.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((gu3.Board_0_0_0+gu3.Board_0_0_1)+(gu3.Board_0_0_2+gu3.Board_0_0_3))+((gu3.Board_0_0_4+gu3.Board_0_0_5)+(gu19.Board_0_1_...4646
Formula 0 simplified : G!"(((((((((gu3.Board_0_0_0+gu3.Board_0_0_1)+(gu3.Board_0_0_2+gu3.Board_0_0_3))+((gu3.Board_0_0_4+gu3.Board_0_0_5)+(gu19.Board_0_1_0...4642
ITS-tools command line returned an error code 137
[2024-05-30 06:37:22] [INFO ] Flatten gal took : 34 ms
[2024-05-30 06:37:22] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-30 06:37:22] [INFO ] Transformed 324 places.
[2024-05-30 06:37:22] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 06:37:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality18016039467051632745.gal : 1 ms
[2024-05-30 06:37:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality2472741569193851230.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18016039467051632745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2472741569193851230.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
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_1_0+Board_0_1_1)))+(((Board_0_1...3448
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_1_0+Board_0_1_1)))+(((Board_0_1_...3444
ITS-tools command line returned an error code 137
Total runtime 2461584 ms.

BK_STOP 1717051645309

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-AN06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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