Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200731.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-S16C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 905K 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-S16C2-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748891116557

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-S16C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 19:05:19] [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 19:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:05:19] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-06-02 19:05:19] [INFO ] Transformed 1542 places.
[2025-06-02 19:05:19] [INFO ] Transformed 1449 transitions.
[2025-06-02 19:05:19] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1263 transition count 1449
Discarding 250 places :
Symmetric choice reduction at 1 with 250 rule applications. Total rules 529 place count 1013 transition count 1199
Iterating global reduction 1 with 250 rules applied. Total rules applied 779 place count 1013 transition count 1199
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 987 place count 805 transition count 991
Iterating global reduction 1 with 208 rules applied. Total rules applied 1195 place count 805 transition count 991
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1398 place count 602 transition count 788
Iterating global reduction 1 with 203 rules applied. Total rules applied 1601 place count 602 transition count 788
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 1611 place count 592 transition count 788
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1618 place count 585 transition count 781
Iterating global reduction 2 with 7 rules applied. Total rules applied 1625 place count 585 transition count 781
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1632 place count 578 transition count 774
Iterating global reduction 2 with 7 rules applied. Total rules applied 1639 place count 578 transition count 774
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1646 place count 571 transition count 767
Iterating global reduction 2 with 7 rules applied. Total rules applied 1653 place count 571 transition count 767
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1660 place count 564 transition count 760
Iterating global reduction 2 with 7 rules applied. Total rules applied 1667 place count 564 transition count 760
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1710 place count 521 transition count 717
Iterating global reduction 2 with 43 rules applied. Total rules applied 1753 place count 521 transition count 717
Applied a total of 1753 rules in 433 ms. Remains 521 /1542 variables (removed 1021) and now considering 717/1449 (removed 732) transitions.
[2025-06-02 19:05:20] [INFO ] Flow matrix only has 675 transitions (discarded 42 similar events)
// Phase 1: matrix 675 rows 521 cols
[2025-06-02 19:05:20] [INFO ] Computed 44 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:20] [INFO ] Implicit Places using invariants in 616 ms returned [44, 80, 115, 154, 179, 195, 209, 241, 248, 260, 262, 297, 318, 341, 358, 392, 430, 459, 484, 488]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 653 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/1542 places, 717/1449 transitions.
Discarding 157 places :
Symmetric choice reduction at 0 with 157 rule applications. Total rules 157 place count 344 transition count 560
Iterating global reduction 0 with 157 rules applied. Total rules applied 314 place count 344 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 315 place count 343 transition count 559
Iterating global reduction 0 with 1 rules applied. Total rules applied 316 place count 343 transition count 559
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 317 place count 342 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 318 place count 342 transition count 558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 319 place count 341 transition count 557
Iterating global reduction 0 with 1 rules applied. Total rules applied 320 place count 341 transition count 557
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 321 place count 340 transition count 556
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 340 transition count 556
Applied a total of 322 rules in 53 ms. Remains 340 /501 variables (removed 161) and now considering 556/717 (removed 161) transitions.
[2025-06-02 19:05:20] [INFO ] Flow matrix only has 497 transitions (discarded 59 similar events)
// Phase 1: matrix 497 rows 340 cols
[2025-06-02 19:05:20] [INFO ] Computed 24 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 19:05:20] [INFO ] Flow matrix only has 497 transitions (discarded 59 similar events)
[2025-06-02 19:05:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:21] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 340/1542 places, 556/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1828 ms. Remains : 340/1542 places, 556/1449 transitions.
Support contains 56 out of 340 places after structural reductions.
[2025-06-02 19:05:23] [INFO ] Flatten gal took : 58 ms
[2025-06-02 19:05:23] [INFO ] Flatten gal took : 36 ms
[2025-06-02 19:05:23] [INFO ] Input system was already deterministic with 556 transitions.
Support contains 50 out of 340 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (2151 resets) in 1533 ms. (26 steps per ms) remains 13/33 properties
BEST_FIRST walk for 40003 steps (331 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (328 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (328 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (328 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (328 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (334 resets) in 116 ms. (341 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (330 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (330 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (329 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (332 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (330 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (331 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (331 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
[2025-06-02 19:05:24] [INFO ] Flow matrix only has 497 transitions (discarded 59 similar events)
[2025-06-02 19:05:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 274/289 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/329 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 825/837 variables, and 353 constraints, problems are : Problem set: 12 solved, 0 unsolved in 432 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/340 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 340 stabilizing places and 556 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 340 transition count 556
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-S16C2-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-11 TRUE 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' '!((p0&&F(p1)))'
Support contains 4 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Graph (complete) has 1060 edges and 340 vertex of which 325 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 325 transition count 482
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 252 transition count 482
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 147 place count 252 transition count 446
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 219 place count 216 transition count 446
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 246 place count 189 transition count 419
Iterating global reduction 2 with 27 rules applied. Total rules applied 273 place count 189 transition count 419
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 285 place count 177 transition count 407
Iterating global reduction 2 with 12 rules applied. Total rules applied 297 place count 177 transition count 407
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 300 place count 174 transition count 407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 300 place count 174 transition count 404
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 306 place count 171 transition count 404
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 309 place count 168 transition count 401
Iterating global reduction 3 with 3 rules applied. Total rules applied 312 place count 168 transition count 401
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 315 place count 165 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 318 place count 165 transition count 398
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 404 place count 122 transition count 355
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 422 place count 104 transition count 337
Iterating global reduction 3 with 18 rules applied. Total rules applied 440 place count 104 transition count 337
Applied a total of 440 rules in 82 ms. Remains 104 /340 variables (removed 236) and now considering 337/556 (removed 219) transitions.
[2025-06-02 19:05:25] [INFO ] Flow matrix only has 236 transitions (discarded 101 similar events)
// Phase 1: matrix 236 rows 104 cols
[2025-06-02 19:05:25] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:25] [INFO ] Implicit Places using invariants in 79 ms returned [2, 3, 8, 9, 14, 22, 23, 34, 42, 43, 48, 52, 58, 59, 64, 65, 70]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 81 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/340 places, 337/556 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 72 transition count 322
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 72 transition count 322
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 57 transition count 307
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 57 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 55 transition count 305
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 53 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 53 transition count 303
Applied a total of 68 rules in 18 ms. Remains 53 /87 variables (removed 34) and now considering 303/337 (removed 34) transitions.
[2025-06-02 19:05:25] [INFO ] Flow matrix only has 66 transitions (discarded 237 similar events)
// Phase 1: matrix 66 rows 53 cols
[2025-06-02 19:05:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 19:05:25] [INFO ] Flow matrix only has 66 transitions (discarded 237 similar events)
[2025-06-02 19:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/340 places, 303/556 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 53/340 places, 303/556 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 4 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-00 finished in 630 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((p0 U p1)))) U G((p2||X(F(p0))))))'
Support contains 5 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 327 transition count 556
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 56 place count 284 transition count 513
Iterating global reduction 1 with 43 rules applied. Total rules applied 99 place count 284 transition count 513
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 132 place count 251 transition count 480
Iterating global reduction 1 with 33 rules applied. Total rules applied 165 place count 251 transition count 480
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 168 place count 248 transition count 480
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 199 place count 217 transition count 449
Iterating global reduction 2 with 31 rules applied. Total rules applied 230 place count 217 transition count 449
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 245 place count 202 transition count 449
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 282 place count 165 transition count 412
Iterating global reduction 3 with 37 rules applied. Total rules applied 319 place count 165 transition count 412
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 339 place count 145 transition count 392
Iterating global reduction 3 with 20 rules applied. Total rules applied 359 place count 145 transition count 392
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 377 place count 127 transition count 374
Iterating global reduction 3 with 18 rules applied. Total rules applied 395 place count 127 transition count 374
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 413 place count 109 transition count 356
Iterating global reduction 3 with 18 rules applied. Total rules applied 431 place count 109 transition count 356
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 446 place count 94 transition count 341
Iterating global reduction 3 with 15 rules applied. Total rules applied 461 place count 94 transition count 341
Applied a total of 461 rules in 36 ms. Remains 94 /340 variables (removed 246) and now considering 341/556 (removed 215) transitions.
[2025-06-02 19:05:26] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
// Phase 1: matrix 121 rows 94 cols
[2025-06-02 19:05:26] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 19:05:26] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:05:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 19:05:26] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 1/215 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 100 constraints, problems are : Problem set: 0 solved, 324 unsolved in 11790 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 322/421 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 1/215 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 424 constraints, problems are : Problem set: 0 solved, 324 unsolved in 29130 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40972ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40975ms
Starting structural reductions in LTL mode, iteration 1 : 94/340 places, 341/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41229 ms. Remains : 94/340 places, 341/556 transitions.
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-01
Product exploration explored 100000 steps with 16710 reset in 341 ms.
Product exploration explored 100000 steps with 16729 reset in 260 ms.
Computed a total of 94 stabilizing places and 341 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 341
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 p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 10 factoid took 615 ms. Reduced automaton from 14 states, 28 edges and 3 AP (stutter sensitive) to 14 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 593 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40001 steps (2111 resets) in 275 ms. (144 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (453 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (452 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
[2025-06-02 19:06:10] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:06:10] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/93 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/213 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/215 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:06:10] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/93 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 6 (OVERLAPS) 120/213 variables, 93/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/215 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 102 constraints, problems are : Problem set: 1 solved, 1 unsolved in 200 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p1) p0 p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F p1)]
Knowledge based reduction with 11 factoid took 2105 ms. Reduced automaton from 14 states, 28 edges and 3 AP (stutter sensitive) to 13 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 569 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 341/341 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2025-06-02 19:06:13] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:06:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 19:06:13] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:06:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 19:06:13] [INFO ] Flow matrix only has 121 transitions (discarded 220 similar events)
[2025-06-02 19:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 1/215 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 100 constraints, problems are : Problem set: 0 solved, 324 unsolved in 11379 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 322/421 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 1/215 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 424 constraints, problems are : Problem set: 0 solved, 324 unsolved in 29117 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40531ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40534ms
Finished structural reductions in LTL mode , in 1 iterations and 40744 ms. Remains : 94/94 places, 341/341 transitions.
Computed a total of 94 stabilizing places and 341 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 341
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 p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 10 factoid took 614 ms. Reduced automaton from 13 states, 25 edges and 3 AP (stutter sensitive) to 13 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (2097 resets) in 247 ms. (161 steps per ms) remains 1/7 properties
BEST_FIRST walk for 37176 steps (422 resets) in 87 ms. (422 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F p1)]
Knowledge based reduction with 10 factoid took 1395 ms. Reduced automaton from 13 states, 25 edges and 3 AP (stutter sensitive) to 13 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 558 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 529 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 560 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 16721 reset in 219 ms.
Product exploration explored 100000 steps with 16613 reset in 218 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 549 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), false]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 341/341 transitions.
Graph (complete) has 507 edges and 94 vertex of which 93 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 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 93 transition count 340
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 12 place count 93 transition count 344
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 93 transition count 344
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 91 transition count 342
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 91 transition count 342
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 35 place count 91 transition count 342
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 79 transition count 330
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 79 transition count 330
Deduced a syphon composed of 16 places in 1 ms
Applied a total of 59 rules in 22 ms. Remains 79 /94 variables (removed 15) and now considering 330/341 (removed 11) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:07:00] [INFO ] Redundant transitions in 17 ms returned []
Running 313 sub problems to find dead transitions.
[2025-06-02 19:07:00] [INFO ] Flow matrix only has 108 transitions (discarded 222 similar events)
// Phase 1: matrix 108 rows 79 cols
[2025-06-02 19:07:00] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 4 (OVERLAPS) 108/186 variables, 78/84 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/84 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/85 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/85 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/85 constraints. Problems are: Problem set: 20 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 85 constraints, problems are : Problem set: 20 solved, 293 unsolved in 9668 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 17/78 variables, 6/6 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 108/186 variables, 78/84 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 291/375 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/375 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/376 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/378 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/378 constraints. Problems are: Problem set: 20 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/378 constraints. Problems are: Problem set: 20 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 378 constraints, problems are : Problem set: 20 solved, 293 unsolved in 19470 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 293/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29165ms problems are : Problem set: 20 solved, 293 unsolved
Search for dead transitions found 20 dead transitions in 29169ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/94 places, 310/341 transitions.
Graph (complete) has 490 edges and 79 vertex of which 63 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 63 /79 variables (removed 16) and now considering 310/310 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/94 places, 310/341 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29227 ms. Remains : 63/94 places, 310/341 transitions.
Built C files in :
/tmp/ltsmin18403069221691692866
[2025-06-02 19:07:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18403069221691692866
Running compilation step : cd /tmp/ltsmin18403069221691692866;'/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 626 ms.
Running link step : cd /tmp/ltsmin18403069221691692866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18403069221691692866;'/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/stateBased6462222956730110828.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-01 finished in 124038 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 1 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Graph (complete) has 1060 edges and 340 vertex of which 325 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 325 transition count 480
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 250 transition count 480
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 151 place count 250 transition count 445
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 221 place count 215 transition count 445
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 249 place count 187 transition count 417
Iterating global reduction 2 with 28 rules applied. Total rules applied 277 place count 187 transition count 417
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 290 place count 174 transition count 404
Iterating global reduction 2 with 13 rules applied. Total rules applied 303 place count 174 transition count 404
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 306 place count 171 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 306 place count 171 transition count 401
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 312 place count 168 transition count 401
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 315 place count 165 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 318 place count 165 transition count 398
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 321 place count 162 transition count 395
Iterating global reduction 3 with 3 rules applied. Total rules applied 324 place count 162 transition count 395
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 410 place count 119 transition count 352
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 429 place count 100 transition count 333
Iterating global reduction 3 with 19 rules applied. Total rules applied 448 place count 100 transition count 333
Applied a total of 448 rules in 42 ms. Remains 100 /340 variables (removed 240) and now considering 333/556 (removed 223) transitions.
[2025-06-02 19:07:30] [INFO ] Flow matrix only has 232 transitions (discarded 101 similar events)
// Phase 1: matrix 232 rows 100 cols
[2025-06-02 19:07:30] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:30] [INFO ] Implicit Places using invariants in 83 ms returned [2, 3, 8, 9, 14, 15, 20, 21, 34, 40, 41, 46, 50, 56, 57, 62, 63, 68, 72]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 85 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/340 places, 333/556 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 64 transition count 316
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 64 transition count 316
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 47 transition count 299
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 47 transition count 299
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 72 place count 45 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 43 transition count 295
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 43 transition count 295
Applied a total of 76 rules in 10 ms. Remains 43 /81 variables (removed 38) and now considering 295/333 (removed 38) transitions.
[2025-06-02 19:07:30] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-02 19:07:30] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 19:07:30] [INFO ] Flow matrix only has 42 transitions (discarded 253 similar events)
[2025-06-02 19:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/340 places, 295/556 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 43/340 places, 295/556 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-03
Product exploration explored 100000 steps with 11964 reset in 191 ms.
Product exploration explored 100000 steps with 11984 reset in 218 ms.
Computed a total of 43 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 295
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 15 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-S16C2-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-03 finished in 806 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(p0))'
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Graph (complete) has 1060 edges and 340 vertex of which 325 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 325 transition count 483
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 253 transition count 483
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 145 place count 253 transition count 444
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 223 place count 214 transition count 444
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 251 place count 186 transition count 416
Iterating global reduction 2 with 28 rules applied. Total rules applied 279 place count 186 transition count 416
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 292 place count 173 transition count 403
Iterating global reduction 2 with 13 rules applied. Total rules applied 305 place count 173 transition count 403
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 170 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 308 place count 170 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 314 place count 167 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 317 place count 164 transition count 397
Iterating global reduction 3 with 3 rules applied. Total rules applied 320 place count 164 transition count 397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 323 place count 161 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 326 place count 161 transition count 394
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 408 place count 120 transition count 353
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 427 place count 101 transition count 334
Iterating global reduction 3 with 19 rules applied. Total rules applied 446 place count 101 transition count 334
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 447 place count 100 transition count 333
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 100 transition count 333
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 99 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 451 place count 98 transition count 332
Applied a total of 451 rules in 40 ms. Remains 98 /340 variables (removed 242) and now considering 332/556 (removed 224) transitions.
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 231 transitions (discarded 101 similar events)
// Phase 1: matrix 231 rows 98 cols
[2025-06-02 19:07:31] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:31] [INFO ] Implicit Places using invariants in 75 ms returned [2, 8, 9, 14, 15, 20, 21, 33, 39, 40, 45, 49, 55, 56, 61, 62, 67, 71]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 76 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/340 places, 332/556 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 64 transition count 316
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 64 transition count 316
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 48 transition count 300
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 48 transition count 300
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 68 place count 46 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 44 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 44 transition count 296
Applied a total of 72 rules in 12 ms. Remains 44 /80 variables (removed 36) and now considering 296/332 (removed 36) transitions.
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 51 transitions (discarded 245 similar events)
// Phase 1: matrix 51 rows 44 cols
[2025-06-02 19:07:31] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 51 transitions (discarded 245 similar events)
[2025-06-02 19:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/340 places, 296/556 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 44/340 places, 296/556 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-05 finished in 301 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 U X(X(X((!p0||G(p1))))))))'
Support contains 3 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 326 transition count 556
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 60 place count 280 transition count 510
Iterating global reduction 1 with 46 rules applied. Total rules applied 106 place count 280 transition count 510
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 141 place count 245 transition count 475
Iterating global reduction 1 with 35 rules applied. Total rules applied 176 place count 245 transition count 475
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 179 place count 242 transition count 475
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 212 place count 209 transition count 442
Iterating global reduction 2 with 33 rules applied. Total rules applied 245 place count 209 transition count 442
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 262 place count 192 transition count 442
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 304 place count 150 transition count 400
Iterating global reduction 3 with 42 rules applied. Total rules applied 346 place count 150 transition count 400
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 368 place count 128 transition count 378
Iterating global reduction 3 with 22 rules applied. Total rules applied 390 place count 128 transition count 378
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 410 place count 108 transition count 358
Iterating global reduction 3 with 20 rules applied. Total rules applied 430 place count 108 transition count 358
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 450 place count 88 transition count 338
Iterating global reduction 3 with 20 rules applied. Total rules applied 470 place count 88 transition count 338
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 487 place count 71 transition count 321
Iterating global reduction 3 with 17 rules applied. Total rules applied 504 place count 71 transition count 321
Applied a total of 504 rules in 24 ms. Remains 71 /340 variables (removed 269) and now considering 321/556 (removed 235) transitions.
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 86 transitions (discarded 235 similar events)
// Phase 1: matrix 86 rows 71 cols
[2025-06-02 19:07:31] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 86 transitions (discarded 235 similar events)
[2025-06-02 19:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:31] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-02 19:07:31] [INFO ] Flow matrix only has 86 transitions (discarded 235 similar events)
[2025-06-02 19:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 86/157 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 75 constraints, problems are : Problem set: 0 solved, 304 unsolved in 6740 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 86/157 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 304/379 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 379 constraints, problems are : Problem set: 0 solved, 304 unsolved in 11760 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18528ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 18529ms
Starting structural reductions in LTL mode, iteration 1 : 71/340 places, 321/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18708 ms. Remains : 71/340 places, 321/556 transitions.
Stuttering acceptance computed with spot in 491 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 279 steps with 55 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-06 finished in 19220 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(p0)))))'
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 327 transition count 556
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 59 place count 281 transition count 510
Iterating global reduction 1 with 46 rules applied. Total rules applied 105 place count 281 transition count 510
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 140 place count 246 transition count 475
Iterating global reduction 1 with 35 rules applied. Total rules applied 175 place count 246 transition count 475
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 178 place count 243 transition count 475
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 211 place count 210 transition count 442
Iterating global reduction 2 with 33 rules applied. Total rules applied 244 place count 210 transition count 442
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 2 with 18 rules applied. Total rules applied 262 place count 192 transition count 442
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 304 place count 150 transition count 400
Iterating global reduction 3 with 42 rules applied. Total rules applied 346 place count 150 transition count 400
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 369 place count 127 transition count 377
Iterating global reduction 3 with 23 rules applied. Total rules applied 392 place count 127 transition count 377
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 413 place count 106 transition count 356
Iterating global reduction 3 with 21 rules applied. Total rules applied 434 place count 106 transition count 356
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 455 place count 85 transition count 335
Iterating global reduction 3 with 21 rules applied. Total rules applied 476 place count 85 transition count 335
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 494 place count 67 transition count 317
Iterating global reduction 3 with 18 rules applied. Total rules applied 512 place count 67 transition count 317
Applied a total of 512 rules in 23 ms. Remains 67 /340 variables (removed 273) and now considering 317/556 (removed 239) transitions.
[2025-06-02 19:07:50] [INFO ] Flow matrix only has 73 transitions (discarded 244 similar events)
// Phase 1: matrix 73 rows 67 cols
[2025-06-02 19:07:50] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 19:07:50] [INFO ] Flow matrix only has 73 transitions (discarded 244 similar events)
[2025-06-02 19:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:07:50] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 19:07:50] [INFO ] Flow matrix only has 73 transitions (discarded 244 similar events)
[2025-06-02 19:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 73/139 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 70 constraints, problems are : Problem set: 0 solved, 300 unsolved in 8190 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 73/139 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 298/367 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 370 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16797 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25009ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 25010ms
Starting structural reductions in LTL mode, iteration 1 : 67/340 places, 317/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25185 ms. Remains : 67/340 places, 317/556 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-09 finished in 25403 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(X(X(G(p0))))))))'
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 326 transition count 556
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 61 place count 279 transition count 509
Iterating global reduction 1 with 47 rules applied. Total rules applied 108 place count 279 transition count 509
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 144 place count 243 transition count 473
Iterating global reduction 1 with 36 rules applied. Total rules applied 180 place count 243 transition count 473
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 183 place count 240 transition count 473
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 217 place count 206 transition count 439
Iterating global reduction 2 with 34 rules applied. Total rules applied 251 place count 206 transition count 439
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 270 place count 187 transition count 439
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 313 place count 144 transition count 396
Iterating global reduction 3 with 43 rules applied. Total rules applied 356 place count 144 transition count 396
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 379 place count 121 transition count 373
Iterating global reduction 3 with 23 rules applied. Total rules applied 402 place count 121 transition count 373
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 424 place count 99 transition count 351
Iterating global reduction 3 with 22 rules applied. Total rules applied 446 place count 99 transition count 351
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 468 place count 77 transition count 329
Iterating global reduction 3 with 22 rules applied. Total rules applied 490 place count 77 transition count 329
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 509 place count 58 transition count 310
Iterating global reduction 3 with 19 rules applied. Total rules applied 528 place count 58 transition count 310
Applied a total of 528 rules in 24 ms. Remains 58 /340 variables (removed 282) and now considering 310/556 (removed 246) transitions.
[2025-06-02 19:08:15] [INFO ] Flow matrix only has 67 transitions (discarded 243 similar events)
// Phase 1: matrix 67 rows 58 cols
[2025-06-02 19:08:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 19:08:16] [INFO ] Flow matrix only has 67 transitions (discarded 243 similar events)
[2025-06-02 19:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:16] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2025-06-02 19:08:16] [INFO ] Flow matrix only has 67 transitions (discarded 243 similar events)
[2025-06-02 19:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 67/125 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 60 constraints, problems are : Problem set: 0 solved, 293 unsolved in 5879 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 67/125 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 353 constraints, problems are : Problem set: 0 solved, 293 unsolved in 8445 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14353ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 14354ms
Starting structural reductions in LTL mode, iteration 1 : 58/340 places, 310/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14519 ms. Remains : 58/340 places, 310/556 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-13 finished in 14809 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||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))'
Support contains 5 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 556/556 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 328 transition count 556
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 56 place count 284 transition count 512
Iterating global reduction 1 with 44 rules applied. Total rules applied 100 place count 284 transition count 512
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 133 place count 251 transition count 479
Iterating global reduction 1 with 33 rules applied. Total rules applied 166 place count 251 transition count 479
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 169 place count 248 transition count 479
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 200 place count 217 transition count 448
Iterating global reduction 2 with 31 rules applied. Total rules applied 231 place count 217 transition count 448
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 2 with 16 rules applied. Total rules applied 247 place count 201 transition count 448
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 286 place count 162 transition count 409
Iterating global reduction 3 with 39 rules applied. Total rules applied 325 place count 162 transition count 409
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 346 place count 141 transition count 388
Iterating global reduction 3 with 21 rules applied. Total rules applied 367 place count 141 transition count 388
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 385 place count 123 transition count 370
Iterating global reduction 3 with 18 rules applied. Total rules applied 403 place count 123 transition count 370
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 421 place count 105 transition count 352
Iterating global reduction 3 with 18 rules applied. Total rules applied 439 place count 105 transition count 352
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 454 place count 90 transition count 337
Iterating global reduction 3 with 15 rules applied. Total rules applied 469 place count 90 transition count 337
Applied a total of 469 rules in 20 ms. Remains 90 /340 variables (removed 250) and now considering 337/556 (removed 219) transitions.
[2025-06-02 19:08:30] [INFO ] Flow matrix only has 117 transitions (discarded 220 similar events)
// Phase 1: matrix 117 rows 90 cols
[2025-06-02 19:08:30] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 19:08:30] [INFO ] Flow matrix only has 117 transitions (discarded 220 similar events)
[2025-06-02 19:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:30] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-02 19:08:30] [INFO ] Flow matrix only has 117 transitions (discarded 220 similar events)
[2025-06-02 19:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 117/205 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 2/207 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 95 constraints, problems are : Problem set: 0 solved, 320 unsolved in 11556 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 117/205 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 317/410 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 2/207 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 415 constraints, problems are : Problem set: 0 solved, 320 unsolved in 27639 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39224ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 39225ms
Starting structural reductions in LTL mode, iteration 1 : 90/340 places, 337/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39452 ms. Remains : 90/340 places, 337/556 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-14 finished in 39627 ms.
All properties solved by simple procedures.
Total runtime 231185 ms.

BK_STOP 1748891350743

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-S16C2"
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-S16C2, 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-174876423200731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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