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.r536-tall-171690532500507.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 ltsminxred
Input is Sudoku-COL-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717262502124

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:21:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:21:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:21:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:21:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:21:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 475 ms
[2024-06-01 17:21:43] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:21:44] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 17:21:44] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40352 steps (232 resets) in 173 ms. (231 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40352 steps (232 resets) in 53 ms. (747 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 49 ms. (807 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 53 ms. (747 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 66 ms. (602 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 65 ms. (611 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 67 ms. (593 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40352 steps (232 resets) in 74 ms. (538 steps per ms) remains 7/7 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:21:44] [INFO ] Computed 3 invariants in 5 ms
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 7 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:21:44] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 17:21:44] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN13-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:21:44] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-06-01 17:21:44] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 43 ms.
[2024-06-01 17:21:44] [INFO ] Unfolded 9 HLPN properties in 3 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 17:21:44] [INFO ] Computed 507 invariants in 35 ms
[2024-06-01 17:21:45] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-06-01 17:21:45] [INFO ] Invariant cache hit.
[2024-06-01 17:21:46] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2127 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 2170 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-06-01 17:21:47] [INFO ] Flatten gal took : 236 ms
[2024-06-01 17:21:47] [INFO ] Flatten gal took : 178 ms
[2024-06-01 17:21:48] [INFO ] Input system was already deterministic with 2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 13964 ms. (2 steps per ms) remains 13/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3487 ms. (11 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1049 ms. (38 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 719 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1146 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2276 ms. (17 steps per ms) remains 13/13 properties
[2024-06-01 17:21:55] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 507/507 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 5 solved, 8 unsolved
SMT process timed out in 11026ms, After SMT, problems are : Problem set: 5 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 9568 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2844 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1280 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1299 ms. (30 steps per ms) remains 8/8 properties
Probabilistic random walk after 149009 steps, saw 148902 distinct states, run finished after 12038 ms. (steps per millisecond=12 ) properties seen :0
[2024-06-01 17:22:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 8 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45046 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 65699ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 26 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:23:28] [INFO ] Invariant cache hit.
[2024-06-01 17:23:29] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-01 17:23:29] [INFO ] Invariant cache hit.
[2024-06-01 17:23:30] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2024-06-01 17:23:31] [INFO ] Redundant transitions in 90 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2222 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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' '!(X((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 40 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:23:31] [INFO ] Invariant cache hit.
[2024-06-01 17:23:32] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-06-01 17:23:32] [INFO ] Invariant cache hit.
[2024-06-01 17:23:34] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 2848 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 2891 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-01
Product exploration timeout after 37930 steps with 18965 reset in 10002 ms.
Product exploration timeout after 38210 steps with 19105 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p3 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 30 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-01 finished in 24527 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 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 161 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 17:23:56] [INFO ] Computed 38 invariants in 110 ms
[2024-06-01 17:23:56] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 17:23:56] [INFO ] Invariant cache hit.
[2024-06-01 17:24:01] [INFO ] Implicit Places using invariants and state equation in 4909 ms returned []
Implicit Place search using SMT with State Equation took 5390 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5553 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-02
Product exploration timeout after 50890 steps with 25445 reset in 10001 ms.
Product exploration timeout after 50350 steps with 25175 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-02 finished in 26038 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(X(X(F(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 17:24:21] [INFO ] Computed 507 invariants in 20 ms
[2024-06-01 17:24:23] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2024-06-01 17:24:23] [INFO ] Invariant cache hit.
[2024-06-01 17:24:26] [INFO ] Implicit Places using invariants and state equation in 3041 ms returned []
Implicit Place search using SMT with State Equation took 4451 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 4494 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-03
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 31 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-03 finished in 4707 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' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:24:26] [INFO ] Invariant cache hit.
[2024-06-01 17:24:27] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2024-06-01 17:24:27] [INFO ] Invariant cache hit.
[2024-06-01 17:24:30] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3631 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 3658 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-05
Product exploration timeout after 38420 steps with 259 reset in 10002 ms.
Product exploration timeout after 38580 steps with 260 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 7268 ms. (5 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2136 ms. (18 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2103 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 3/3 properties
[2024-06-01 17:24:55] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4560ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 45 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7215 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2097 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 262514 steps, run timeout after 6001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 262514 steps, saw 223407 distinct states, run finished after 6009 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 17:25:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 338/2704 variables, 338/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31210 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10211 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 41719ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:25:50] [INFO ] Invariant cache hit.
[2024-06-01 17:25:51] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2024-06-01 17:25:51] [INFO ] Invariant cache hit.
[2024-06-01 17:25:54] [INFO ] Implicit Places using invariants and state equation in 2886 ms returned []
Implicit Place search using SMT with State Equation took 3991 ms to find 0 implicit places.
[2024-06-01 17:25:54] [INFO ] Redundant transitions in 121 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4159 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 10 factoid took 336 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:25:55] [INFO ] Invariant cache hit.
[2024-06-01 17:25:56] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-06-01 17:25:56] [INFO ] Invariant cache hit.
[2024-06-01 17:25:59] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 3823 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 3852 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6051 ms. (6 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
[2024-06-01 17:26:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2197/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2197/2366 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2824ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 507/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 5764 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225813 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225813 steps, saw 216841 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 17:26:09] [INFO ] Computed 38 invariants in 70 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1145 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2012ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 38990 steps with 262 reset in 10002 ms.
Product exploration timeout after 38790 steps with 261 reset in 10002 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 99 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:26:32] [INFO ] Redundant transitions in 46 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 155 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 17:26:33] [INFO ] Computed 507 invariants in 15 ms
[2024-06-01 17:26:34] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-06-01 17:26:34] [INFO ] Invariant cache hit.
[2024-06-01 17:26:37] [INFO ] Implicit Places using invariants and state equation in 2944 ms returned []
Implicit Place search using SMT with State Equation took 4048 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 4072 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-05 finished in 130986 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 U p1)&&G(F(p2)))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.8 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 17:26:37] [INFO ] Computed 38 invariants in 48 ms
[2024-06-01 17:26:37] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 17:26:37] [INFO ] Invariant cache hit.
[2024-06-01 17:26:43] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 5882 ms to find 0 implicit places.
[2024-06-01 17:26:43] [INFO ] Redundant transitions in 48 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5975 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-07
Product exploration timeout after 71970 steps with 486 reset in 10001 ms.
Product exploration timeout after 72510 steps with 489 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 8238 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 568 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435576 steps, run timeout after 6001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 435576 steps, saw 249863 distinct states, run finished after 6001 ms. (steps per millisecond=72 ) properties seen :0
[2024-06-01 17:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 736 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1176 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1952ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Support contains 169 out of 507 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 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:27:15] [INFO ] Invariant cache hit.
[2024-06-01 17:27:15] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 17:27:15] [INFO ] Invariant cache hit.
[2024-06-01 17:27:20] [INFO ] Implicit Places using invariants and state equation in 4864 ms returned []
Implicit Place search using SMT with State Equation took 5138 ms to find 0 implicit places.
[2024-06-01 17:27:20] [INFO ] Redundant transitions in 44 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 5220 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 8339 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 455092 steps, run timeout after 6001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 455092 steps, saw 253838 distinct states, run finished after 6001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 17:27:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/495 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/507 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1151 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 70220 steps with 473 reset in 10001 ms.
Product exploration timeout after 69880 steps with 471 reset in 10001 ms.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:27:51] [INFO ] Invariant cache hit.
[2024-06-01 17:27:52] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 17:27:52] [INFO ] Invariant cache hit.
[2024-06-01 17:27:57] [INFO ] Implicit Places using invariants and state equation in 5541 ms returned []
Implicit Place search using SMT with State Equation took 5980 ms to find 0 implicit places.
[2024-06-01 17:27:57] [INFO ] Redundant transitions in 44 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 6054 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-07 finished in 80406 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(G(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 34 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:27:57] [INFO ] Invariant cache hit.
[2024-06-01 17:27:58] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 17:27:58] [INFO ] Invariant cache hit.
[2024-06-01 17:28:03] [INFO ] Implicit Places using invariants and state equation in 5128 ms returned []
Implicit Place search using SMT with State Equation took 5526 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09
Product exploration timeout after 68060 steps with 459 reset in 10004 ms.
Product exploration timeout after 67360 steps with 454 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 11427 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 685 ms. (58 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 631008 steps, run timeout after 9001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 631008 steps, saw 282817 distinct states, run finished after 9001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 17:28:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1110 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/507 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1372 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2560ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 41153 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' '!(G(F(p0)))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 17:28:39] [INFO ] Computed 507 invariants in 7 ms
[2024-06-01 17:28:39] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-06-01 17:28:39] [INFO ] Invariant cache hit.
[2024-06-01 17:28:42] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
[2024-06-01 17:28:42] [INFO ] Redundant transitions in 47 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 3131 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-10
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 31 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-10 finished in 3268 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 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.7 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 17:28:42] [INFO ] Computed 38 invariants in 46 ms
[2024-06-01 17:28:42] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 17:28:42] [INFO ] Invariant cache hit.
[2024-06-01 17:28:44] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-06-01 17:28:44] [INFO ] Redundant transitions in 45 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1993 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12
Product exploration timeout after 53480 steps with 360 reset in 10002 ms.
Product exploration timeout after 53280 steps with 359 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 13040 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2488 ms. (16 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 350207 steps, run timeout after 9001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 350207 steps, saw 238808 distinct states, run finished after 9001 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 17:29:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1465 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1334 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2887ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 10169 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1258 ms. (31 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 378632 steps, run timeout after 9001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 378632 steps, saw 243147 distinct states, run finished after 9001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 17:29:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1455 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1884 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3392ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 9 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:29:36] [INFO ] Invariant cache hit.
[2024-06-01 17:29:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 17:29:36] [INFO ] Invariant cache hit.
[2024-06-01 17:29:38] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2024-06-01 17:29:38] [INFO ] Redundant transitions in 47 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 1925 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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)]
RANDOM walk for 40000 steps (268 resets) in 8809 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1608 ms. (24 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348290 steps, run timeout after 9001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 348290 steps, saw 238577 distinct states, run finished after 9001 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 17:29:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1237 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2682ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 8 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 6827 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1261 ms. (31 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189557 steps, run timeout after 6017 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 189557 steps, saw 189413 distinct states, run finished after 6017 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 17:30:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1449 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2704 variables, 507/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/2704 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1687 ms.
Refiners :[Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3200ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 53690 steps with 362 reset in 10002 ms.
Product exploration timeout after 53210 steps with 358 reset in 10001 ms.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:30:25] [INFO ] Invariant cache hit.
[2024-06-01 17:30:25] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 17:30:25] [INFO ] Invariant cache hit.
[2024-06-01 17:30:27] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-06-01 17:30:27] [INFO ] Redundant transitions in 46 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 2031 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 105430 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 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 30 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-06-01 17:30:27] [INFO ] Computed 507 invariants in 10 ms
[2024-06-01 17:30:28] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2024-06-01 17:30:28] [INFO ] Invariant cache hit.
[2024-06-01 17:30:31] [INFO ] Implicit Places using invariants and state equation in 2882 ms returned []
Implicit Place search using SMT with State Equation took 3974 ms to find 0 implicit places.
[2024-06-01 17:30:31] [INFO ] Redundant transitions in 49 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 4060 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-15
Product exploration timeout after 36440 steps with 423 reset in 10001 ms.
Product exploration timeout after 36300 steps with 422 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 36 ms :[(NOT p0)]
RANDOM walk for 340 steps (0 resets) in 184 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 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)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 17:30:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:31:09] [INFO ] Invariant cache hit.
[2024-06-01 17:31:10] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2024-06-01 17:31:10] [INFO ] Invariant cache hit.
[2024-06-01 17:31:13] [INFO ] Implicit Places using invariants and state equation in 2596 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2024-06-01 17:31:13] [INFO ] Redundant transitions in 44 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 3743 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 31 ms :[(NOT p0)]
RANDOM walk for 340 steps (0 resets) in 205 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 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 188 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-06-01 17:31:15] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Product exploration timeout after 37680 steps with 438 reset in 10001 ms.
Product exploration timeout after 37190 steps with 432 reset in 10002 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 17:31:51] [INFO ] Invariant cache hit.
[2024-06-01 17:31:52] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-06-01 17:31:52] [INFO ] Invariant cache hit.
[2024-06-01 17:31:54] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
[2024-06-01 17:31:54] [INFO ] Redundant transitions in 44 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 3817 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-15 finished in 87265 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' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
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 U p1)&&G(F(p2)))))'
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)))'
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-06-01 17:31:55] [INFO ] Flatten gal took : 200 ms
[2024-06-01 17:31:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 22 ms.
[2024-06-01 17:31:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 12 ms.
Total runtime 612421 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN13, 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 r536-tall-171690532500507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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