Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200707.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LeafsetExtension-PT-S08C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 647K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748889314823

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 18:35:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:35:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:35:16] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-02 18:35:16] [INFO ] Transformed 462 places.
[2025-06-02 18:35:16] [INFO ] Transformed 409 transitions.
[2025-06-02 18:35:16] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 386 transition count 409
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 138 place count 324 transition count 347
Iterating global reduction 1 with 62 rules applied. Total rules applied 200 place count 324 transition count 347
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 239 place count 285 transition count 308
Iterating global reduction 1 with 39 rules applied. Total rules applied 278 place count 285 transition count 308
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 311 place count 252 transition count 275
Iterating global reduction 1 with 33 rules applied. Total rules applied 344 place count 252 transition count 275
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 347 place count 249 transition count 275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 248 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 248 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 247 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 247 transition count 273
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 246 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 246 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 245 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 245 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 244 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 244 transition count 270
Applied a total of 357 rules in 120 ms. Remains 244 /462 variables (removed 218) and now considering 270/409 (removed 139) transitions.
[2025-06-02 18:35:16] [INFO ] Flow matrix only has 269 transitions (discarded 1 similar events)
// Phase 1: matrix 269 rows 244 cols
[2025-06-02 18:35:16] [INFO ] Computed 29 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:17] [INFO ] Implicit Places using invariants in 415 ms returned [5, 31, 40, 50, 78, 106, 108, 122, 132, 152, 177, 196, 221]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 453 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/462 places, 270/409 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 198 transition count 237
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 198 transition count 237
Applied a total of 66 rules in 6 ms. Remains 198 /231 variables (removed 33) and now considering 237/270 (removed 33) transitions.
[2025-06-02 18:35:17] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
// Phase 1: matrix 235 rows 198 cols
[2025-06-02 18:35:17] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 18:35:17] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
[2025-06-02 18:35:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:17] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 198/462 places, 237/409 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1038 ms. Remains : 198/462 places, 237/409 transitions.
Support contains 42 out of 198 places after structural reductions.
[2025-06-02 18:35:17] [INFO ] Flatten gal took : 38 ms
[2025-06-02 18:35:17] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:35:17] [INFO ] Input system was already deterministic with 237 transitions.
RANDOM walk for 40000 steps (2137 resets) in 1919 ms. (20 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40004 steps (460 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (358 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (463 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (465 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (462 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (461 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (471 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (461 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (463 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (461 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
[2025-06-02 18:35:19] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
[2025-06-02 18:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/14 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 161/175 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 17/192 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 426/433 variables, and 208 constraints, problems are : Problem set: 10 solved, 0 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 192/198 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 198 stabilizing places and 237 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 198 transition count 237
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&X(X(X(p2)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 189 transition count 237
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 33 place count 165 transition count 213
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 165 transition count 213
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 143 transition count 191
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 143 transition count 191
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 138 transition count 191
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 128 place count 116 transition count 169
Iterating global reduction 2 with 22 rules applied. Total rules applied 150 place count 116 transition count 169
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 110 transition count 169
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 177 place count 89 transition count 148
Iterating global reduction 3 with 21 rules applied. Total rules applied 198 place count 89 transition count 148
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 209 place count 78 transition count 137
Iterating global reduction 3 with 11 rules applied. Total rules applied 220 place count 78 transition count 137
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 231 place count 67 transition count 126
Iterating global reduction 3 with 11 rules applied. Total rules applied 242 place count 67 transition count 126
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 253 place count 56 transition count 115
Iterating global reduction 3 with 11 rules applied. Total rules applied 264 place count 56 transition count 115
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 50 transition count 109
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 50 transition count 109
Applied a total of 276 rules in 18 ms. Remains 50 /198 variables (removed 148) and now considering 109/237 (removed 128) transitions.
[2025-06-02 18:35:20] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
// Phase 1: matrix 58 rows 50 cols
[2025-06-02 18:35:20] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:20] [INFO ] Implicit Places using invariants in 41 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/198 places, 109/237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 47 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 104
Applied a total of 10 rules in 4 ms. Remains 44 /49 variables (removed 5) and now considering 104/109 (removed 5) transitions.
[2025-06-02 18:35:20] [INFO ] Flow matrix only has 50 transitions (discarded 54 similar events)
// Phase 1: matrix 50 rows 44 cols
[2025-06-02 18:35:20] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 18:35:20] [INFO ] Flow matrix only has 50 transitions (discarded 54 similar events)
[2025-06-02 18:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:20] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 44/198 places, 104/237 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 44/198 places, 104/237 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-00
Product exploration explored 100000 steps with 33280 reset in 286 ms.
Product exploration explored 100000 steps with 33313 reset in 173 ms.
Computed a total of 44 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 104
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 403 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 6049 steps (300 resets) in 48 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 12 factoid took 526 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 1 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-02 18:35:23] [INFO ] Flow matrix only has 50 transitions (discarded 54 similar events)
[2025-06-02 18:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 18:35:23] [INFO ] Flow matrix only has 50 transitions (discarded 54 similar events)
[2025-06-02 18:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-02 18:35:23] [INFO ] Flow matrix only has 50 transitions (discarded 54 similar events)
[2025-06-02 18:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 50/94 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 46 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1763 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 50/94 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 95/141 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 141 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2295 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4075ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4078ms
Finished structural reductions in LTL mode , in 1 iterations and 4185 ms. Remains : 44/44 places, 104/104 transitions.
Computed a total of 44 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 104
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 3911 steps (194 resets) in 36 ms. (105 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Product exploration explored 100000 steps with 25000 reset in 178 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 104/104 transitions.
Graph (complete) has 170 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 43 transition count 103
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 43 transition count 103
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 14 place count 43 transition count 103
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 23 place count 34 transition count 94
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 32 place count 34 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 32 rules in 23 ms. Remains 34 /44 variables (removed 10) and now considering 94/104 (removed 10) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:35:29] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-02 18:35:29] [INFO ] Flow matrix only has 36 transitions (discarded 58 similar events)
// Phase 1: matrix 36 rows 34 cols
[2025-06-02 18:35:29] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 4 (OVERLAPS) 36/70 variables, 34/36 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 36 constraints, problems are : Problem set: 7 solved, 78 unsolved in 1104 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 8/34 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 36/70 variables, 34/36 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 78/114 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/114 constraints. Problems are: Problem set: 7 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/114 constraints. Problems are: Problem set: 7 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 114 constraints, problems are : Problem set: 7 solved, 78 unsolved in 1362 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 78/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2478ms problems are : Problem set: 7 solved, 78 unsolved
Search for dead transitions found 7 dead transitions in 2479ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 87/104 transitions.
Graph (complete) has 142 edges and 34 vertex of which 27 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 27 /34 variables (removed 7) and now considering 87/87 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/44 places, 87/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2516 ms. Remains : 27/44 places, 87/104 transitions.
Built C files in :
/tmp/ltsmin10322682292910579859
[2025-06-02 18:35:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10322682292910579859
Running compilation step : cd /tmp/ltsmin10322682292910579859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 373 ms.
Running link step : cd /tmp/ltsmin10322682292910579859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10322682292910579859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3634634289785368455.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-00 finished in 12431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 32 place count 166 transition count 213
Iterating global reduction 1 with 24 rules applied. Total rules applied 56 place count 166 transition count 213
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 144 transition count 191
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 144 transition count 191
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 105 place count 139 transition count 191
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 126 place count 118 transition count 170
Iterating global reduction 2 with 21 rules applied. Total rules applied 147 place count 118 transition count 170
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 112 transition count 170
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 174 place count 91 transition count 149
Iterating global reduction 3 with 21 rules applied. Total rules applied 195 place count 91 transition count 149
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 79 transition count 137
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 79 transition count 137
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 230 place count 68 transition count 126
Iterating global reduction 3 with 11 rules applied. Total rules applied 241 place count 68 transition count 126
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 252 place count 57 transition count 115
Iterating global reduction 3 with 11 rules applied. Total rules applied 263 place count 57 transition count 115
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 269 place count 51 transition count 109
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 51 transition count 109
Applied a total of 275 rules in 19 ms. Remains 51 /198 variables (removed 147) and now considering 109/237 (removed 128) transitions.
[2025-06-02 18:35:32] [INFO ] Flow matrix only has 57 transitions (discarded 52 similar events)
// Phase 1: matrix 57 rows 51 cols
[2025-06-02 18:35:32] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 18:35:32] [INFO ] Flow matrix only has 57 transitions (discarded 52 similar events)
[2025-06-02 18:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-02 18:35:32] [INFO ] Flow matrix only has 57 transitions (discarded 52 similar events)
[2025-06-02 18:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 57/107 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 54 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2253 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 57/107 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 98/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 154 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3781 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6049ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6050ms
Starting structural reductions in LTL mode, iteration 1 : 51/198 places, 109/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6171 ms. Remains : 51/198 places, 109/237 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-01
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-01 finished in 6366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)&&F(p1))||G(p0))))||(!p0&&X(F(((X(p0)&&F(p1))||G(p0))))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 31 place count 167 transition count 214
Iterating global reduction 1 with 23 rules applied. Total rules applied 54 place count 167 transition count 214
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 146 transition count 193
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 146 transition count 193
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 100 place count 142 transition count 193
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 120 place count 122 transition count 173
Iterating global reduction 2 with 20 rules applied. Total rules applied 140 place count 122 transition count 173
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 116 transition count 173
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 167 place count 95 transition count 152
Iterating global reduction 3 with 21 rules applied. Total rules applied 188 place count 95 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 198 place count 85 transition count 142
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 85 transition count 142
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 217 place count 76 transition count 133
Iterating global reduction 3 with 9 rules applied. Total rules applied 226 place count 76 transition count 133
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 235 place count 67 transition count 124
Iterating global reduction 3 with 9 rules applied. Total rules applied 244 place count 67 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 62 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 62 transition count 119
Applied a total of 254 rules in 31 ms. Remains 62 /198 variables (removed 136) and now considering 119/237 (removed 118) transitions.
[2025-06-02 18:35:38] [INFO ] Flow matrix only has 71 transitions (discarded 48 similar events)
// Phase 1: matrix 71 rows 62 cols
[2025-06-02 18:35:38] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 18:35:38] [INFO ] Flow matrix only has 71 transitions (discarded 48 similar events)
[2025-06-02 18:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:38] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-06-02 18:35:38] [INFO ] Flow matrix only has 71 transitions (discarded 48 similar events)
[2025-06-02 18:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 66 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2840 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 108/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 176 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5697 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8550ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8551ms
Starting structural reductions in LTL mode, iteration 1 : 62/198 places, 119/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8756 ms. Remains : 62/198 places, 119/237 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-03
Product exploration explored 100000 steps with 5655 reset in 181 ms.
Product exploration explored 100000 steps with 5656 reset in 232 ms.
Computed a total of 62 stabilizing places and 119 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 119
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-03 finished in 9445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Graph (complete) has 468 edges and 198 vertex of which 188 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 188 transition count 192
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 144 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 142 transition count 190
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 93 place count 142 transition count 171
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 131 place count 123 transition count 171
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 149 place count 105 transition count 153
Iterating global reduction 3 with 18 rules applied. Total rules applied 167 place count 105 transition count 153
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 177 place count 95 transition count 143
Iterating global reduction 3 with 10 rules applied. Total rules applied 187 place count 95 transition count 143
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 192 place count 90 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 192 place count 90 transition count 138
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 202 place count 85 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 207 place count 80 transition count 133
Iterating global reduction 4 with 5 rules applied. Total rules applied 212 place count 80 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 217 place count 75 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 222 place count 75 transition count 128
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 258 place count 57 transition count 110
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 265 place count 50 transition count 103
Iterating global reduction 4 with 7 rules applied. Total rules applied 272 place count 50 transition count 103
Applied a total of 272 rules in 30 ms. Remains 50 /198 variables (removed 148) and now considering 103/237 (removed 134) transitions.
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 73 transitions (discarded 30 similar events)
// Phase 1: matrix 73 rows 50 cols
[2025-06-02 18:35:48] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:48] [INFO ] Implicit Places using invariants in 52 ms returned [3, 12, 17, 21, 27, 31, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 53 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/198 places, 103/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 35 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 35 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 33 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 31 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 31 transition count 91
Applied a total of 24 rules in 6 ms. Remains 31 /43 variables (removed 12) and now considering 91/103 (removed 12) transitions.
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 37 transitions (discarded 54 similar events)
// Phase 1: matrix 37 rows 31 cols
[2025-06-02 18:35:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 37 transitions (discarded 54 similar events)
[2025-06-02 18:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:48] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/198 places, 91/237 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 31/198 places, 91/237 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-04
Product exploration explored 100000 steps with 10242 reset in 122 ms.
Product exploration explored 100000 steps with 10218 reset in 127 ms.
Computed a total of 31 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 91
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-04 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U ((p1||X(G(p2))) U X(X(!p1))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 31 place count 167 transition count 214
Iterating global reduction 1 with 23 rules applied. Total rules applied 54 place count 167 transition count 214
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 145 transition count 192
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 145 transition count 192
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 141 transition count 192
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 121 place count 122 transition count 173
Iterating global reduction 2 with 19 rules applied. Total rules applied 140 place count 122 transition count 173
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 116 transition count 173
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 167 place count 95 transition count 152
Iterating global reduction 3 with 21 rules applied. Total rules applied 188 place count 95 transition count 152
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 199 place count 84 transition count 141
Iterating global reduction 3 with 11 rules applied. Total rules applied 210 place count 84 transition count 141
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 220 place count 74 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 230 place count 74 transition count 131
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 240 place count 64 transition count 121
Iterating global reduction 3 with 10 rules applied. Total rules applied 250 place count 64 transition count 121
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 256 place count 58 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 262 place count 58 transition count 115
Applied a total of 262 rules in 11 ms. Remains 58 /198 variables (removed 140) and now considering 115/237 (removed 122) transitions.
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
// Phase 1: matrix 62 rows 58 cols
[2025-06-02 18:35:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
[2025-06-02 18:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-02 18:35:48] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
[2025-06-02 18:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 62/119 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 62 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2384 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 62/119 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 104/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/120 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 168 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4800 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7194ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7195ms
Starting structural reductions in LTL mode, iteration 1 : 58/198 places, 115/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7318 ms. Remains : 58/198 places, 115/237 transitions.
Stuttering acceptance computed with spot in 375 ms :[p1, p1, (AND (NOT p0) p1 (NOT p2)), p1, p1, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Computed a total of 58 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 115
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 562 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 33426 steps (1700 resets) in 127 ms. (261 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (OR (NOT p1) p0))), (F p2), (F p1), (F p0), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p1) p0))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 1220 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 332 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-06-02 18:35:59] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
[2025-06-02 18:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 18:35:59] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
[2025-06-02 18:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:35:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-02 18:35:59] [INFO ] Flow matrix only has 62 transitions (discarded 53 similar events)
[2025-06-02 18:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 62/119 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 62 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2653 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 62/119 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 104/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/120 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 168 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4819 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7480ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7481ms
Finished structural reductions in LTL mode , in 1 iterations and 7595 ms. Remains : 58/58 places, 115/115 transitions.
Computed a total of 58 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 115
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 32709 steps (1656 resets) in 138 ms. (235 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT (OR (NOT p1) p0))), (F p2), (F p1), (F p0), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p1) p0))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 548 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 374 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 357 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 343 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 115/115 transitions.
Graph (complete) has 195 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 57 transition count 114
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 7 place count 57 transition count 116
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 57 transition count 116
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 54 transition count 113
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 54 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 54 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 49 transition count 108
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 49 transition count 108
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 35 rules in 15 ms. Remains 49 /58 variables (removed 9) and now considering 108/115 (removed 7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:36:10] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-02 18:36:10] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 49 cols
[2025-06-02 18:36:10] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 4 (OVERLAPS) 54/102 variables, 48/52 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/53 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/53 constraints. Problems are: Problem set: 12 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 53 constraints, problems are : Problem set: 12 solved, 87 unsolved in 1995 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 11/48 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 54/102 variables, 48/52 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 85/137 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/140 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 140 constraints, problems are : Problem set: 12 solved, 87 unsolved in 3252 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 87/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5256ms problems are : Problem set: 12 solved, 87 unsolved
Search for dead transitions found 12 dead transitions in 5256ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/58 places, 96/115 transitions.
Graph (complete) has 176 edges and 49 vertex of which 39 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 39 /49 variables (removed 10) and now considering 96/96 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/58 places, 96/115 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5286 ms. Remains : 39/58 places, 96/115 transitions.
Built C files in :
/tmp/ltsmin5853655997160977168
[2025-06-02 18:36:15] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5853655997160977168
Running compilation step : cd /tmp/ltsmin5853655997160977168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin5853655997160977168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5853655997160977168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17697109476239113541.hoa' '--buchi-type=spotba'
LTSmin run took 133 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-05 finished in 27190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&X(G(p1))) U X(G(p0)))&&F(p1)))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 31 place count 167 transition count 214
Iterating global reduction 1 with 23 rules applied. Total rules applied 54 place count 167 transition count 214
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 146 transition count 193
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 146 transition count 193
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 100 place count 142 transition count 193
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 119 place count 123 transition count 174
Iterating global reduction 2 with 19 rules applied. Total rules applied 138 place count 123 transition count 174
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 117 transition count 174
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 163 place count 98 transition count 155
Iterating global reduction 3 with 19 rules applied. Total rules applied 182 place count 98 transition count 155
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 193 place count 87 transition count 144
Iterating global reduction 3 with 11 rules applied. Total rules applied 204 place count 87 transition count 144
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 214 place count 77 transition count 134
Iterating global reduction 3 with 10 rules applied. Total rules applied 224 place count 77 transition count 134
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 234 place count 67 transition count 124
Iterating global reduction 3 with 10 rules applied. Total rules applied 244 place count 67 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 250 place count 61 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 256 place count 61 transition count 118
Applied a total of 256 rules in 7 ms. Remains 61 /198 variables (removed 137) and now considering 118/237 (removed 119) transitions.
[2025-06-02 18:36:15] [INFO ] Flow matrix only has 71 transitions (discarded 47 similar events)
// Phase 1: matrix 71 rows 61 cols
[2025-06-02 18:36:15] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 18:36:15] [INFO ] Flow matrix only has 71 transitions (discarded 47 similar events)
[2025-06-02 18:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-02 18:36:15] [INFO ] Flow matrix only has 71 transitions (discarded 47 similar events)
[2025-06-02 18:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2916 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 174 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6114 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9039ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 9039ms
Starting structural reductions in LTL mode, iteration 1 : 61/198 places, 118/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9181 ms. Remains : 61/198 places, 118/237 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 28 steps with 1 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-06 finished in 9393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 189 transition count 237
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 34 place count 164 transition count 212
Iterating global reduction 1 with 25 rules applied. Total rules applied 59 place count 164 transition count 212
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 141 transition count 189
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 141 transition count 189
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 136 transition count 189
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 132 place count 114 transition count 167
Iterating global reduction 2 with 22 rules applied. Total rules applied 154 place count 114 transition count 167
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 160 place count 108 transition count 167
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 182 place count 86 transition count 145
Iterating global reduction 3 with 22 rules applied. Total rules applied 204 place count 86 transition count 145
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 216 place count 74 transition count 133
Iterating global reduction 3 with 12 rules applied. Total rules applied 228 place count 74 transition count 133
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 239 place count 63 transition count 122
Iterating global reduction 3 with 11 rules applied. Total rules applied 250 place count 63 transition count 122
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 261 place count 52 transition count 111
Iterating global reduction 3 with 11 rules applied. Total rules applied 272 place count 52 transition count 111
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 278 place count 46 transition count 105
Iterating global reduction 3 with 6 rules applied. Total rules applied 284 place count 46 transition count 105
Applied a total of 284 rules in 9 ms. Remains 46 /198 variables (removed 152) and now considering 105/237 (removed 132) transitions.
[2025-06-02 18:36:25] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2025-06-02 18:36:25] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 18:36:25] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
[2025-06-02 18:36:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-02 18:36:25] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
[2025-06-02 18:36:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 49/95 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 49 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1632 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 49/95 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 145 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2432 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4092ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4093ms
Starting structural reductions in LTL mode, iteration 1 : 46/198 places, 105/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4224 ms. Remains : 46/198 places, 105/237 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-11 finished in 4339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(F(p1))||(!p2&&F(p1)))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 33 place count 165 transition count 212
Iterating global reduction 1 with 25 rules applied. Total rules applied 58 place count 165 transition count 212
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 142 transition count 189
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 142 transition count 189
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 109 place count 137 transition count 189
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 130 place count 116 transition count 168
Iterating global reduction 2 with 21 rules applied. Total rules applied 151 place count 116 transition count 168
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 157 place count 110 transition count 168
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 179 place count 88 transition count 146
Iterating global reduction 3 with 22 rules applied. Total rules applied 201 place count 88 transition count 146
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 212 place count 77 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 223 place count 77 transition count 135
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 233 place count 67 transition count 125
Iterating global reduction 3 with 10 rules applied. Total rules applied 243 place count 67 transition count 125
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 253 place count 57 transition count 115
Iterating global reduction 3 with 10 rules applied. Total rules applied 263 place count 57 transition count 115
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 269 place count 51 transition count 109
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 51 transition count 109
Applied a total of 275 rules in 11 ms. Remains 51 /198 variables (removed 147) and now considering 109/237 (removed 128) transitions.
[2025-06-02 18:36:29] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
// Phase 1: matrix 58 rows 51 cols
[2025-06-02 18:36:29] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 18:36:29] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
[2025-06-02 18:36:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-02 18:36:29] [INFO ] Flow matrix only has 58 transitions (discarded 51 similar events)
[2025-06-02 18:36:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 58/108 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 54 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2213 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 58/108 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 98/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 154 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4162 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6390ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6391ms
Starting structural reductions in LTL mode, iteration 1 : 51/198 places, 109/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6546 ms. Remains : 51/198 places, 109/237 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-12 finished in 6739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 237/237 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 190 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 31 place count 167 transition count 214
Iterating global reduction 1 with 23 rules applied. Total rules applied 54 place count 167 transition count 214
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 145 transition count 192
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 145 transition count 192
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 141 transition count 192
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 122 place count 121 transition count 172
Iterating global reduction 2 with 20 rules applied. Total rules applied 142 place count 121 transition count 172
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 115 transition count 172
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 168 place count 95 transition count 152
Iterating global reduction 3 with 20 rules applied. Total rules applied 188 place count 95 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 198 place count 85 transition count 142
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 85 transition count 142
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 217 place count 76 transition count 133
Iterating global reduction 3 with 9 rules applied. Total rules applied 226 place count 76 transition count 133
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 235 place count 67 transition count 124
Iterating global reduction 3 with 9 rules applied. Total rules applied 244 place count 67 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 250 place count 61 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 256 place count 61 transition count 118
Applied a total of 256 rules in 13 ms. Remains 61 /198 variables (removed 137) and now considering 118/237 (removed 119) transitions.
[2025-06-02 18:36:36] [INFO ] Flow matrix only has 70 transitions (discarded 48 similar events)
// Phase 1: matrix 70 rows 61 cols
[2025-06-02 18:36:36] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 18:36:36] [INFO ] Flow matrix only has 70 transitions (discarded 48 similar events)
[2025-06-02 18:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:36] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-02 18:36:36] [INFO ] Flow matrix only has 70 transitions (discarded 48 similar events)
[2025-06-02 18:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 65 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2793 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 174 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5628 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8444ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8444ms
Starting structural reductions in LTL mode, iteration 1 : 61/198 places, 118/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8583 ms. Remains : 61/198 places, 118/237 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-LTLCardinality-15
Product exploration explored 100000 steps with 5621 reset in 168 ms.
Product exploration explored 100000 steps with 5625 reset in 182 ms.
Computed a total of 61 stabilizing places and 118 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 118
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 355 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (2063 resets) in 149 ms. (266 steps per ms) remains 1/4 properties
BEST_FIRST walk for 14274 steps (210 resets) in 44 ms. (317 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 11 factoid took 487 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C2-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C2-LTLCardinality-15 finished in 10139 ms.
All properties solved by simple procedures.
Total runtime 90129 ms.

BK_STOP 1748889406738

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S08C2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S08C2, 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 r114-tall-174876423200707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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