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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 306K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 582K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 361K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 366K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 857K Apr 12 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 499K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717278771289

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:52:52] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-06-01 21:52:52] [INFO ] Transformed 1053 places.
[2024-06-01 21:52:52] [INFO ] Transformed 729 transitions.
[2024-06-01 21:52:52] [INFO ] Found NUPN structural information;
[2024-06-01 21:52:52] [INFO ] Parsed PT model containing 1053 places and 729 transitions and 3645 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-06-01 21:52:52] [INFO ] Computed 324 invariants in 29 ms
[2024-06-01 21:52:53] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 21:52:53] [INFO ] Invariant cache hit.
[2024-06-01 21:52:54] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1177 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 1216 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2024-06-01 21:52:54] [INFO ] Flatten gal took : 120 ms
[2024-06-01 21:52:54] [INFO ] Flatten gal took : 70 ms
[2024-06-01 21:52:54] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (600 resets) in 3968 ms. (10 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
[2024-06-01 21:52:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (OVERLAPS) 729/972 variables, 243/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 729/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/1053 variables, 81/1296 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 81/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3381 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 729/891 variables, 162/324 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 729/1053 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 162/1053 variables, 162/1215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 162/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1782 variables, 1053/2430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2433 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4696 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8307ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 53 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 324/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2748 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 338161 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 338161 steps, saw 82929 distinct states, run finished after 3005 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 729 rows 324 cols
[2024-06-01 21:53:09] [INFO ] Computed 75 invariants in 34 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 160/322 variables, 73/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 160/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 3 unsolved in 503 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 160/322 variables, 73/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 160/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 726 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44417 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 45041ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 324/324 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:53:54] [INFO ] Invariant cache hit.
[2024-06-01 21:53:54] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-06-01 21:53:54] [INFO ] Invariant cache hit.
[2024-06-01 21:53:55] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
[2024-06-01 21:53:55] [INFO ] Redundant transitions in 40 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 1747 ms. Remains : 324/324 places, 729/729 transitions.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 16 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:53:56] [INFO ] Invariant cache hit.
[2024-06-01 21:53:56] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-06-01 21:53:56] [INFO ] Invariant cache hit.
[2024-06-01 21:53:58] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2082 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2099 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-00
Product exploration explored 100000 steps with 1508 reset in 5355 ms.
Product exploration explored 100000 steps with 1507 reset in 5346 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 99 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 35 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (602 resets) in 2259 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485216 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485216 steps, saw 102508 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-06-01 21:54:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1270 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2153 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 473629 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 473629 steps, saw 101411 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2024-06-01 21:54:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 201/282 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 201/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/324 variables, 41/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 42/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10288 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10615ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 20 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 123 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-PT-BN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLCardinality-00 finished in 36671 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(X((F(G(!p0))||G(p1))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-06-01 21:54:32] [INFO ] Computed 324 invariants in 10 ms
[2024-06-01 21:54:33] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-06-01 21:54:33] [INFO ] Invariant cache hit.
[2024-06-01 21:54:35] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 2358 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 2375 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 280 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-01
Product exploration explored 100000 steps with 1509 reset in 8124 ms.
Product exploration explored 100000 steps with 1510 reset in 8284 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 200 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 31 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[false, p0]
Stuttering acceptance computed with spot in 76 ms :[false, p0]
Support contains 810 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 28 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:55:46] [INFO ] Invariant cache hit.
[2024-06-01 21:55:47] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-06-01 21:55:47] [INFO ] Invariant cache hit.
[2024-06-01 21:55:49] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2024-06-01 21:55:49] [INFO ] Redundant transitions in 12 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 2309 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 28 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[false, p0]
Stuttering acceptance computed with spot in 63 ms :[false, p0]
Stuttering acceptance computed with spot in 82 ms :[false, p0]
Product exploration explored 100000 steps with 1507 reset in 7981 ms.
Product exploration explored 100000 steps with 1508 reset in 8051 ms.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 29 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:56:15] [INFO ] Invariant cache hit.
[2024-06-01 21:56:16] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2024-06-01 21:56:16] [INFO ] Invariant cache hit.
[2024-06-01 21:56:17] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2586 ms to find 0 implicit places.
[2024-06-01 21:56:17] [INFO ] Redundant transitions in 5 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 2624 ms. Remains : 1053/1053 places, 729/729 transitions.
Treatment of property Sudoku-PT-BN09-LTLCardinality-01 finished in 105134 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))) U (G(p1) U p2))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:56:17] [INFO ] Invariant cache hit.
[2024-06-01 21:56:18] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2024-06-01 21:56:18] [INFO ] Invariant cache hit.
[2024-06-01 21:56:20] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 2373 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 2386 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-02
Product exploration timeout after 71860 steps with 17965 reset in 10001 ms.
Product exploration timeout after 71420 steps with 17855 reset in 10002 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 939 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (601 resets) in 2461 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 349142 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349142 steps, saw 84296 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 21:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1066 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1696 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 14 factoid took 1088 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:57:40] [INFO ] Invariant cache hit.
[2024-06-01 21:57:41] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2024-06-01 21:57:41] [INFO ] Invariant cache hit.
[2024-06-01 21:57:42] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 2431 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 2441 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (600 resets) in 2373 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337551 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337551 steps, saw 82938 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-06-01 21:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1040 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 729/810 variables, 81/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 729/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/1053 variables, 243/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 243/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 2430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1666 ms.
Refiners :[Domain max(s): 1053/1053 constraints, Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 85530 steps with 21382 reset in 10001 ms.
Product exploration timeout after 83840 steps with 20960 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.7 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:58:10] [INFO ] Redundant transitions in 5 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 324/1053 places, 729/729 transitions.
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 20 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-06-01 21:58:11] [INFO ] Computed 75 invariants in 23 ms
[2024-06-01 21:58:11] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-06-01 21:58:11] [INFO ] Invariant cache hit.
[2024-06-01 21:58:12] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1969 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1992 ms. Remains : 324/1053 places, 729/729 transitions.
Treatment of property Sudoku-PT-BN09-LTLCardinality-02 finished in 115203 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 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-06-01 21:58:13] [INFO ] Computed 324 invariants in 5 ms
[2024-06-01 21:58:13] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-06-01 21:58:13] [INFO ] Invariant cache hit.
[2024-06-01 21:58:15] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 2060 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 2075 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-05
Product exploration timeout after 86740 steps with 28913 reset in 10001 ms.
Product exploration timeout after 85420 steps with 28473 reset in 10001 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 39 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLCardinality-05 finished in 32353 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 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:58:45] [INFO ] Invariant cache hit.
[2024-06-01 21:58:46] [INFO ] Implicit Places using invariants in 1333 ms returned []
[2024-06-01 21:58:46] [INFO ] Invariant cache hit.
[2024-06-01 21:58:48] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2988 ms to find 0 implicit places.
[2024-06-01 21:58:48] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3022 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-06
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 11 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-06 finished in 3087 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(G(p0)) U p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2024-06-01 21:58:48] [INFO ] Computed 75 invariants in 17 ms
[2024-06-01 21:58:49] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-06-01 21:58:49] [INFO ] Invariant cache hit.
[2024-06-01 21:58:50] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-06-01 21:58:50] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1948 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-07
Product exploration explored 100000 steps with 1508 reset in 5272 ms.
Product exploration explored 100000 steps with 1508 reset in 5355 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (603 resets) in 2706 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 418381 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 418381 steps, saw 94416 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 21:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1351 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1696ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 3119 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 421887 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 421887 steps, saw 94872 distinct states, run finished after 3006 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 21:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9517 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9850ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 21:59:24] [INFO ] Invariant cache hit.
[2024-06-01 21:59:25] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 21:59:25] [INFO ] Invariant cache hit.
[2024-06-01 21:59:26] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2024-06-01 21:59:26] [INFO ] Redundant transitions in 6 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 1952 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (600 resets) in 2751 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 417581 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 417581 steps, saw 94295 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 21:59:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1338 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 324/324 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 2541 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 422231 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 422231 steps, saw 94949 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 21:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1053 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 221/302 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 221/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/324 variables, 17/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 22/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/1053 variables, 324/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1053 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9629 ms.
Refiners :[Domain max(s): 324/324 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9952ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 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)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1508 reset in 5222 ms.
Product exploration explored 100000 steps with 1509 reset in 5316 ms.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 22:00:00] [INFO ] Invariant cache hit.
[2024-06-01 22:00:00] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 22:00:00] [INFO ] Invariant cache hit.
[2024-06-01 22:00:01] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2024-06-01 22:00:02] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 324/324 places, 729/729 transitions.
Treatment of property Sudoku-PT-BN09-LTLCardinality-07 finished in 73614 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(F(!p0))||(F(!p0)&&X(!p1)))))'
Support contains 4 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 18 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-06-01 22:00:02] [INFO ] Invariant cache hit.
[2024-06-01 22:00:02] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-06-01 22:00:02] [INFO ] Invariant cache hit.
[2024-06-01 22:00:04] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1990 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 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2010 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-10
Stuttering criterion allowed to conclude after 291 steps with 7 reset in 24 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-10 finished in 2153 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&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 325 are kept as prefixes of interest. Removing 728 places using SCC suffix rule.3 ms
Discarding 728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 325 /1053 variables (removed 728) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 325 cols
[2024-06-01 22:00:04] [INFO ] Computed 75 invariants in 21 ms
[2024-06-01 22:00:05] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-06-01 22:00:05] [INFO ] Invariant cache hit.
[2024-06-01 22:00:06] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
[2024-06-01 22:00:06] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 6ms
Starting structural reductions in SI_LTL mode, iteration 1 : 325/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2447 ms. Remains : 325/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-14
Stuttering criterion allowed to conclude after 886 steps with 22 reset in 65 ms.
FORMULA Sudoku-PT-BN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLCardinality-14 finished in 2651 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(X((F(G(!p0))||G(p1))))))'
Found a Lengthening insensitive property : Sudoku-PT-BN09-LTLCardinality-01
Stuttering acceptance computed with spot in 238 ms :[false, (AND (NOT p1) p0), false, (AND (NOT p1) p0), p0, false, false]
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2024-06-01 22:00:07] [INFO ] Computed 324 invariants in 3 ms
[2024-06-01 22:00:08] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-06-01 22:00:08] [INFO ] Invariant cache hit.
[2024-06-01 22:00:09] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 2183 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 LI_LTL mode , in 1 iterations and 2199 ms. Remains : 1053/1053 places, 729/729 transitions.
Running random walk in product with property : Sudoku-PT-BN09-LTLCardinality-01
Product exploration explored 100000 steps with 1509 reset in 8191 ms.
Product exploration explored 100000 steps with 1510 reset in 8285 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 26 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[false, p0]
Stuttering acceptance computed with spot in 55 ms :[false, p0]
Support contains 810 out of 1053 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 22:01:20] [INFO ] Invariant cache hit.
[2024-06-01 22:01:21] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-06-01 22:01:21] [INFO ] Invariant cache hit.
[2024-06-01 22:01:22] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
[2024-06-01 22:01:22] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2221 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[false, p0]
RANDOM walk for 164 steps (0 resets) in 35 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[false, p0]
Stuttering acceptance computed with spot in 73 ms :[false, p0]
Stuttering acceptance computed with spot in 72 ms :[false, p0]
Product exploration explored 100000 steps with 1508 reset in 8166 ms.
Product exploration explored 100000 steps with 1507 reset in 8291 ms.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 22:01:48] [INFO ] Invariant cache hit.
[2024-06-01 22:01:50] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2024-06-01 22:01:50] [INFO ] Invariant cache hit.
[2024-06-01 22:01:51] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
[2024-06-01 22:01:51] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2624 ms. Remains : 1053/1053 places, 729/729 transitions.
Treatment of property Sudoku-PT-BN09-LTLCardinality-01 finished in 104748 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))) U (G(p1) U 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' '!(G((F(G(p0)) U p0)))'
[2024-06-01 22:01:51] [INFO ] Flatten gal took : 69 ms
[2024-06-01 22:01:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 22:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 6 ms.
Total runtime 539530 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-PT-BN09"
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-PT-BN09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533000715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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