About the Execution of ITS-Tools for HirschbergSinclair-PT-30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1431091.00 | 0.00 | 0.00 | FFFFFFFFTFFTTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000100.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 HirschbergSinclair-PT-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K 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 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 357K 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 HirschbergSinclair-PT-30-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748780646390
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 12:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 12:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:24:07] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-01 12:24:07] [INFO ] Transformed 670 places.
[2025-06-01 12:24:08] [INFO ] Transformed 605 transitions.
[2025-06-01 12:24:08] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-30-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 640 transition count 605
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 55 place count 615 transition count 580
Iterating global reduction 1 with 25 rules applied. Total rules applied 80 place count 615 transition count 580
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 595 transition count 560
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 595 transition count 560
Applied a total of 120 rules in 174 ms. Remains 595 /670 variables (removed 75) and now considering 560/605 (removed 45) transitions.
// Phase 1: matrix 560 rows 595 cols
[2025-06-01 12:24:08] [INFO ] Computed 35 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:24:08] [INFO ] Implicit Places using invariants in 544 ms returned []
[2025-06-01 12:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:24:15] [INFO ] Implicit Places using invariants and state equation in 6961 ms returned []
Implicit Place search using SMT with State Equation took 7542 ms to find 0 implicit places.
Running 530 sub problems to find dead transitions.
[2025-06-01 12:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 30/595 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 560/1155 variables, 595/630 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/1155 variables, and 630 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 30/595 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 560/1155 variables, 595/630 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1155 variables, 530/1160 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/1155 variables, and 1160 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 595/670 places, 560/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67999 ms. Remains : 595/670 places, 560/605 transitions.
Support contains 50 out of 595 places after structural reductions.
[2025-06-01 12:25:16] [INFO ] Flatten gal took : 65 ms
[2025-06-01 12:25:16] [INFO ] Flatten gal took : 33 ms
[2025-06-01 12:25:16] [INFO ] Input system was already deterministic with 560 transitions.
Support contains 48 out of 595 places (down from 50) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (64 resets) in 1615 ms. (24 steps per ms) remains 4/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
[2025-06-01 12:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 491/507 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/532 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 5 (OVERLAPS) 560/1092 variables, 532/567 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/1155 variables, 63/630 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1155 variables, 0/630 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1155 variables, 0/630 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1155/1155 variables, and 630 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1548 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 481/492 variables, 30/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/532 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 560/1092 variables, 532/567 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/1155 variables, 63/630 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1155 variables, 2/632 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1155 variables, 0/632 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1155 variables, 0/632 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1155/1155 variables, and 632 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2169 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3734ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 530 ms.
Support contains 11 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 560/560 transitions.
Graph (complete) has 1119 edges and 595 vertex of which 590 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 590 transition count 353
Reduce places removed 202 places and 0 transitions.
Graph (complete) has 680 edges and 388 vertex of which 346 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 203 rules applied. Total rules applied 411 place count 346 transition count 353
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 453 place count 346 transition count 311
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 460 place count 339 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 467 place count 339 transition count 304
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 470 place count 339 transition count 301
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 584 edges and 336 vertex of which 331 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 474 place count 331 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 479 place count 331 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 482 place count 328 transition count 293
Iterating global reduction 6 with 3 rules applied. Total rules applied 485 place count 328 transition count 293
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 486 place count 327 transition count 292
Iterating global reduction 6 with 1 rules applied. Total rules applied 487 place count 327 transition count 292
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 510 place count 327 transition count 269
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 533 place count 304 transition count 269
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 556 place count 281 transition count 246
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 7 with 36 rules applied. Total rules applied 592 place count 276 transition count 215
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 623 place count 245 transition count 215
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 623 place count 245 transition count 201
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 651 place count 231 transition count 201
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 652 place count 230 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 652 place count 230 transition count 200
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 654 place count 229 transition count 200
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 660 place count 226 transition count 197
Applied a total of 660 rules in 136 ms. Remains 226 /595 variables (removed 369) and now considering 197/560 (removed 363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 226/595 places, 197/560 transitions.
RANDOM walk for 40000 steps (190 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 99 ms. (400 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3597 steps (0 resets) in 9 ms. (359 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-30-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 595 stabilizing places and 560 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 595 transition count 560
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (G(F(p1)) U p2)) U X(X(X(p3)))))'
Support contains 7 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 586 transition count 551
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 586 transition count 551
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 581 transition count 546
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 581 transition count 546
Applied a total of 28 rules in 56 ms. Remains 581 /595 variables (removed 14) and now considering 546/560 (removed 14) transitions.
// Phase 1: matrix 546 rows 581 cols
[2025-06-01 12:25:22] [INFO ] Computed 35 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:25:22] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-01 12:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:25:29] [INFO ] Implicit Places using invariants and state equation in 7311 ms returned []
Implicit Place search using SMT with State Equation took 7587 ms to find 0 implicit places.
Running 516 sub problems to find dead transitions.
[2025-06-01 12:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 616 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1127 variables, 516/1132 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 1132 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 581/595 places, 546/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67776 ms. Remains : 581/595 places, 546/560 transitions.
Stuttering acceptance computed with spot in 1104 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-00
Product exploration explored 100000 steps with 305 reset in 436 ms.
Product exploration explored 100000 steps with 305 reset in 376 ms.
Computed a total of 581 stabilizing places and 546 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 581 transition count 546
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 231 ms. Reduced automaton from 20 states, 44 edges and 4 AP (stutter sensitive) to 15 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 737 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 1364 steps (0 resets) in 63 ms. (21 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F p3), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 694 ms. Reduced automaton from 15 states, 33 edges and 4 AP (stutter sensitive) to 15 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 776 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 747 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
[2025-06-01 12:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:26:36] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 1242 ms returned sat
[2025-06-01 12:26:50] [INFO ] [Real]Absence check using state equation in 13503 ms returned unknown
Could not prove EG (NOT p3)
Support contains 7 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 546/546 transitions.
Applied a total of 0 rules in 21 ms. Remains 581 /581 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2025-06-01 12:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:26:50] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-01 12:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:26:58] [INFO ] Implicit Places using invariants and state equation in 7290 ms returned []
Implicit Place search using SMT with State Equation took 7556 ms to find 0 implicit places.
Running 516 sub problems to find dead transitions.
[2025-06-01 12:26:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 616 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1127 variables, 516/1132 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 1132 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in LTL mode , in 1 iterations and 67687 ms. Remains : 581/581 places, 546/546 transitions.
Computed a total of 581 stabilizing places and 546 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 581 transition count 546
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 15 states, 33 edges and 4 AP (stutter sensitive) to 15 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 768 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 1358 steps (0 resets) in 23 ms. (56 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F (NOT (AND (NOT p3) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p0), (F (NOT (OR p2 p3 (NOT p0))))]
Knowledge based reduction with 5 factoid took 677 ms. Reduced automaton from 15 states, 33 edges and 4 AP (stutter sensitive) to 15 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 768 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 732 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
[2025-06-01 12:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:28:03] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 1246 ms returned sat
[2025-06-01 12:28:16] [INFO ] [Real]Absence check using state equation in 13492 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 739 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 357 reset in 317 ms.
Product exploration explored 100000 steps with 346 reset in 353 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 751 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Support contains 7 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 546/546 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 581 transition count 546
Deduced a syphon composed of 211 places in 1 ms
Applied a total of 211 rules in 71 ms. Remains 581 /581 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:28:19] [INFO ] Redundant transitions in 32 ms returned []
Running 516 sub problems to find dead transitions.
// Phase 1: matrix 546 rows 581 cols
[2025-06-01 12:28:19] [INFO ] Computed 35 invariants in 9 ms
[2025-06-01 12:28:19] [INFO ] State equation strengthened by 211 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 211 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1127 variables, 211/827 constraints. Problems are: Problem set: 211 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 827 constraints, problems are : Problem set: 211 solved, 305 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 211 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 211 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 241/581 variables, 35/35 constraints. Problems are: Problem set: 211 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 211 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 211 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1127 variables, 211/827 constraints. Problems are: Problem set: 211 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 1132 constraints, problems are : Problem set: 211 solved, 305 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 305/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 211 solved, 305 unsolved
Search for dead transitions found 211 dead transitions in 60108ms
Found 211 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 211 transitions
Dead transitions reduction (with SMT) removed 211 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 581/581 places, 335/546 transitions.
Graph (complete) has 890 edges and 581 vertex of which 370 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.2 ms
Discarding 211 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 370 /581 variables (removed 211) and now considering 335/335 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 370/581 places, 335/546 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60242 ms. Remains : 370/581 places, 335/546 transitions.
Built C files in :
/tmp/ltsmin8673581676899440622
[2025-06-01 12:29:19] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8673581676899440622
Running compilation step : cd /tmp/ltsmin8673581676899440622;'/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 989 ms.
Running link step : cd /tmp/ltsmin8673581676899440622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin8673581676899440622;'/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/stateBased334191775830339679.hoa' '--buchi-type=spotba'
LTSmin run took 689 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-30-LTLFireability-00 finished in 238793 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) U G(p1))&&X(F(p2))))'
Support contains 5 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 585 transition count 550
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 585 transition count 550
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 580 transition count 545
Applied a total of 30 rules in 40 ms. Remains 580 /595 variables (removed 15) and now considering 545/560 (removed 15) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:29:21] [INFO ] Computed 35 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:29:21] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-01 12:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:29:29] [INFO ] Implicit Places using invariants and state equation in 8049 ms returned []
Implicit Place search using SMT with State Equation took 8327 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 545/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68489 ms. Remains : 580/595 places, 545/560 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-01
Product exploration explored 100000 steps with 373 reset in 336 ms.
Product exploration explored 100000 steps with 372 reset in 360 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 216 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), false, false, false, false, false, false]
RANDOM walk for 40000 steps (64 resets) in 276 ms. (144 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
[2025-06-01 12:30:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 501/506 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/506 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/523 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 1068/1125 variables, and 558 constraints, problems are : Problem set: 4 solved, 0 unsolved in 472 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 523/580 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p0), (F p1)]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 16 factoid took 159 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-01 finished in 71164 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 28 places and 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 567 transition count 302
Reduce places removed 230 places and 0 transitions.
Iterating post reduction 1 with 230 rules applied. Total rules applied 460 place count 337 transition count 302
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 469 place count 328 transition count 293
Iterating global reduction 2 with 9 rules applied. Total rules applied 478 place count 328 transition count 293
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 483 place count 328 transition count 288
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 488 place count 323 transition count 288
Applied a total of 488 rules in 38 ms. Remains 323 /595 variables (removed 272) and now considering 288/560 (removed 272) transitions.
// Phase 1: matrix 288 rows 323 cols
[2025-06-01 12:30:32] [INFO ] Computed 35 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:30:32] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-01 12:30:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:30:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 12:30:35] [INFO ] Implicit Places using invariants and state equation in 3090 ms returned []
Implicit Place search using SMT with State Equation took 3396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:30:35] [INFO ] Redundant transitions in 5 ms returned []
Running 233 sub problems to find dead transitions.
[2025-06-01 12:30:35] [INFO ] Invariant cache hit.
[2025-06-01 12:30:35] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 4/272 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/611 variables, and 315 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 4/272 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 237/509 variables, 272/307 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 233/548 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/611 variables, and 548 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 272/323 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/595 places, 288/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63496 ms. Remains : 323/595 places, 288/560 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-02
Stuttering criterion allowed to conclude after 318 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-02 finished in 63651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p1))))'
Support contains 5 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 585 transition count 550
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 585 transition count 550
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 580 transition count 545
Applied a total of 30 rules in 43 ms. Remains 580 /595 variables (removed 15) and now considering 545/560 (removed 15) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:31:35] [INFO ] Computed 35 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:31:36] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-01 12:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:31:44] [INFO ] Implicit Places using invariants and state equation in 8064 ms returned []
Implicit Place search using SMT with State Equation took 8326 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 545/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68488 ms. Remains : 580/595 places, 545/560 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1, true]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-03
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-03 finished in 68589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 585 transition count 550
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 585 transition count 550
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 580 transition count 545
Applied a total of 30 rules in 43 ms. Remains 580 /595 variables (removed 15) and now considering 545/560 (removed 15) transitions.
[2025-06-01 12:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:32:44] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-01 12:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:32:52] [INFO ] Implicit Places using invariants and state equation in 8003 ms returned []
Implicit Place search using SMT with State Equation took 8279 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:32:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 545/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68442 ms. Remains : 580/595 places, 545/560 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-06 finished in 68565 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' '!((((G(p0)&&(p1||F(!p2))) U X(p3)) U p4))'
Support contains 7 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 590 transition count 555
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 590 transition count 555
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 588 transition count 553
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 588 transition count 553
Applied a total of 14 rules in 46 ms. Remains 588 /595 variables (removed 7) and now considering 553/560 (removed 7) transitions.
// Phase 1: matrix 553 rows 588 cols
[2025-06-01 12:33:53] [INFO ] Computed 35 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:33:53] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-01 12:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:34:01] [INFO ] Implicit Places using invariants and state equation in 8128 ms returned []
Implicit Place search using SMT with State Equation took 8387 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2025-06-01 12:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (OVERLAPS) 30/588 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 553/1141 variables, 588/623 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1141/1141 variables, and 623 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (OVERLAPS) 30/588 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 553/1141 variables, 588/623 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1141 variables, 523/1146 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1141/1141 variables, and 1146 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 588/595 places, 553/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68554 ms. Remains : 588/595 places, 553/560 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p4), (NOT p3), (NOT p3), (AND p2 (NOT p3)), true, (NOT p0), p2]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-07 finished in 68859 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 1 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 565 transition count 291
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 326 transition count 291
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 488 place count 316 transition count 281
Iterating global reduction 2 with 10 rules applied. Total rules applied 498 place count 316 transition count 281
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 503 place count 316 transition count 276
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 508 place count 311 transition count 276
Applied a total of 508 rules in 31 ms. Remains 311 /595 variables (removed 284) and now considering 276/560 (removed 284) transitions.
// Phase 1: matrix 276 rows 311 cols
[2025-06-01 12:35:01] [INFO ] Computed 35 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:35:02] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-06-01 12:35:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:35:05] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:35:05] [INFO ] Redundant transitions in 1 ms returned []
Running 217 sub problems to find dead transitions.
[2025-06-01 12:35:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19966 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49992ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 49992ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/595 places, 276/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53503 ms. Remains : 311/595 places, 276/560 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-08
Product exploration explored 100000 steps with 598 reset in 270 ms.
Product exploration explored 100000 steps with 599 reset in 291 ms.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 716 steps (0 resets) in 12 ms. (55 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2025-06-01 12:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:35:56] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 300 ms returned sat
[2025-06-01 12:36:03] [INFO ] [Real]Absence check using state equation in 6266 ms returned sat
[2025-06-01 12:36:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:36:03] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 92 ms returned sat
[2025-06-01 12:36:03] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-01 12:36:03] [INFO ] Computed and/alt/rep : 217/223/217 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-01 12:36:04] [INFO ] Added : 101 causal constraints over 21 iterations in 570 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 12:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:36:04] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-01 12:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:36:07] [INFO ] Implicit Places using invariants and state equation in 3195 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:36:07] [INFO ] Redundant transitions in 1 ms returned []
Running 217 sub problems to find dead transitions.
[2025-06-01 12:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20157 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50196ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50196ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53704 ms. Remains : 311/311 places, 276/276 transitions.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 716 steps (0 resets) in 9 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2025-06-01 12:36:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:36:58] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 300 ms returned sat
[2025-06-01 12:37:04] [INFO ] [Real]Absence check using state equation in 6220 ms returned sat
[2025-06-01 12:37:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:37:05] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 97 ms returned sat
[2025-06-01 12:37:05] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-06-01 12:37:05] [INFO ] Computed and/alt/rep : 217/223/217 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-01 12:37:05] [INFO ] Added : 101 causal constraints over 21 iterations in 548 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 598 reset in 276 ms.
Product exploration explored 100000 steps with 598 reset in 296 ms.
Built C files in :
/tmp/ltsmin16103808780931075617
[2025-06-01 12:37:06] [INFO ] Computing symmetric may disable matrix : 276 transitions.
[2025-06-01 12:37:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:37:06] [INFO ] Computing symmetric may enable matrix : 276 transitions.
[2025-06-01 12:37:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:37:06] [INFO ] Computing Do-Not-Accords matrix : 276 transitions.
[2025-06-01 12:37:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:37:06] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16103808780931075617
Running compilation step : cd /tmp/ltsmin16103808780931075617;'/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 558 ms.
Running link step : cd /tmp/ltsmin16103808780931075617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16103808780931075617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7473480679148147155.hoa' '--buchi-type=spotba'
LTSmin run took 923 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-30-LTLFireability-08 finished in 126174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(X(F(p1))))))))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 585 transition count 550
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 585 transition count 550
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 580 transition count 545
Applied a total of 30 rules in 44 ms. Remains 580 /595 variables (removed 15) and now considering 545/560 (removed 15) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:37:08] [INFO ] Computed 35 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:37:08] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-01 12:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:37:16] [INFO ] Implicit Places using invariants and state equation in 7988 ms returned []
Implicit Place search using SMT with State Equation took 8284 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:37: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/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 545/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68431 ms. Remains : 580/595 places, 545/560 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-09
Product exploration explored 100000 steps with 369 reset in 281 ms.
Product exploration explored 100000 steps with 367 reset in 314 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1936 steps (0 resets) in 20 ms. (92 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 12:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:38:19] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 972 ms returned sat
[2025-06-01 12:38:33] [INFO ] [Real]Absence check using state equation in 13785 ms returned unknown
Could not prove EG (NOT p0)
[2025-06-01 12:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:38:35] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 1055 ms returned sat
[2025-06-01 12:38:38] [INFO ] [Real]Absence check using state equation in 3793 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-09 finished in 91051 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)&&F(p1)))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 565 transition count 293
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 328 transition count 293
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 484 place count 318 transition count 283
Iterating global reduction 2 with 10 rules applied. Total rules applied 494 place count 318 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 499 place count 318 transition count 278
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 504 place count 313 transition count 278
Applied a total of 504 rules in 30 ms. Remains 313 /595 variables (removed 282) and now considering 278/560 (removed 282) transitions.
// Phase 1: matrix 278 rows 313 cols
[2025-06-01 12:38:39] [INFO ] Computed 35 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:38:39] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-06-01 12:38:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:38:42] [INFO ] Implicit Places using invariants and state equation in 2706 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:38:42] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 221/477 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/591 variables, and 291 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20547 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 256/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 221/477 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 219/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/591 variables, and 510 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 256/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50578ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 50579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/595 places, 278/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53612 ms. Remains : 313/595 places, 278/560 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-10
Product exploration explored 100000 steps with 434 reset in 242 ms.
Product exploration explored 100000 steps with 434 reset in 271 ms.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 985 steps (0 resets) in 12 ms. (75 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
[2025-06-01 12:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:39:34] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 104 ms returned sat
[2025-06-01 12:39:49] [INFO ] [Real]Absence check using state equation in 14764 ms returned unknown
Could not prove EG (NOT p0)
[2025-06-01 12:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:39:49] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 238 ms returned sat
[2025-06-01 12:39:50] [INFO ] [Real]Absence check using state equation in 451 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 13 factoid took 576 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-10 finished in 71836 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' '!(G(F(p0)))'
Support contains 1 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 566 transition count 291
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 326 transition count 291
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 490 place count 316 transition count 281
Iterating global reduction 2 with 10 rules applied. Total rules applied 500 place count 316 transition count 281
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 505 place count 316 transition count 276
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 510 place count 311 transition count 276
Applied a total of 510 rules in 32 ms. Remains 311 /595 variables (removed 284) and now considering 276/560 (removed 284) transitions.
// Phase 1: matrix 276 rows 311 cols
[2025-06-01 12:39:50] [INFO ] Computed 35 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:39:51] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-01 12:39:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:39:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 12:39:55] [INFO ] Implicit Places using invariants and state equation in 4674 ms returned []
Implicit Place search using SMT with State Equation took 4974 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:39:55] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-01 12:39:55] [INFO ] Invariant cache hit.
[2025-06-01 12:39:55] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/595 places, 276/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65052 ms. Remains : 311/595 places, 276/560 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-11
Product exploration explored 100000 steps with 2450 reset in 418 ms.
Product exploration explored 100000 steps with 2499 reset in 451 ms.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-11 finished in 66157 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((X(F((p1&&F(p2))))||p0))))'
Support contains 6 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 27 places and 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 568 transition count 315
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 350 transition count 315
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 444 place count 342 transition count 307
Iterating global reduction 2 with 8 rules applied. Total rules applied 452 place count 342 transition count 307
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 455 place count 342 transition count 304
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 458 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 459 place count 338 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 338 transition count 303
Applied a total of 460 rules in 37 ms. Remains 338 /595 variables (removed 257) and now considering 303/560 (removed 257) transitions.
// Phase 1: matrix 303 rows 338 cols
[2025-06-01 12:40:57] [INFO ] Computed 35 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:40:57] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-01 12:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:41:00] [INFO ] Implicit Places using invariants and state equation in 3542 ms returned []
Implicit Place search using SMT with State Equation took 3849 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:41:00] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-01 12:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 5/293 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 258/551 variables, 293/328 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/641 variables, and 328 constraints, problems are : Problem set: 0 solved, 253 unsolved in 26371 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 293/338 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 5/293 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 258/551 variables, 293/328 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 253/581 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/641 variables, and 581 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 293/338 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56406ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 56407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 338/595 places, 303/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60303 ms. Remains : 338/595 places, 303/560 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-12
Product exploration explored 100000 steps with 464 reset in 315 ms.
Product exploration explored 100000 steps with 446 reset in 323 ms.
Computed a total of 338 stabilizing places and 303 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 338 transition count 303
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 17 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-30-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-12 finished in 61221 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)||G(p1))))&&G((p2||X(X(G(p3)))))))'
Support contains 7 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 587 transition count 552
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 587 transition count 552
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 582 transition count 547
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 582 transition count 547
Applied a total of 26 rules in 38 ms. Remains 582 /595 variables (removed 13) and now considering 547/560 (removed 13) transitions.
// Phase 1: matrix 547 rows 582 cols
[2025-06-01 12:41:58] [INFO ] Computed 35 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:41:58] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-01 12:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:42:06] [INFO ] Implicit Places using invariants and state equation in 7598 ms returned []
Implicit Place search using SMT with State Equation took 7868 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2025-06-01 12:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 30/582 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 547/1129 variables, 582/617 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1129/1129 variables, and 617 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 30/582 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 547/1129 variables, 582/617 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1129 variables, 517/1134 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1129/1129 variables, and 1134 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 582/595 places, 547/560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68027 ms. Remains : 582/595 places, 547/560 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p3), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-14
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-14 finished in 68454 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&&G(p1))))'
Support contains 2 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 560/560 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 565 transition count 292
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 327 transition count 292
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 485 place count 318 transition count 283
Iterating global reduction 2 with 9 rules applied. Total rules applied 494 place count 318 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 499 place count 318 transition count 278
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 504 place count 313 transition count 278
Applied a total of 504 rules in 25 ms. Remains 313 /595 variables (removed 282) and now considering 278/560 (removed 282) transitions.
// Phase 1: matrix 278 rows 313 cols
[2025-06-01 12:43:06] [INFO ] Computed 35 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:07] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-01 12:43:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:10] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3493 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:43:10] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/479 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/591 variables, and 292 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27392 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 219/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/591 variables, and 511 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57422ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/595 places, 278/560 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60948 ms. Remains : 313/595 places, 278/560 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-15
Product exploration explored 100000 steps with 326 reset in 229 ms.
Product exploration explored 100000 steps with 326 reset in 240 ms.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 879 steps (0 resets) in 13 ms. (62 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 358 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2025-06-01 12:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:44:09] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 282 ms returned sat
[2025-06-01 12:44:18] [INFO ] [Real]Absence check using state equation in 9244 ms returned sat
[2025-06-01 12:44:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:44:19] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 86 ms returned sat
[2025-06-01 12:44:19] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-01 12:44:19] [INFO ] Computed and/alt/rep : 219/225/219 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-01 12:44:19] [INFO ] Added : 122 causal constraints over 25 iterations in 664 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 13 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-01 12:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:44:20] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-01 12:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:44:23] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:44:23] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/479 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/591 variables, and 292 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27492 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 219/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/591 variables, and 511 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57514ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57514ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60978 ms. Remains : 313/313 places, 278/278 transitions.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 877 steps (0 resets) in 15 ms. (54 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2025-06-01 12:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:45:22] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 285 ms returned sat
[2025-06-01 12:45:31] [INFO ] [Real]Absence check using state equation in 9332 ms returned sat
[2025-06-01 12:45:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:45:31] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 85 ms returned sat
[2025-06-01 12:45:31] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-01 12:45:31] [INFO ] Computed and/alt/rep : 219/225/219 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-01 12:45:32] [INFO ] Added : 122 causal constraints over 25 iterations in 643 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 326 reset in 220 ms.
Product exploration explored 100000 steps with 326 reset in 234 ms.
Built C files in :
/tmp/ltsmin13927361388863266648
[2025-06-01 12:45:33] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-01 12:45:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:45:33] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-01 12:45:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:45:33] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-01 12:45:33] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:45:33] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927361388863266648
Running compilation step : cd /tmp/ltsmin13927361388863266648;'/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 541 ms.
Running link step : cd /tmp/ltsmin13927361388863266648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13927361388863266648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14362187206096670416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 17 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-01 12:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:48] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-01 12:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:51] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:45:51] [INFO ] Redundant transitions in 0 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/479 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/591 variables, and 292 constraints, problems are : Problem set: 0 solved, 219 unsolved in 26982 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 219/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/591 variables, and 511 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57007ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57008ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60452 ms. Remains : 313/313 places, 278/278 transitions.
Built C files in :
/tmp/ltsmin9491913074083489857
[2025-06-01 12:46:48] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-01 12:46:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:46:48] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-01 12:46:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:46:48] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-01 12:46:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:46:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491913074083489857
Running compilation step : cd /tmp/ltsmin9491913074083489857;'/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 554 ms.
Running link step : cd /tmp/ltsmin9491913074083489857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9491913074083489857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6779672574516259250.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:47:03] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:47:03] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:47:03] [INFO ] Time to serialize gal into /tmp/LTL16360549760663902081.gal : 3 ms
[2025-06-01 12:47:03] [INFO ] Time to serialize properties into /tmp/LTL1445317401847397467.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16360549760663902081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4008517821895928939.hoa' '-atoms' '/tmp/LTL1445317401847397467.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1445317401847397467.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4008517821895928939.hoa
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t38.t39, t42.t43, t46.t47, t50.t51, t56.t57, t60.t61, t66.t67, t70.t71, t74.t75, t78...457
Computing Next relation with stutter on 8.04663e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:47:19] [INFO ] Flatten gal took : 11 ms
[2025-06-01 12:47:19] [INFO ] Flatten gal took : 10 ms
[2025-06-01 12:47:19] [INFO ] Time to serialize gal into /tmp/LTL17016660527829384107.gal : 3 ms
[2025-06-01 12:47:19] [INFO ] Time to serialize properties into /tmp/LTL16037368778620436977.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17016660527829384107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16037368778620436977.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(rcv_right_reply_30_4_5>=1)")&&(G("(rcv_left_reply_28_0_28<1)")))))
Formula 0 simplified : G(!"(rcv_right_reply_30_4_5>=1)" | F!"(rcv_left_reply_28_0_28<1)")
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t38.t39, t42.t43, t46.t47, t50.t51, t56.t57, t60.t61, t66.t67, t70.t71, t74.t75, t78...457
Computing Next relation with stutter on 8.04663e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:47:34] [INFO ] Flatten gal took : 10 ms
[2025-06-01 12:47:34] [INFO ] Applying decomposition
[2025-06-01 12:47:34] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4667253375741660411.txt' '-o' '/tmp/graph4667253375741660411.bin' '-w' '/tmp/graph4667253375741660411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4667253375741660411.bin' '-l' '-1' '-v' '-w' '/tmp/graph4667253375741660411.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:47:34] [INFO ] Decomposing Gal with order
[2025-06-01 12:47:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:47:34] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-01 12:47:34] [INFO ] Flatten gal took : 58 ms
[2025-06-01 12:47:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 10 ms.
[2025-06-01 12:47:34] [INFO ] Time to serialize gal into /tmp/LTL11030536752488863780.gal : 5 ms
[2025-06-01 12:47:34] [INFO ] Time to serialize properties into /tmp/LTL4346536141017606690.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11030536752488863780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4346536141017606690.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i6.i0.u0.rcv_right_reply_30_4_5>=1)")&&(G("(i3.i1.u31.rcv_left_reply_28_0_28<1)")))))
Formula 0 simplified : G(!"(i6.i0.u0.rcv_right_reply_30_4_5>=1)" | F!"(i3.i1.u31.rcv_left_reply_28_0_28<1)")
Reverse transition relation is NOT exact ! Due to transitions t42_t43, t66_t67, t88_t89, t110_t111, t119_t120, t218_t219, t238_t239, t528_t529, i1.t115_t11...538
Computing Next relation with stutter on 8.04663e+21 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLFireability-15 finished in 282634 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&&G(p1))))'
[2025-06-01 12:47:49] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13220649991806746418
[2025-06-01 12:47:49] [INFO ] Computing symmetric may disable matrix : 560 transitions.
[2025-06-01 12:47:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:49] [INFO ] Computing symmetric may enable matrix : 560 transitions.
[2025-06-01 12:47:49] [INFO ] Applying decomposition
[2025-06-01 12:47:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:49] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6576003503898053782.txt' '-o' '/tmp/graph6576003503898053782.bin' '-w' '/tmp/graph6576003503898053782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6576003503898053782.bin' '-l' '-1' '-v' '-w' '/tmp/graph6576003503898053782.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:47:49] [INFO ] Decomposing Gal with order
[2025-06-01 12:47:49] [INFO ] Computing Do-Not-Accords matrix : 560 transitions.
[2025-06-01 12:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:47:49] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:49] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13220649991806746418
Running compilation step : cd /tmp/ltsmin13220649991806746418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-01 12:47:49] [INFO ] Removed a total of 56 redundant transitions.
[2025-06-01 12:47:49] [INFO ] Flatten gal took : 40 ms
[2025-06-01 12:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-01 12:47:49] [INFO ] Time to serialize gal into /tmp/LTLFireability9662859480111532037.gal : 12 ms
[2025-06-01 12:47:49] [INFO ] Time to serialize properties into /tmp/LTLFireability16070922327543467569.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9662859480111532037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16070922327543467569.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(i1.u3.rcv_right_reply_30_4_5>=1)")&&(G("(i7.u24.rcv_left_reply_28_0_28<1)")))))
Formula 0 simplified : G(!"(i1.u3.rcv_right_reply_30_4_5>=1)" | F!"(i7.u24.rcv_left_reply_28_0_28<1)")
Compilation finished in 1281 ms.
Running link step : cd /tmp/ltsmin13220649991806746418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13220649991806746418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 6154 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1429336 ms.
BK_STOP 1748782077481
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="HirschbergSinclair-PT-30"
export BK_EXAMINATION="LTLFireability"
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 HirschbergSinclair-PT-30, examination is LTLFireability"
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-174876422000100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-30.tgz
mv HirschbergSinclair-PT-30 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;