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-171690532400467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-COL-AN08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532400467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K Apr 12 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 11:42 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 4.3K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717258614182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:16:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:16:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:16:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:16:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:16:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 510 ms
[2024-06-01 16:16:56] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:16:56] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 16:16:56] [INFO ] Skeletonized 16 HLPN properties in 6 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40124 steps (604 resets) in 261 ms. (153 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40124 steps (604 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 186 ms. (214 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 120 ms. (331 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 73 ms. (542 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 95 ms. (417 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 72 ms. (549 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 49 ms. (802 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 46 ms. (853 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 44 ms. (891 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 29 ms. (1337 steps per ms) remains 10/10 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 16:16:56] [INFO ] Computed 3 invariants in 7 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 10 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 16:16:56] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-AN08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:16:56] [INFO ] Flatten gal took : 1 ms
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2024-06-01 16:16:56] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 24 ms.
[2024-06-01 16:16:56] [INFO ] Unfolded 8 HLPN properties in 2 ms.
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-06-01 16:16:57] [INFO ] Computed 192 invariants in 24 ms
[2024-06-01 16:16:57] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 16:16:57] [INFO ] Invariant cache hit.
[2024-06-01 16:16:57] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 650 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 675 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-06-01 16:16:57] [INFO ] Flatten gal took : 68 ms
[2024-06-01 16:16:57] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:16:58] [INFO ] Input system was already deterministic with 512 transitions.
RANDOM walk for 40000 steps (718 resets) in 3523 ms. (11 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1130 ms. (35 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
[2024-06-01 16:16:59] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 192/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 512/704 variables, 192/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 901 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6599ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (717 resets) in 2235 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 110904 steps, run visited all 5 properties in 1075 ms. (steps per millisecond=103 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 1079 ms. (steps per millisecond=102 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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(X((F(p0) U X(p0))))&&!(p0 U p1)))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:17:08] [INFO ] Invariant cache hit.
[2024-06-01 16:17:09] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 16:17:09] [INFO ] Invariant cache hit.
[2024-06-01 16:17:09] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 686 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 699 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 12 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-00 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 33 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:17:09] [INFO ] Invariant cache hit.
[2024-06-01 16:17:10] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 16:17:10] [INFO ] Invariant cache hit.
[2024-06-01 16:17:10] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-06-01 16:17:10] [INFO ] Redundant transitions in 30 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 855 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-01
Product exploration explored 100000 steps with 3030 reset in 5530 ms.
Product exploration explored 100000 steps with 3030 reset in 5608 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 17 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 16:17:25] [INFO ] Invariant cache hit.
[2024-06-01 16:17:27] [INFO ] [Real]Absence check using 192 positive place invariants in 76 ms returned sat
[2024-06-01 16:17:27] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-06-01 16:17:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:17:29] [INFO ] [Nat]Absence check using 192 positive place invariants in 708 ms returned sat
[2024-06-01 16:17:30] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2024-06-01 16:17:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 16:17:30] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 23 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:17:30] [INFO ] Invariant cache hit.
[2024-06-01 16:17:31] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 16:17:31] [INFO ] Invariant cache hit.
[2024-06-01 16:17:31] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-06-01 16:17:31] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 835 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 19 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 16:17:35] [INFO ] Invariant cache hit.
[2024-06-01 16:17:37] [INFO ] [Real]Absence check using 192 positive place invariants in 60 ms returned sat
[2024-06-01 16:17:37] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-06-01 16:17:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:17:39] [INFO ] [Nat]Absence check using 192 positive place invariants in 705 ms returned sat
[2024-06-01 16:17:40] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2024-06-01 16:17:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 16:17:40] [INFO ] Added : 0 causal constraints over 0 iterations in 89 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5444 ms.
Product exploration explored 100000 steps with 3030 reset in 5503 ms.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:17:51] [INFO ] Invariant cache hit.
[2024-06-01 16:17:51] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 16:17:51] [INFO ] Invariant cache hit.
[2024-06-01 16:17:52] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-06-01 16:17:52] [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 759 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-01 finished in 42669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:17:52] [INFO ] Invariant cache hit.
[2024-06-01 16:17:52] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 16:17:52] [INFO ] Invariant cache hit.
[2024-06-01 16:17:53] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 734 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 738 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1798 reset in 3022 ms.
Product exploration explored 100000 steps with 1797 reset in 3057 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1135 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 470 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (716 resets) in 3389 ms. (11 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 992 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 595 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
[2024-06-01 16:18:14] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 5 solved, 2 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 512/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 898 constraints, problems are : Problem set: 5 solved, 2 unsolved in 2468 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3856ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.3 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 1355 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 110904 steps, run visited all 2 properties in 651 ms. (steps per millisecond=170 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 652 ms. (steps per millisecond=170 ) properties seen :2
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p1 p2 p0 p3)), (G (OR p1 p2)), (G (AND (OR (NOT p1) p0 p3) (OR (NOT p2) p0 p3))), (G (OR (NOT p1) p2 p0 p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0 (NOT p3))))]
Knowledge based reduction with 25 factoid took 2692 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:18:22] [INFO ] Invariant cache hit.
[2024-06-01 16:18:22] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 16:18:22] [INFO ] Invariant cache hit.
[2024-06-01 16:18:23] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-06-01 16:18:23] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 115 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (719 resets) in 1638 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 513 ms. (steps per millisecond=216 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 513 ms. (steps per millisecond=216 ) properties seen :1
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 125 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 3038 ms.
Product exploration explored 100000 steps with 1797 reset in 3070 ms.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-06-01 16:18:32] [INFO ] Computed 23 invariants in 25 ms
[2024-06-01 16:18:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-01 16:18:32] [INFO ] Invariant cache hit.
[2024-06-01 16:18:32] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-01 16:18:32] [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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-02 finished in 40027 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||X(F((p0&&F(p1))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-06-01 16:18:32] [INFO ] Computed 192 invariants in 8 ms
[2024-06-01 16:18:32] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 16:18:32] [INFO ] Invariant cache hit.
[2024-06-01 16:18:33] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2024-06-01 16:18:33] [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 837 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04
Product exploration explored 100000 steps with 3030 reset in 6533 ms.
Product exploration explored 100000 steps with 3030 reset in 6556 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (717 resets) in 2080 ms. (19 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 876 ms. (45 steps per ms) remains 1/1 properties
[2024-06-01 16:18:55] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 64/192 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 367 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-06-01 16:18:56] [INFO ] Invariant cache hit.
[2024-06-01 16:18:57] [INFO ] [Real]Absence check using 192 positive place invariants in 63 ms returned sat
[2024-06-01 16:18:58] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2024-06-01 16:18:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:19:00] [INFO ] [Nat]Absence check using 192 positive place invariants in 664 ms returned sat
[2024-06-01 16:19:01] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2024-06-01 16:19:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 16:19:01] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:19:01] [INFO ] Invariant cache hit.
[2024-06-01 16:19:01] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 16:19:01] [INFO ] Invariant cache hit.
[2024-06-01 16:19:02] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-06-01 16:19:02] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 813 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 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 p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 19 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 131 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-06-01 16:19:06] [INFO ] Invariant cache hit.
[2024-06-01 16:19:08] [INFO ] [Real]Absence check using 192 positive place invariants in 63 ms returned sat
[2024-06-01 16:19:08] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-06-01 16:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:19:10] [INFO ] [Nat]Absence check using 192 positive place invariants in 672 ms returned sat
[2024-06-01 16:19:11] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2024-06-01 16:19:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 16:19:11] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5732 ms.
Product exploration explored 100000 steps with 3030 reset in 5759 ms.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:19:23] [INFO ] Invariant cache hit.
[2024-06-01 16:19:23] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 16:19:23] [INFO ] Invariant cache hit.
[2024-06-01 16:19:24] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-06-01 16:19:24] [INFO ] Redundant transitions in 8 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 786 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 51601 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||X(G(p0)))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 12 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-06-01 16:19:24] [INFO ] Computed 23 invariants in 13 ms
[2024-06-01 16:19:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 16:19:24] [INFO ] Invariant cache hit.
[2024-06-01 16:19:24] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 475 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-06 finished in 642 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 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 6 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:19:24] [INFO ] Invariant cache hit.
[2024-06-01 16:19:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 16:19:24] [INFO ] Invariant cache hit.
[2024-06-01 16:19:25] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 437 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 4375 ms.
Product exploration explored 100000 steps with 50000 reset in 4389 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-07 finished in 10332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((!p0&&G(F(!p1)))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-06-01 16:19:35] [INFO ] Computed 192 invariants in 7 ms
[2024-06-01 16:19:35] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 16:19:35] [INFO ] Invariant cache hit.
[2024-06-01 16:19:35] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-06-01 16:19:35] [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 652 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (OR p0 p1), true, p1, p1]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-09
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-09 finished in 870 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&&X(G(p1))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:19:36] [INFO ] Invariant cache hit.
[2024-06-01 16:19:36] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-01 16:19:36] [INFO ] Invariant cache hit.
[2024-06-01 16:19:36] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 821 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 827 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10
Product exploration explored 100000 steps with 1796 reset in 6840 ms.
Product exploration explored 100000 steps with 1796 reset in 7011 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X 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 8 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (716 resets) in 1884 ms. (21 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 868 ms. (46 steps per ms) remains 1/1 properties
[2024-06-01 16:20:04] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 64/192 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 458 ms. Reduced automaton from 7 states, 20 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
[2024-06-01 16:20:05] [INFO ] Invariant cache hit.
[2024-06-01 16:20:06] [INFO ] [Real]Absence check using 192 positive place invariants in 59 ms returned sat
[2024-06-01 16:20:07] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-06-01 16:20:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 16:20:07] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:20:07] [INFO ] Invariant cache hit.
[2024-06-01 16:20:07] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 16:20:07] [INFO ] Invariant cache hit.
[2024-06-01 16:20:08] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2024-06-01 16:20:08] [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 800 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2024-06-01 16:20:11] [INFO ] Invariant cache hit.
[2024-06-01 16:20:13] [INFO ] [Real]Absence check using 192 positive place invariants in 51 ms returned sat
[2024-06-01 16:20:13] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-06-01 16:20:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 16:20:13] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1796 reset in 4717 ms.
Product exploration explored 100000 steps with 1799 reset in 4688 ms.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 17 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:20:22] [INFO ] Invariant cache hit.
[2024-06-01 16:20:23] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-06-01 16:20:23] [INFO ] Invariant cache hit.
[2024-06-01 16:20:23] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2024-06-01 16:20:23] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 925 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 47888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Found a Lengthening insensitive property : Sudoku-COL-AN08-LTLCardinality-02
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:20:24] [INFO ] Invariant cache hit.
[2024-06-01 16:20:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 16:20:24] [INFO ] Invariant cache hit.
[2024-06-01 16:20:25] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 619 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 628 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1799 reset in 3003 ms.
Product exploration explored 100000 steps with 1798 reset in 3066 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1127 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 468 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (717 resets) in 3545 ms. (11 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 689 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 795 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
[2024-06-01 16:20:46] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 900 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 6712ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (718 resets) in 1869 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 673 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 973 ms. (steps per millisecond=113 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 973 ms. (steps per millisecond=113 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p1 p2 p0 p3)), (G (OR p1 p2)), (G (AND (OR (NOT p1) p0 p3) (OR (NOT p2) p0 p3))), (G (OR (NOT p1) p2 p0 p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0 (NOT p3))))]
Knowledge based reduction with 25 factoid took 2865 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 16:20:58] [INFO ] Invariant cache hit.
[2024-06-01 16:20:58] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-06-01 16:20:58] [INFO ] Redundant transitions in 3 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 658 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 103 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (716 resets) in 1333 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 477 ms. (steps per millisecond=232 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 477 ms. (steps per millisecond=232 ) properties seen :1
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 141 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1796 reset in 3095 ms.
Product exploration explored 100000 steps with 1799 reset in 3176 ms.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.4 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-06-01 16:21:07] [INFO ] Computed 23 invariants in 15 ms
[2024-06-01 16:21:07] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 16:21:07] [INFO ] Invariant cache hit.
[2024-06-01 16:21:08] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-06-01 16:21:08] [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
Starting structural reductions in SI_LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 568 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-02 finished in 44200 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||X(F((p0&&F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : Sudoku-COL-AN08-LTLCardinality-10
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-06-01 16:21:08] [INFO ] Computed 192 invariants in 4 ms
[2024-06-01 16:21:09] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 16:21:09] [INFO ] Invariant cache hit.
[2024-06-01 16:21:09] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 824 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 835 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10
Product exploration explored 100000 steps with 1796 reset in 6857 ms.
Product exploration explored 100000 steps with 1797 reset in 6915 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X 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 8 factoid took 175 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (715 resets) in 2278 ms. (17 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 873 ms. (45 steps per ms) remains 1/1 properties
[2024-06-01 16:21:36] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 64/192 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 492 ms. Reduced automaton from 7 states, 20 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
[2024-06-01 16:21:37] [INFO ] Invariant cache hit.
[2024-06-01 16:21:39] [INFO ] [Real]Absence check using 192 positive place invariants in 51 ms returned sat
[2024-06-01 16:21:39] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-06-01 16:21:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 16:21:39] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:21:39] [INFO ] Invariant cache hit.
[2024-06-01 16:21:39] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 16:21:39] [INFO ] Invariant cache hit.
[2024-06-01 16:21:40] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-06-01 16:21:40] [INFO ] Redundant transitions in 8 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 820 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 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 34 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 123 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 p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
[2024-06-01 16:21:43] [INFO ] Invariant cache hit.
[2024-06-01 16:21:45] [INFO ] [Real]Absence check using 192 positive place invariants in 49 ms returned sat
[2024-06-01 16:21:45] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-01 16:21:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 16:21:45] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1795 reset in 4624 ms.
Product exploration explored 100000 steps with 1798 reset in 4690 ms.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 16:21:55] [INFO ] Invariant cache hit.
[2024-06-01 16:21:55] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 16:21:55] [INFO ] Invariant cache hit.
[2024-06-01 16:21:56] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2024-06-01 16:21:56] [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 1001 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 47713 ms.
[2024-06-01 16:21:56] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:21:56] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 16:21:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 512 transitions and 2048 arcs took 4 ms.
Total runtime 300868 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-COL-AN08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN08, 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-171690532400467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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