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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 12 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M Apr 12 10:22 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 811K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 840K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 12 11:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 12 11:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 211K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 509K 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 1.9M 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-AN15-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717277040344

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-AN15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:24:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:24:01] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-06-01 21:24:01] [INFO ] Transformed 4050 places.
[2024-06-01 21:24:01] [INFO ] Transformed 3375 transitions.
[2024-06-01 21:24:01] [INFO ] Found NUPN structural information;
[2024-06-01 21:24:01] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 151 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 37 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-06-01 21:24:02] [INFO ] Computed 675 invariants in 54 ms
[2024-06-01 21:24:03] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-06-01 21:24:03] [INFO ] Invariant cache hit.
[2024-06-01 21:24:08] [INFO ] Implicit Places using invariants and state equation in 4282 ms returned []
Implicit Place search using SMT with State Equation took 5619 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 5688 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2024-06-01 21:24:08] [INFO ] Flatten gal took : 365 ms
[2024-06-01 21:24:09] [INFO ] Flatten gal took : 211 ms
[2024-06-01 21:24:09] [INFO ] Input system was already deterministic with 3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14304 ms. (2 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 991 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2244 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 769 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1356 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2256 ms. (17 steps per ms) remains 5/5 properties
[2024-06-01 21:24:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 1350 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5022 ms.
Refiners :[Domain max(s): 675/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 1350 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5024 ms.
Refiners :[Domain max(s): 675/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10453ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.14 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 66 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 12458 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 693 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1934 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1294 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2255 ms. (17 steps per ms) remains 5/5 properties
Probabilistic random walk after 110175 steps, saw 110135 distinct states, run finished after 12109 ms. (steps per millisecond=9 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-06-01 21:24:43] [INFO ] Computed 44 invariants in 320 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/675 variables, 44/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 3 solved, 2 unsolved in 11787 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3375/4050 variables, 675/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 3 solved, 2 unsolved in 7960 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 20422ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 23 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-PT-AN15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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' '!(F(G(((p0 U p1) U p2))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 97 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-06-01 21:25:04] [INFO ] Computed 675 invariants in 19 ms
[2024-06-01 21:25:08] [INFO ] Implicit Places using invariants in 4344 ms returned []
[2024-06-01 21:25:08] [INFO ] Invariant cache hit.
[2024-06-01 21:25:15] [INFO ] Implicit Places using invariants and state equation in 7498 ms returned []
Implicit Place search using SMT with State Equation took 11851 ms to find 0 implicit places.
[2024-06-01 21:25:16] [INFO ] Redundant transitions in 183 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 12144 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-00
Product exploration timeout after 39720 steps with 200 reset in 10004 ms.
Product exploration timeout after 39900 steps with 201 reset in 10002 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 541 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (200 resets) in 23493 ms. (1 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 755 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4608 ms. (8 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7504 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8577 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8404 ms. (4 steps per ms) remains 5/5 properties
[2024-06-01 21:25:54] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3406 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3083 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9621ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 48 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 22719 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 861 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8580 ms. (4 steps per ms) remains 2/2 properties
Probabilistic random walk after 222754 steps, saw 222671 distinct states, run finished after 24082 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 21:26:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 225/4050 variables, 225/4500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4050 variables, 225/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4050 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 8775 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45048 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3825 variables, 450/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3825 variables, 0/4275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13864 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 59977ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 67 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 51 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 21:27:36] [INFO ] Invariant cache hit.
[2024-06-01 21:27:40] [INFO ] Implicit Places using invariants in 4263 ms returned []
[2024-06-01 21:27:40] [INFO ] Invariant cache hit.
[2024-06-01 21:27:47] [INFO ] Implicit Places using invariants and state equation in 6886 ms returned []
Implicit Place search using SMT with State Equation took 11152 ms to find 0 implicit places.
[2024-06-01 21:27:47] [INFO ] Redundant transitions in 161 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 11378 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT p0)), (X (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 17 factoid took 634 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Support contains 225 out of 4050 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 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 42 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 21:27:48] [INFO ] Invariant cache hit.
[2024-06-01 21:27:52] [INFO ] Implicit Places using invariants in 4032 ms returned []
[2024-06-01 21:27:52] [INFO ] Invariant cache hit.
[2024-06-01 21:27:59] [INFO ] Implicit Places using invariants and state equation in 6449 ms returned []
Implicit Place search using SMT with State Equation took 10483 ms to find 0 implicit places.
[2024-06-01 21:27:59] [INFO ] Redundant transitions in 109 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 10650 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (200 resets) in 11750 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 811 ms. (49 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 479462 steps, run timeout after 9001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 479462 steps, saw 365455 distinct states, run finished after 9005 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 21:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3375/3600 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/3600 variables, 3375/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3600 variables, 0/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1684 ms.
Refiners :[Domain max(s): 3600/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3375/3600 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3600 variables, 3375/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3600 variables, 0/3825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1691 ms.
Refiners :[Domain max(s): 3600/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3423ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.16 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 137 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 675/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 9065 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 347124 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 347124 steps, saw 345188 distinct states, run finished after 6002 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 3375 rows 675 cols
[2024-06-01 21:28:25] [INFO ] Computed 44 invariants in 133 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3375/4050 variables, 675/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4050 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3873 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 446/671 variables, 40/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 446/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/675 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/4050 variables, and 1394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45023 ms.
Refiners :[Domain max(s): 675/675 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 49078ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 225 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 55 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 675/675 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 49 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 21:29:14] [INFO ] Invariant cache hit.
[2024-06-01 21:29:17] [INFO ] Implicit Places using invariants in 2909 ms returned []
[2024-06-01 21:29:17] [INFO ] Invariant cache hit.
[2024-06-01 21:31:57] [INFO ] Implicit Places using invariants and state equation in 160019 ms returned []
Implicit Place search using SMT with State Equation took 162929 ms to find 0 implicit places.
[2024-06-01 21:31:57] [INFO ] Redundant transitions in 108 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 163096 ms. Remains : 675/675 places, 3375/3375 transitions.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 46650 steps with 235 reset in 10004 ms.
Product exploration timeout after 46130 steps with 232 reset in 10002 ms.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.4 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 62 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 21:32:17] [INFO ] Invariant cache hit.
[2024-06-01 21:32:20] [INFO ] Implicit Places using invariants in 2993 ms returned []
[2024-06-01 21:32:20] [INFO ] Invariant cache hit.
[2024-06-01 21:35:00] [INFO ] Implicit Places using invariants and state equation in 160029 ms returned []
Implicit Place search using SMT with State Equation took 163027 ms to find 0 implicit places.
[2024-06-01 21:35:00] [INFO ] Redundant transitions in 112 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 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163214 ms. Remains : 675/4050 places, 3375/3375 transitions.
Treatment of property Sudoku-PT-AN15-LTLCardinality-00 finished in 597499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U G((p1 U p2)))&&X(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 16 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-06-01 21:35:01] [INFO ] Computed 675 invariants in 14 ms
[2024-06-01 21:35:05] [INFO ] Implicit Places using invariants in 3506 ms returned []
[2024-06-01 21:35:05] [INFO ] Invariant cache hit.
[2024-06-01 21:35:11] [INFO ] Implicit Places using invariants and state equation in 6430 ms returned []
Implicit Place search using SMT with State Equation took 9945 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 9962 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-04
Product exploration timeout after 10530 steps with 2614 reset in 10019 ms.
Product exploration timeout after 10570 steps with 2646 reset in 10004 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 582 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 13 to 8
RANDOM walk for 40000 steps (200 resets) in 56092 ms. (0 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7712 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12195 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16060 ms. (2 steps per ms) remains 5/5 properties
BEST_FIRST walk for 34018 steps (7 resets) in 20816 ms. (1 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 11707 ms. (3 steps per ms) remains 5/5 properties
[2024-06-01 21:36:10] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3825 variables, 3825/3825 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 3825/7425 variables, and 4275 constraints, problems are : Problem set: 5 solved, 0 unsolved in 1236 ms.
Refiners :[Domain max(s): 3825/4050 constraints, Positive P Invariants (semi-flows): 450/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8508ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (AND (OR p0 (NOT p2)) (OR p0 (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p1)))
Knowledge based reduction with 19 factoid took 514 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN15-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-04 finished in 78481 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((p0&&F((G(p2)||p1)))))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 109 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2024-06-01 21:36:20] [INFO ] Computed 44 invariants in 74 ms
[2024-06-01 21:36:24] [INFO ] Implicit Places using invariants in 4340 ms returned []
[2024-06-01 21:36:24] [INFO ] Invariant cache hit.
[2024-06-01 21:39:04] [INFO ] Implicit Places using invariants and state equation in 160032 ms returned []
Implicit Place search using SMT with State Equation took 164376 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 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164487 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 133 steps with 66 reset in 50 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-08 finished in 164691 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' '!((p0 U X((F(p1)||G(!p2)))))'
Support contains 4 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 107 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-06-01 21:39:04] [INFO ] Computed 44 invariants in 121 ms
[2024-06-01 21:39:09] [INFO ] Implicit Places using invariants in 4472 ms returned []
[2024-06-01 21:39:09] [INFO ] Invariant cache hit.
[2024-06-01 21:40:11] [INFO ] Performed 7/676 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-06-01 21:40:43] [INFO ] Performed 9/676 implicitness test of which 0 returned IMPLICIT in 73 seconds.
[2024-06-01 21:41:19] [INFO ] Performed 20/676 implicitness test of which 0 returned IMPLICIT in 110 seconds.
[2024-06-01 21:41:49] [INFO ] Implicit Places using invariants and state equation in 160019 ms returned []
Implicit Place search using SMT with State Equation took 164494 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164606 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-09
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 48 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-09 finished in 164852 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 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 94 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-06-01 21:41:49] [INFO ] Computed 44 invariants in 200 ms
[2024-06-01 21:41:54] [INFO ] Implicit Places using invariants in 4517 ms returned []
[2024-06-01 21:41:54] [INFO ] Invariant cache hit.
[2024-06-01 21:44:34] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160024 ms
Implicit Place search using SMT with State Equation took 164545 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 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164640 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-13
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 42 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-13 finished in 164793 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 2 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 86 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-06-01 21:44:34] [INFO ] Computed 44 invariants in 237 ms
[2024-06-01 21:44:38] [INFO ] Implicit Places using invariants in 4327 ms returned []
[2024-06-01 21:44:38] [INFO ] Invariant cache hit.
[2024-06-01 21:47:18] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 164357 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 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164445 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-14
Stuttering criterion allowed to conclude after 252 steps with 1 reset in 67 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-14 finished in 164618 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 U p1) U p2))))'
[2024-06-01 21:47:19] [INFO ] Flatten gal took : 144 ms
[2024-06-01 21:47:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 21:47:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 17 ms.
Total runtime 1397832 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-AN15"
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-AN15, 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-171690532900683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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