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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 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 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 132K 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-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717269101064

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-AN06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:11:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:11:42] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 19:11:42] [INFO ] Transformed 324 places.
[2024-06-01 19:11:42] [INFO ] Transformed 216 transitions.
[2024-06-01 19:11:42] [INFO ] Found NUPN structural information;
[2024-06-01 19:11:42] [INFO ] Parsed PT model containing 324 places and 216 transitions and 864 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-06-01 19:11:42] [INFO ] Computed 108 invariants in 19 ms
[2024-06-01 19:11:42] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 19:11:42] [INFO ] Invariant cache hit.
[2024-06-01 19:11:43] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2024-06-01 19:11:43] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:11:43] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:11:43] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (1272 resets) in 2540 ms. (15 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40004 steps (16 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
[2024-06-01 19:11:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (OVERLAPS) 216/324 variables, 108/216 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 216/432 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/432 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 216/540 variables, 324/756 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/756 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/540 variables, 0/756 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 756 constraints, problems are : Problem set: 3 solved, 4 unsolved in 435 ms.
Refiners :[Domain max(s): 324/324 constraints, Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 216/324 variables, 108/216 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 216/432 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/432 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 216/540 variables, 324/756 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 4/760 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/760 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/760 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/540 variables, and 760 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1246 ms.
Refiners :[Domain max(s): 324/324 constraints, Positive P Invariants (semi-flows): 108/108 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1835ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 83 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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' '!((p0 U G((p1&&X(p1)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 19:11:47] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 19:11:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 19:11:47] [INFO ] Invariant cache hit.
[2024-06-01 19:11:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-01 19:11:47] [INFO ] Redundant transitions in 7 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 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-02
Product exploration explored 100000 steps with 33353 reset in 2893 ms.
Product exploration explored 100000 steps with 33385 reset in 2666 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 326 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1270 resets) in 1350 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 587485 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 6
Probabilistic random walk after 587485 steps, saw 99566 distinct states, run finished after 3010 ms. (steps per millisecond=195 ) properties seen :0
[2024-06-01 19:11:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 233 constraints, problems are : Problem set: 2 solved, 4 unsolved in 311 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/108 variables, 14/89 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 36/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 216/324 variables, 108/233 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 4/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 237 constraints, problems are : Problem set: 2 solved, 4 unsolved in 541 ms.
Refiners :[Domain max(s): 108/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 930ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 17 factoid took 242 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-02 finished in 12065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 15 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:11:59] [INFO ] Invariant cache hit.
[2024-06-01 19:11:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 19:11:59] [INFO ] Invariant cache hit.
[2024-06-01 19:11:59] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 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 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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-AN06-LTLCardinality-03
Product exploration explored 100000 steps with 3186 reset in 1611 ms.
Product exploration explored 100000 steps with 3185 reset in 1537 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p0) p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (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 13 factoid took 791 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1273 resets) in 1001 ms. (39 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
[2024-06-01 19:12:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 108/324 variables, and 89 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Domain max(s): 72/108 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-03 finished in 5332 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 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-06-01 19:12:04] [INFO ] Computed 108 invariants in 3 ms
[2024-06-01 19:12:04] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 19:12:04] [INFO ] Invariant cache hit.
[2024-06-01 19:12:04] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-01 19:12:04] [INFO ] Redundant transitions in 13 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 503 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-05
Product exploration explored 100000 steps with 5000 reset in 2250 ms.
Product exploration explored 100000 steps with 5000 reset in 2327 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 104 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 126 ms :[(NOT p0)]
RANDOM walk for 76 steps (0 resets) in 8 ms. (8 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 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-06-01 19:12:10] [INFO ] Invariant cache hit.
[2024-06-01 19:12:11] [INFO ] [Real]Absence check using 108 positive place invariants in 146 ms returned sat
[2024-06-01 19:12:11] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-06-01 19:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:12:13] [INFO ] [Nat]Absence check using 108 positive place invariants in 25 ms returned sat
[2024-06-01 19:12:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 19:12:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 19:12:13] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:13] [INFO ] Invariant cache hit.
[2024-06-01 19:12:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 19:12:13] [INFO ] Invariant cache hit.
[2024-06-01 19:12:14] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-06-01 19:12:14] [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 497 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 78 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 26 ms :[(NOT p0)]
RANDOM walk for 76 steps (0 resets) in 8 ms. (8 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-06-01 19:12:14] [INFO ] Invariant cache hit.
[2024-06-01 19:12:15] [INFO ] [Real]Absence check using 108 positive place invariants in 129 ms returned sat
[2024-06-01 19:12:16] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-06-01 19:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:12:18] [INFO ] [Nat]Absence check using 108 positive place invariants in 24 ms returned sat
[2024-06-01 19:12:18] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 19:12:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 19:12:18] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2279 ms.
Product exploration explored 100000 steps with 5000 reset in 2333 ms.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:22] [INFO ] Invariant cache hit.
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 19:12:23] [INFO ] Invariant cache hit.
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-06-01 19:12:23] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 324/324 places, 216/216 transitions.
Treatment of property Sudoku-PT-AN06-LTLCardinality-05 finished in 19073 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 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 19:12:23] [INFO ] Computed 17 invariants in 20 ms
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 19:12:23] [INFO ] Invariant cache hit.
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-06-01 19:12:23] [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 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-06
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-06 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-06-01 19:12:24] [INFO ] Computed 108 invariants in 2 ms
[2024-06-01 19:12:24] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 19:12:24] [INFO ] Invariant cache hit.
[2024-06-01 19:12:24] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 582 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 585 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 2026 ms.
Product exploration explored 100000 steps with 50000 reset in 2034 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-07 finished in 5148 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 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 110 are kept as prefixes of interest. Removing 214 places using SCC suffix rule.2 ms
Discarding 214 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 110 /324 variables (removed 214) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 110 cols
[2024-06-01 19:12:29] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 19:12:29] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 19:12:29] [INFO ] Invariant cache hit.
[2024-06-01 19:12:29] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-06-01 19:12:29] [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
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 110/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-08
Stuttering criterion allowed to conclude after 740 steps with 63 reset in 17 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-08 finished in 512 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((X(p0)&&!p0)) U X(!X(!p1))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 19:12:29] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 19:12:29] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 19:12:29] [INFO ] Invariant cache hit.
[2024-06-01 19:12:30] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 403 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 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 369 ms :[true, (AND p0 p1), p0, p1, false, false, p1, p1, p1, p1, p1]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-09 finished in 808 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||G(F((p1||G(p2)))))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 109 are kept as prefixes of interest. Removing 215 places using SCC suffix rule.2 ms
Discarding 215 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2024-06-01 19:12:30] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 19:12:30] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 19:12:30] [INFO ] Invariant cache hit.
[2024-06-01 19:12:30] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-01 19:12:30] [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
Starting structural reductions in SI_LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-12
Stuttering criterion allowed to conclude after 65 steps with 2 reset in 3 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-12 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&X(F(p1))) U X(p2)))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 3 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 19:12:30] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 19:12:31] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 19:12:31] [INFO ] Invariant cache hit.
[2024-06-01 19:12:31] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 393 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 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), false]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-15
Stuttering criterion allowed to conclude after 24831 steps with 9716 reset in 552 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-15 finished in 1200 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))'
[2024-06-01 19:12:32] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:12:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 19:12:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 324 places, 216 transitions and 864 arcs took 5 ms.
Total runtime 50201 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN06"
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-AN06, 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-171690532700611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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