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.r399-tall-171690530300411.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 greatspnxred
Input is Sudoku-COL-AN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530300411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.6K Apr 12 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 10:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 10:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 10:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-AN01-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717024802142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 23:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:20:03] [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-05-29 23:20:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:20:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 488 ms
[2024-05-29 23:20:03] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-29 23:20:04] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-29 23:20:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN01-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-14 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).
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (20000 resets) in 979 ms. (40 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 372 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 112 ms. (353 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-29 23:20:04] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 11 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Int declared 3/5 variables, and 2 constraints, problems are : Problem set: 12 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:20:05] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-05-29 23:20:05] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:20:05] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:20:05] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-29 23:20:05] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 12 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2024-05-29 23:20:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 23:20:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 23:20:05] [INFO ] Invariant cache hit.
[2024-05-29 23:20:05] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 3/4 places, 1/1 transitions.
Support contains 3 out of 3 places after structural reductions.
[2024-05-29 23:20:05] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:20:05] [INFO ] Flatten gal took : 0 ms
[2024-05-29 23:20:05] [INFO ] Input system was already deterministic with 1 transitions.
RANDOM walk for 40000 steps (20000 resets) in 120 ms. (330 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
[2024-05-29 23:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 2/4 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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((p0 U X(X(G(p1))))))))'
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2 transition count 1
Applied a total of 1 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-29 23:20:05] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 23:20:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 23:20:05] [INFO ] Invariant cache hit.
[2024-05-29 23:20:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 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 : 2/3 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 2/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 426 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (20000 resets) in 115 ms. (344 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2024-05-29 23:20:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3/3 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/3 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms 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) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-29 23:20:07] [INFO ] Invariant cache hit.
[2024-05-29 23:20:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 23:20:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-29 23:20:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:07] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 23:20:07] [INFO ] Invariant cache hit.
[2024-05-29 23:20:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 23:20:07] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 23:20:07] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:07] [INFO ] Invariant cache hit.
[2024-05-29 23:20:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 23:20:07] [INFO ] Invariant cache hit.
[2024-05-29 23:20:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 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 41 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-29 23:20:09] [INFO ] Invariant cache hit.
[2024-05-29 23:20:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 23:20:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-29 23:20:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 23:20:09] [INFO ] Invariant cache hit.
[2024-05-29 23:20:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 23:20:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-29 23:20:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 23:20:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 3 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:10] [INFO ] Redundant transitions in 0 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 13 ms. Remains : 2/2 places, 1/1 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:10] [INFO ] Invariant cache hit.
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 23:20:10] [INFO ] Invariant cache hit.
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 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 52 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-01 finished in 4608 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)||G(p1))))'
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:10] [INFO ] Invariant cache hit.
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 23:20:10] [INFO ] Invariant cache hit.
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-29 23:20:10] [INFO ] Redundant transitions in 0 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 56 ms. Remains : 2/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLCardinality-02 finished in 116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 6 ms. Remains 1 /3 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-29 23:20:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 23:20:10] [INFO ] Invariant cache hit.
[2024-05-29 23:20:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 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 : 1/3 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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).
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 23:20:11] [INFO ] Invariant cache hit.
[2024-05-29 23:20:11] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:11] [INFO ] Invariant cache hit.
[2024-05-29 23:20:11] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-29 23:20:11] [INFO ] Invariant cache hit.
[2024-05-29 23:20:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 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 42 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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).
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 23:20:11] [INFO ] Invariant cache hit.
[2024-05-29 23:20:11] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 30 ms.
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:12] [INFO ] Redundant transitions in 0 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 7 ms. Remains : 1/1 places, 1/1 transitions.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:12] [INFO ] Invariant cache hit.
[2024-05-29 23:20:12] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-29 23:20:12] [INFO ] Invariant cache hit.
[2024-05-29 23:20:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 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 32 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-10 finished in 1979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U X(X(G(p1))))))))'
Found a Lengthening insensitive property : Sudoku-COL-AN01-LTLCardinality-01
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-29 23:20:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 23:20:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 23:20:12] [INFO ] Invariant cache hit.
[2024-05-29 23:20:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 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 46 ms. Remains : 2/3 places, 1/1 transitions.
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 28 ms.
Product exploration explored 100000 steps with 50000 reset in 26 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (20000 resets) in 186 ms. (213 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-29 23:20:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3/3 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/3 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms 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) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-29 23:20:14] [INFO ] Invariant cache hit.
[2024-05-29 23:20:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 23:20:14] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:14] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 23:20:14] [INFO ] Invariant cache hit.
[2024-05-29 23:20:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 23:20:14] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:14] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:14] [INFO ] Invariant cache hit.
[2024-05-29 23:20:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 23:20:14] [INFO ] Invariant cache hit.
[2024-05-29 23:20:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 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 38 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-29 23:20:15] [INFO ] Invariant cache hit.
[2024-05-29 23:20:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 23:20:15] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:15] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-29 23:20:15] [INFO ] Invariant cache hit.
[2024-05-29 23:20:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 23:20:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-29 23:20:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:15] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 32 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:16] [INFO ] Redundant transitions in 0 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 10 ms. Remains : 2/2 places, 1/1 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:16] [INFO ] Invariant cache hit.
[2024-05-29 23:20:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 23:20:16] [INFO ] Invariant cache hit.
[2024-05-29 23:20:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 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 44 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-01 finished in 4181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : Sudoku-COL-AN01-LTLCardinality-10
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Graph (complete) has 2 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 8 ms. Remains 1 /3 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-29 23:20:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-29 23:20:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 23:20:16] [INFO ] Invariant cache hit.
[2024-05-29 23:20:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 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 LI_LTL mode, iteration 1 : 1/3 places, 1/1 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55 ms. Remains : 1/3 places, 1/1 transitions.
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 30 ms.
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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).
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 23:20:17] [INFO ] Invariant cache hit.
[2024-05-29 23:20:17] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-29 23:20:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:17] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:17] [INFO ] Invariant cache hit.
[2024-05-29 23:20:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 23:20:17] [INFO ] Invariant cache hit.
[2024-05-29 23:20:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 52 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 52 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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).
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
[2024-05-29 23:20:17] [INFO ] Invariant cache hit.
[2024-05-29 23:20:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-29 23:20:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-29 23:20:17] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 29 ms.
Product exploration explored 100000 steps with 50000 reset in 29 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:18] [INFO ] Redundant transitions in 0 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 5 ms. Remains : 1/1 places, 1/1 transitions.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-29 23:20:18] [INFO ] Invariant cache hit.
[2024-05-29 23:20:18] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 23:20:18] [INFO ] Invariant cache hit.
[2024-05-29 23:20:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 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 33 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Sudoku-COL-AN01-LTLCardinality-10 finished in 1903 ms.
[2024-05-29 23:20:18] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:20:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 23:20:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3 places, 1 transitions and 3 arcs took 3 ms.
Total runtime 15066 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN01

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3
TRANSITIONS: 1
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1525
MODEL NAME: /home/mcc/execution/414/model
3 places, 1 transitions.

Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-COL-AN01-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN01-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717024819249

--------------------
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

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-AN01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-COL-AN01, 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 r399-tall-171690530300411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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