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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 134K Apr 12 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 674K Apr 12 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 12 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Apr 12 11:31 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 83K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 300K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 636K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 524K Apr 12 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 412K Apr 12 11:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 204K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717269284189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:14:45] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 19:14:45] [INFO ] Transformed 490 places.
[2024-06-01 19:14:45] [INFO ] Transformed 343 transitions.
[2024-06-01 19:14:45] [INFO ] Found NUPN structural information;
[2024-06-01 19:14:45] [INFO ] Parsed PT model containing 490 places and 343 transitions and 1372 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-06-01 19:14:45] [INFO ] Computed 147 invariants in 25 ms
[2024-06-01 19:14:46] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 19:14:46] [INFO ] Invariant cache hit.
[2024-06-01 19:14:46] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2024-06-01 19:14:46] [INFO ] Flatten gal took : 68 ms
[2024-06-01 19:14:46] [INFO ] Flatten gal took : 32 ms
[2024-06-01 19:14:46] [INFO ] Input system was already deterministic with 343 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (938 resets) in 2628 ms. (15 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
[2024-06-01 19:14:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (OVERLAPS) 343/490 variables, 147/294 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 343/637 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/637 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 343/833 variables, 490/1127 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/1127 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/833 variables, 0/1127 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 1127 constraints, problems are : Problem set: 3 solved, 1 unsolved in 442 ms.
Refiners :[Domain max(s): 490/490 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 343/392 variables, 49/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 343/441 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/441 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/490 variables, 98/539 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 98/637 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/637 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 343/833 variables, 490/1127 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 1/1128 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/833 variables, 0/1128 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/833 variables, 0/1128 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 1128 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1398 ms.
Refiners :[Domain max(s): 490/490 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1999ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-PT-AN07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:14:50] [INFO ] Invariant cache hit.
[2024-06-01 19:14:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 19:14:50] [INFO ] Invariant cache hit.
[2024-06-01 19:14:50] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 422 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 433 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-00 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 44 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:14:51] [INFO ] Invariant cache hit.
[2024-06-01 19:14:51] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 19:14:51] [INFO ] Invariant cache hit.
[2024-06-01 19:14:52] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-06-01 19:14:52] [INFO ] Redundant transitions in 23 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 937 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-03
Product exploration explored 100000 steps with 2349 reset in 3813 ms.
Product exploration explored 100000 steps with 2350 reset in 3718 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 95 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 38 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 13 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 101 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-06-01 19:15:01] [INFO ] Invariant cache hit.
[2024-06-01 19:15:02] [INFO ] [Real]Absence check using 147 positive place invariants in 130 ms returned sat
[2024-06-01 19:15:03] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-06-01 19:15:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:15:05] [INFO ] [Nat]Absence check using 147 positive place invariants in 33 ms returned sat
[2024-06-01 19:15:05] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-01 19:15:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:15:05] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 33 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:15:05] [INFO ] Invariant cache hit.
[2024-06-01 19:15:05] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 19:15:05] [INFO ] Invariant cache hit.
[2024-06-01 19:15:06] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2024-06-01 19:15:06] [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 984 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 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 p0)]
RANDOM walk for 100 steps (0 resets) in 15 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 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 p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 19:15:08] [INFO ] Invariant cache hit.
[2024-06-01 19:15:09] [INFO ] [Real]Absence check using 147 positive place invariants in 134 ms returned sat
[2024-06-01 19:15:09] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-06-01 19:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:15:11] [INFO ] [Nat]Absence check using 147 positive place invariants in 34 ms returned sat
[2024-06-01 19:15:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 19:15:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:15:12] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2349 reset in 3694 ms.
Product exploration explored 100000 steps with 2348 reset in 3726 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:15:19] [INFO ] Invariant cache hit.
[2024-06-01 19:15:20] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-06-01 19:15:20] [INFO ] Invariant cache hit.
[2024-06-01 19:15:20] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2024-06-01 19:15:20] [INFO ] Redundant transitions in 7 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 878 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-PT-AN07-LTLCardinality-03 finished in 29458 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:15:20] [INFO ] Invariant cache hit.
[2024-06-01 19:15:21] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 19:15:21] [INFO ] Invariant cache hit.
[2024-06-01 19:15:21] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2024-06-01 19:15:21] [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 964 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-04
Product exploration explored 100000 steps with 3846 reset in 4037 ms.
Product exploration explored 100000 steps with 3846 reset in 4058 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 15 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 116 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-06-01 19:15:31] [INFO ] Invariant cache hit.
[2024-06-01 19:15:32] [INFO ] [Real]Absence check using 147 positive place invariants in 138 ms returned sat
[2024-06-01 19:15:33] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2024-06-01 19:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:15:35] [INFO ] [Nat]Absence check using 147 positive place invariants in 1158 ms returned sat
[2024-06-01 19:15:41] [INFO ] [Nat]Absence check using state equation in 5536 ms returned sat
[2024-06-01 19:15:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:15:41] [INFO ] Added : 0 causal constraints over 0 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:15:41] [INFO ] Invariant cache hit.
[2024-06-01 19:15:41] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 19:15:41] [INFO ] Invariant cache hit.
[2024-06-01 19:15:42] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-06-01 19:15:42] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 929 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 10 ms. (9 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 96 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 19:15:44] [INFO ] Invariant cache hit.
[2024-06-01 19:15:45] [INFO ] [Real]Absence check using 147 positive place invariants in 140 ms returned sat
[2024-06-01 19:15:46] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2024-06-01 19:15:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:15:48] [INFO ] [Nat]Absence check using 147 positive place invariants in 1088 ms returned sat
[2024-06-01 19:15:53] [INFO ] [Nat]Absence check using state equation in 5437 ms returned sat
[2024-06-01 19:15:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:15:54] [INFO ] Added : 0 causal constraints over 0 iterations in 102 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 4163 ms.
Product exploration explored 100000 steps with 3846 reset in 4208 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:16:02] [INFO ] Invariant cache hit.
[2024-06-01 19:16:02] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 19:16:02] [INFO ] Invariant cache hit.
[2024-06-01 19:16:03] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-06-01 19:16:03] [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 817 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-PT-AN07-LTLCardinality-04 finished in 42707 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)||(p1&&X(p2)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:16:03] [INFO ] Invariant cache hit.
[2024-06-01 19:16:03] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 19:16:03] [INFO ] Invariant cache hit.
[2024-06-01 19:16:03] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 563 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 568 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 9182 ms.
Product exploration explored 100000 steps with 3846 reset in 9224 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 614 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (938 resets) in 4511 ms. (8 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1873 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1253 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1747 ms. (22 steps per ms) remains 3/3 properties
[2024-06-01 19:16:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 539 constraints, problems are : Problem set: 3 solved, 0 unsolved in 332 ms.
Refiners :[Domain max(s): 441/490 constraints, Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 785ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1747 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 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 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:16:43] [INFO ] Invariant cache hit.
[2024-06-01 19:16:43] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 19:16:43] [INFO ] Invariant cache hit.
[2024-06-01 19:16:43] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-06-01 19:16:43] [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 681 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 297 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (933 resets) in 1531 ms. (26 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 1/1 properties
[2024-06-01 19:16:51] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Domain max(s): 0/490 constraints, Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms 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 p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 16 factoid took 464 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 5382 ms.
Product exploration explored 100000 steps with 3846 reset in 5398 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:17:02] [INFO ] Invariant cache hit.
[2024-06-01 19:17:03] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 19:17:03] [INFO ] Invariant cache hit.
[2024-06-01 19:17:03] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2024-06-01 19:17:03] [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 911 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-PT-AN07-LTLCardinality-06 finished in 60502 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(((X(p0) U (X(p2)||p1)) U p2)))'
Support contains 4 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 148 transition count 343
Applied a total of 342 rules in 31 ms. Remains 148 /490 variables (removed 342) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 148 cols
[2024-06-01 19:17:03] [INFO ] Computed 20 invariants in 12 ms
[2024-06-01 19:17:04] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 19:17:04] [INFO ] Invariant cache hit.
[2024-06-01 19:17:04] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 610 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 : 148/490 places, 343/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 148/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-11 finished in 829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.3 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2024-06-01 19:17:04] [INFO ] Computed 20 invariants in 15 ms
[2024-06-01 19:17:04] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 19:17:04] [INFO ] Invariant cache hit.
[2024-06-01 19:17:05] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-01 19:17:05] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-12
Stuttering criterion allowed to conclude after 165 steps with 3 reset in 8 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-12 finished in 756 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) U ((!p0&&X(!p0))||X(G(!p0)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 147 transition count 343
Applied a total of 343 rules in 6 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:17:05] [INFO ] Invariant cache hit.
[2024-06-01 19:17:05] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 19:17:05] [INFO ] Invariant cache hit.
[2024-06-01 19:17:06] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 634 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 : 147/490 places, 343/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLCardinality-15 finished in 761 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)))'
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)||(p1&&X(p2)))))'
Found a Shortening insensitive property : Sudoku-PT-AN07-LTLCardinality-06
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-06-01 19:17:06] [INFO ] Computed 147 invariants in 4 ms
[2024-06-01 19:17:06] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-01 19:17:06] [INFO ] Invariant cache hit.
[2024-06-01 19:17:07] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 608 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 618 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-PT-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 8238 ms.
Product exploration explored 100000 steps with 3846 reset in 8308 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 634 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (938 resets) in 2265 ms. (17 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 940 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 916 ms. (43 steps per ms) remains 3/3 properties
[2024-06-01 19:17:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 441/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 539 constraints, problems are : Problem set: 3 solved, 0 unsolved in 197 ms.
Refiners :[Domain max(s): 441/490 constraints, Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 496ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1744 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 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 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:17:40] [INFO ] Invariant cache hit.
[2024-06-01 19:17:40] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 19:17:40] [INFO ] Invariant cache hit.
[2024-06-01 19:17:41] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-01 19:17:41] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 583 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 304 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (935 resets) in 1268 ms. (31 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 742 ms. (53 steps per ms) remains 1/1 properties
[2024-06-01 19:17:48] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Domain max(s): 0/490 constraints, Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms 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 p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 16 factoid took 492 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 5350 ms.
Product exploration explored 100000 steps with 3846 reset in 5417 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-06-01 19:18:00] [INFO ] Invariant cache hit.
[2024-06-01 19:18:00] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 19:18:00] [INFO ] Invariant cache hit.
[2024-06-01 19:18:01] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2024-06-01 19:18:01] [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 873 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-PT-AN07-LTLCardinality-06 finished in 54685 ms.
[2024-06-01 19:18:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:18:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 19:18:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 343 transitions and 1372 arcs took 4 ms.
Total runtime 195896 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:
++ 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
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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