Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200228.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 MedleyA-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 175K 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 MedleyA-PT-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748875107849

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 14:38:30] [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-02 14:38:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:38:31] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2025-06-02 14:38:31] [INFO ] Transformed 248 places.
[2025-06-02 14:38:31] [INFO ] Transformed 591 transitions.
[2025-06-02 14:38:31] [INFO ] Found NUPN structural information;
[2025-06-02 14:38:31] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 197 transition count 505
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 197 transition count 505
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 136 place count 197 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 196 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 196 transition count 469
Applied a total of 138 rules in 122 ms. Remains 196 /248 variables (removed 52) and now considering 469/589 (removed 120) transitions.
// Phase 1: matrix 469 rows 196 cols
[2025-06-02 14:38:31] [INFO ] Computed 7 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:38:32] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-06-02 14:38:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:38:33] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2025-06-02 14:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:44] [INFO ] Deduced a trap composed of 15 places in 370 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:44] [INFO ] Deduced a trap composed of 15 places in 347 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:44] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:45] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:45] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:45] [INFO ] Deduced a trap composed of 116 places in 234 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:45] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:46] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:46] [INFO ] Deduced a trap composed of 92 places in 311 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:46] [INFO ] Deduced a trap composed of 116 places in 240 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:47] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:47] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:47] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:47] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:48] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:49] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:50] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:50] [INFO ] Deduced a trap composed of 96 places in 308 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:50] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:50] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:51] [INFO ] Deduced a trap composed of 96 places in 234 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:52] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:53] [INFO ] Deduced a trap composed of 34 places in 292 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:53] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:54] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:54] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:54] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:55] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:55] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:56] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:56] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:57] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:58] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:59] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:38:59] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:02] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:03] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:03] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:03] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:03] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/665 variables, and 47 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/196 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:08] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:08] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:08] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:09] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:13] [INFO ] Deduced a trap composed of 120 places in 369 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:14] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:14] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:14] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:15] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:19] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:23] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:30] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/665 variables, and 59 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/196 constraints, PredecessorRefiner: 0/468 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60867ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Starting structural reductions in LTL mode, iteration 1 : 196/248 places, 469/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62432 ms. Remains : 196/248 places, 469/589 transitions.
Support contains 43 out of 196 places after structural reductions.
[2025-06-02 14:39:34] [INFO ] Flatten gal took : 170 ms
[2025-06-02 14:39:34] [INFO ] Flatten gal took : 98 ms
[2025-06-02 14:39:34] [INFO ] Input system was already deterministic with 469 transitions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 40000 steps (1376 resets) in 2206 ms. (18 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (29 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (29 resets) in 81 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (28 resets) in 60 ms. (65 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (28 resets) in 67 ms. (58 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (29 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (27 resets) in 46 ms. (85 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (29 resets) in 60 ms. (65 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (29 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 58 ms. (67 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (29 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (28 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (29 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (28 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (28 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (28 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (28 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (29 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 495460 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :16 out of 25
Probabilistic random walk after 495460 steps, saw 90607 distinct states, run finished after 3008 ms. (steps per millisecond=164 ) properties seen :16
[2025-06-02 14:39:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/196 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:39] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:39] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:39] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:39] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 469/665 variables, 196/207 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/665 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 207 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 171/196 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:41] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 469/665 variables, 196/208 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 6/214 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:39:42] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 1/215 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/215 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/665 variables, 0/215 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 215 constraints, problems are : Problem set: 3 solved, 6 unsolved in 4895 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6559ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 23520 ms.
Support contains 20 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 469/469 transitions.
Graph (trivial) has 139 edges and 196 vertex of which 6 / 196 are part of one of the 2 SCC in 11 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 436
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 165 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 163 transition count 434
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 59 place count 163 transition count 422
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 83 place count 151 transition count 422
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 145 transition count 410
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 145 transition count 410
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 141 place count 122 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 121 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 121 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 117 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 163 place count 117 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 171 place count 113 transition count 367
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 187 place count 105 transition count 423
Free-agglomeration rule applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 212 place count 105 transition count 398
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 243 place count 80 transition count 392
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 248 place count 80 transition count 414
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 257 place count 75 transition count 410
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 75 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 74 transition count 409
Applied a total of 259 rules in 229 ms. Remains 74 /196 variables (removed 122) and now considering 409/469 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 74/196 places, 409/469 transitions.
RANDOM walk for 40000 steps (7696 resets) in 231 ms. (172 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (2244 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2276 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (83 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (2581 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
[2025-06-02 14:40:09] [INFO ] Flow matrix only has 362 transitions (discarded 47 similar events)
// Phase 1: matrix 362 rows 74 cols
[2025-06-02 14:40:09] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 14:40:09] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 56/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:09] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:09] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:10] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:10] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:10] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:10] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 362/436 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 124 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 56/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 362/436 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:14] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:14] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/436 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 131 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4905 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6219ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 11630 ms.
Support contains 18 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 409/409 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 408
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 73 transition count 568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 72 transition count 568
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 72 transition count 567
Applied a total of 5 rules in 60 ms. Remains 72 /74 variables (removed 2) and now considering 567/409 (removed -158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 72/74 places, 567/409 transitions.
RANDOM walk for 40000 steps (9020 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3159 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3127 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (70 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3804 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 155475 steps, run visited all 5 properties in 603 ms. (steps per millisecond=257 )
Probabilistic random walk after 155475 steps, saw 33217 distinct states, run finished after 610 ms. (steps per millisecond=254 ) properties seen :5
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA MedleyA-PT-17-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 15 stable transitions
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(p0)) U (F(!p0)&&(!p2||X(p2))&&p1)))'
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 191 transition count 460
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 190 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 190 transition count 458
Applied a total of 12 rules in 17 ms. Remains 190 /196 variables (removed 6) and now considering 458/469 (removed 11) transitions.
// Phase 1: matrix 458 rows 190 cols
[2025-06-02 14:40:28] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:40:29] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-02 14:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:40:29] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 14:40: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/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:38] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:39] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:39] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:39] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:39] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:40] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:40] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:41] [INFO ] Deduced a trap composed of 92 places in 317 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:41] [INFO ] Deduced a trap composed of 111 places in 356 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:41] [INFO ] Deduced a trap composed of 111 places in 312 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:42] [INFO ] Deduced a trap composed of 111 places in 298 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:42] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:42] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:43] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:44] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:44] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:44] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:45] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:45] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:45] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:46] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:48] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:48] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:48] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:48] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:49] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:49] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:50] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:50] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:51] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:52] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:52] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:58] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:58] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:40:58] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:00] [INFO ] Deduced a trap composed of 115 places in 309 ms of which 35 ms to minimize.
SMT process timed out in 30494ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30500ms
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 458/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31321 ms. Remains : 190/196 places, 458/469 transitions.
Stuttering acceptance computed with spot in 624 ms :[(OR (NOT p1) p0), (NOT p0), (NOT p2), p0, (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-01 finished in 32101 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(X(X(p1)))&&p0)) U p1))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 458
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 189 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 189 transition count 456
Applied a total of 14 rules in 20 ms. Remains 189 /196 variables (removed 7) and now considering 456/469 (removed 13) transitions.
// Phase 1: matrix 456 rows 189 cols
[2025-06-02 14:41:00] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:41:01] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-02 14:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:41:01] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:41: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/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:11] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:12] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:12] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:12] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:12] [INFO ] Deduced a trap composed of 95 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:13] [INFO ] Deduced a trap composed of 111 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:13] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:14] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:15] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:15] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:15] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:16] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:16] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:16] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:16] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:17] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:17] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:17] [INFO ] Deduced a trap composed of 111 places in 213 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:18] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:18] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:19] [INFO ] Deduced a trap composed of 111 places in 292 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:20] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:21] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:21] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:21] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:22] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:22] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:23] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:23] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:24] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:24] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:30] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:31] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:31] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:31] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:31] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:31] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 44 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:35] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:36] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:37] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:37] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:38] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:41] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:41:41] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/240 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/645 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 645 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60321ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 406/469 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61181 ms. Remains : 189/196 places, 406/469 transitions.
Stuttering acceptance computed with spot in 176 ms :[p1, (NOT p1), true, true, p1]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-02 finished in 61384 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 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Graph (trivial) has 196 edges and 196 vertex of which 9 / 196 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 189 transition count 436
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 163 transition count 436
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 53 place count 163 transition count 422
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 81 place count 149 transition count 422
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 144 transition count 412
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 144 transition count 412
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 141 place count 119 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 117 transition count 359
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 117 transition count 359
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 191 place count 94 transition count 446
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 194 place count 94 transition count 443
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 92 transition count 427
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 92 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 206 place count 92 transition count 419
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 91 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 219 place count 91 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 227 place count 87 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 86 transition count 418
Applied a total of 228 rules in 152 ms. Remains 86 /196 variables (removed 110) and now considering 418/469 (removed 51) transitions.
[2025-06-02 14:42:02] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 86 cols
[2025-06-02 14:42:02] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:42:02] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 14:42:02] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2025-06-02 14:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:42:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-06-02 14:42:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:42:03] [INFO ] Redundant transitions in 57 ms returned []
Running 409 sub problems to find dead transitions.
[2025-06-02 14:42:03] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2025-06-02 14:42:03] [INFO ] Invariant cache hit.
[2025-06-02 14:42:03] [INFO ] State equation strengthened by 77 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:05] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:05] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:06] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:06] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:06] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:06] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:07] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:07] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:07] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:07] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:42:08] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (OVERLAPS) 385/471 variables, 86/105 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 76/181 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 1/472 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 182 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 3 (OVERLAPS) 385/471 variables, 86/105 constraints. Problems are: Problem set: 42 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 76/181 constraints. Problems are: Problem set: 42 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 367/548 constraints. Problems are: Problem set: 42 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/472 variables, and 548 constraints, problems are : Problem set: 42 solved, 367 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 76/77 constraints, PredecessorRefiner: 367/409 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60470ms problems are : Problem set: 42 solved, 367 unsolved
Search for dead transitions found 42 dead transitions in 60473ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/196 places, 376/469 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 398
Applied a total of 4 rules in 16 ms. Remains 84 /86 variables (removed 2) and now considering 398/376 (removed -22) transitions.
[2025-06-02 14:43:03] [INFO ] Flow matrix only has 360 transitions (discarded 38 similar events)
// Phase 1: matrix 360 rows 84 cols
[2025-06-02 14:43:03] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:03] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 14:43:03] [INFO ] Flow matrix only has 360 transitions (discarded 38 similar events)
[2025-06-02 14:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-06-02 14:43:04] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/196 places, 398/469 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62037 ms. Remains : 84/196 places, 398/469 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-04 finished in 62216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(((!p1&&F((X(X(p2))&&G(p3))))||G((F(G(p3))&&F(p2))))))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 458
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 189 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 189 transition count 456
Applied a total of 14 rules in 18 ms. Remains 189 /196 variables (removed 7) and now considering 456/469 (removed 13) transitions.
// Phase 1: matrix 456 rows 189 cols
[2025-06-02 14:43:04] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-02 14:43:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:05] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:43: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/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:15] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:15] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:15] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:16] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:16] [INFO ] Deduced a trap composed of 95 places in 231 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:16] [INFO ] Deduced a trap composed of 111 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:17] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:18] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:18] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:19] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:19] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:19] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:19] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:20] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:20] [INFO ] Deduced a trap composed of 21 places in 332 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:20] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 111 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:21] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:22] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:22] [INFO ] Deduced a trap composed of 111 places in 313 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:24] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:24] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:25] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:25] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:25] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:26] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:27] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:27] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:27] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:28] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:34] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:35] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:35] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:35] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:35] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 16 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30502ms
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 456/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31357 ms. Remains : 189/196 places, 456/469 transitions.
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), true, (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-06
Product exploration explored 100000 steps with 5950 reset in 541 ms.
Product exploration explored 100000 steps with 6032 reset in 388 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X p2), (X (NOT (AND p0 p1))), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p3 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p3 p2))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 133 ms. Reduced automaton from 10 states, 29 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
RANDOM walk for 40000 steps (1376 resets) in 570 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (299 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (299 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (298 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (300 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (297 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 979853 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :4 out of 5
Probabilistic random walk after 979853 steps, saw 188954 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :4
[2025-06-02 14:43:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 56/645 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X p2), (X (NOT (AND p0 p1))), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p3 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (AND p3 p2))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p2))))), (G (OR p3 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p2))), (F (NOT p3)), (F (NOT (AND p3 p2))), (F (NOT p2))]
Knowledge based reduction with 19 factoid took 343 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Support contains 2 out of 189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 456/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2025-06-02 14:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:42] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 14:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:43:42] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:43: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/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:50] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:51] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:51] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:51] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:51] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:52] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:52] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:53] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:53] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:54] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:54] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:54] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:55] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:55] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:55] [INFO ] Deduced a trap composed of 21 places in 324 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:55] [INFO ] Deduced a trap composed of 37 places in 312 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:56] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:56] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:56] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:57] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:58] [INFO ] Deduced a trap composed of 111 places in 271 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:43:59] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:00] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:00] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:00] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:00] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:01] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:02] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:02] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:02] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:03] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:09] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:10] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:10] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:10] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:11] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:11] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 13 ms to minimize.
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 189/645 variables, and 44 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:17] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:18] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:18] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:19] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:20] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:23] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:23] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/240 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/645 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 645 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60200ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/189 places, 406/456 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60827 ms. Remains : 189/189 places, 406/456 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p3 p2), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
RANDOM walk for 40000 steps (1376 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (298 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (297 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 163039 steps, run visited all 2 properties in 800 ms. (steps per millisecond=203 )
Probabilistic random walk after 163039 steps, saw 29984 distinct states, run finished after 801 ms. (steps per millisecond=203 ) properties seen :2
Knowledge obtained : [(AND p3 p2), (X (X p3))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 5940 reset in 135 ms.
Product exploration explored 100000 steps with 6131 reset in 312 ms.
Applying partial POR strategy [false, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p3)]
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 406/406 transitions.
Graph (trivial) has 185 edges and 189 vertex of which 9 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 183 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 183 transition count 401
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 183 transition count 401
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 65 place count 183 transition count 405
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 83 place count 165 transition count 375
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 101 place count 165 transition count 375
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 129 place count 165 transition count 578
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 135 place count 165 transition count 572
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 147 place count 153 transition count 538
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 159 place count 153 transition count 538
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 164 place count 153 transition count 533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 150 transition count 528
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 150 transition count 528
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 206 place count 150 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 209 place count 147 transition count 487
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 212 place count 147 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 147 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 218 place count 144 transition count 484
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 144 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 144 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 143 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 143 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 224 rules in 86 ms. Remains 143 /189 variables (removed 46) and now considering 497/406 (removed -91) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:44:46] [INFO ] Redundant transitions in 11 ms returned []
Running 496 sub problems to find dead transitions.
[2025-06-02 14:44:46] [INFO ] Flow matrix only has 459 transitions (discarded 38 similar events)
// Phase 1: matrix 459 rows 143 cols
[2025-06-02 14:44:46] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 14:44:46] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:54] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 13 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:54] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:54] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 25 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 13 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:55] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 18 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:56] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 16 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:56] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:56] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:56] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 11 ms to minimize.
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:57] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 13 ms to minimize.
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:57] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 19 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 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 TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:58] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 17 ms to minimize.
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:58] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:44:58] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 16 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:00] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:00] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 15 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/26 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:01] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:01] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/28 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 458/601 variables, 143/171 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 94/265 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/602 variables, and 265 constraints, problems are : Problem set: 95 solved, 401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 1 (OVERLAPS) 60/143 variables, 7/7 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 21/28 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/28 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 458/601 variables, 143/171 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 94/265 constraints. Problems are: Problem set: 95 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 401/666 constraints. Problems are: Problem set: 95 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/602 variables, and 666 constraints, problems are : Problem set: 95 solved, 401 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 401/496 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60442ms problems are : Problem set: 95 solved, 401 unsolved
Search for dead transitions found 95 dead transitions in 60444ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/189 places, 402/406 transitions.
Graph (complete) has 728 edges and 143 vertex of which 84 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.5 ms
Discarding 59 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 84 /143 variables (removed 59) and now considering 402/402 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/189 places, 402/406 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60571 ms. Remains : 84/189 places, 402/406 transitions.
Built C files in :
/tmp/ltsmin10503452409768813365
[2025-06-02 14:45:47] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10503452409768813365
Running compilation step : cd /tmp/ltsmin10503452409768813365;'/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 1532 ms.
Running link step : cd /tmp/ltsmin10503452409768813365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin10503452409768813365;'/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/stateBased7003515429449470444.hoa' '--buchi-type=spotba'
LTSmin run took 558 ms.
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-06 finished in 164928 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&&F(G(p1))))||F(G(p2))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Graph (trivial) has 173 edges and 196 vertex of which 6 / 196 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 191 transition count 437
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 164 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 163 transition count 436
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 163 transition count 422
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 149 transition count 422
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 143 transition count 410
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 143 transition count 410
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 145 place count 119 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 117 transition count 358
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 117 transition count 358
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 175 place count 104 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 104 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 103 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 196 place count 103 transition count 409
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 204 place count 99 transition count 405
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 97 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 96 transition count 413
Applied a total of 209 rules in 76 ms. Remains 96 /196 variables (removed 100) and now considering 413/469 (removed 56) transitions.
[2025-06-02 14:45:49] [INFO ] Flow matrix only has 398 transitions (discarded 15 similar events)
// Phase 1: matrix 398 rows 96 cols
[2025-06-02 14:45:49] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:45:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 14:45:49] [INFO ] Flow matrix only has 398 transitions (discarded 15 similar events)
[2025-06-02 14:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:45:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 14:45:50] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:45:50] [INFO ] Redundant transitions in 13 ms returned []
Running 404 sub problems to find dead transitions.
[2025-06-02 14:45:50] [INFO ] Flow matrix only has 398 transitions (discarded 15 similar events)
[2025-06-02 14:45:50] [INFO ] Invariant cache hit.
[2025-06-02 14:45:50] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:52] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:52] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:52] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:52] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:52] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:53] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:53] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:53] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:53] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:53] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:54] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:54] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:45:54] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 397/493 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 1/494 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 130 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 3 (OVERLAPS) 397/493 variables, 96/116 constraints. Problems are: Problem set: 42 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 13/129 constraints. Problems are: Problem set: 42 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 362/491 constraints. Problems are: Problem set: 42 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/494 variables, and 491 constraints, problems are : Problem set: 42 solved, 362 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 13/14 constraints, PredecessorRefiner: 362/404 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 42 solved, 362 unsolved
Search for dead transitions found 42 dead transitions in 60286ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 96/196 places, 371/469 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 394
Applied a total of 4 rules in 9 ms. Remains 94 /96 variables (removed 2) and now considering 394/371 (removed -23) transitions.
[2025-06-02 14:46:50] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
// Phase 1: matrix 372 rows 94 cols
[2025-06-02 14:46:50] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:46:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 14:46:50] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
[2025-06-02 14:46:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:46:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 14:46:50] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/196 places, 394/469 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61317 ms. Remains : 94/196 places, 394/469 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 18016 reset in 607 ms.
Product exploration explored 100000 steps with 18009 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 142 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7160 resets) in 186 ms. (213 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (1376 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1347 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1536 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1325 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
[2025-06-02 14:46:52] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
[2025-06-02 14:46:52] [INFO ] Invariant cache hit.
[2025-06-02 14:46:52] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 368/453 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/465 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/466 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/466 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:46:52] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:46:53] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 368/453 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/465 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/466 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:46:53] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/466 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1650ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2856 ms.
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 394/394 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 93 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 93 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 92 transition count 392
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 38 place count 92 transition count 362
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 88 place count 62 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 97 place count 62 transition count 333
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 62 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 58 transition count 361
Applied a total of 109 rules in 33 ms. Remains 58 /94 variables (removed 36) and now considering 361/394 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 58/94 places, 361/394 transitions.
RANDOM walk for 40000 steps (20 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (40 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (43 resets) in 224 ms. (177 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (10000 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2025-06-02 14:46:57] [INFO ] Flow matrix only has 296 transitions (discarded 65 similar events)
// Phase 1: matrix 296 rows 58 cols
[2025-06-02 14:46:57] [INFO ] Computed 7 invariants in 1 ms
[2025-06-02 14:46:57] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 296/348 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:46:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 296/348 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 38/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/354 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:46:57] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2540ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 396 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 361/361 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 360
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 56 transition count 352
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 56 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 56 transition count 348
Free-agglomeration rule applied 4 times with reduction of 5 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 56 transition count 339
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 38 place count 52 transition count 319
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 50 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 55 place count 50 transition count 332
Applied a total of 55 rules in 41 ms. Remains 50 /58 variables (removed 8) and now considering 332/361 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 50/58 places, 332/361 transitions.
RANDOM walk for 40000 steps (64 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (10000 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 133 steps, run visited all 1 properties in 6 ms. (steps per millisecond=22 )
Probabilistic random walk after 133 steps, saw 88 distinct states, run finished after 6 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 602 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 94 /94 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2025-06-02 14:47:01] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
// Phase 1: matrix 372 rows 94 cols
[2025-06-02 14:47:01] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:47:01] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 14:47:01] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
[2025-06-02 14:47:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:47:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 14:47:01] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:47:01] [INFO ] Redundant transitions in 6 ms returned []
Running 385 sub problems to find dead transitions.
[2025-06-02 14:47:01] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
[2025-06-02 14:47:01] [INFO ] Invariant cache hit.
[2025-06-02 14:47:01] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:03] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:03] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:04] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:04] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:04] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:04] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:05] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:06] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:07] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:09] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:11] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (OVERLAPS) 371/465 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:47:24] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/466 variables, and 136 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 13/14 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (OVERLAPS) 371/465 variables, 94/123 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 385/521 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/466 variables, and 521 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 13/14 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 385 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60941 ms. Remains : 94/94 places, 394/394 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 174 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7149 resets) in 213 ms. (186 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (1304 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1325 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1536 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1334 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2025-06-02 14:48:02] [INFO ] Flow matrix only has 372 transitions (discarded 22 similar events)
[2025-06-02 14:48:02] [INFO ] Invariant cache hit.
[2025-06-02 14:48:02] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 368/453 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/465 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/466 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/466 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:03] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:03] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 368/453 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/465 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/466 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:04] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/466 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2066ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2904 ms.
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 394/394 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 93 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 93 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 92 transition count 392
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 38 place count 92 transition count 362
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 88 place count 62 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 97 place count 62 transition count 333
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 62 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 58 transition count 361
Applied a total of 109 rules in 37 ms. Remains 58 /94 variables (removed 36) and now considering 361/394 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 58/94 places, 361/394 transitions.
RANDOM walk for 40000 steps (54 resets) in 193 ms. (206 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (10000 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
[2025-06-02 14:48:07] [INFO ] Flow matrix only has 296 transitions (discarded 65 similar events)
// Phase 1: matrix 296 rows 58 cols
[2025-06-02 14:48:07] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 14:48:07] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/264 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/353 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/354 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/264 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 89/353 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/354 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/354 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3263 steps, including 570 resets, run visited all 1 properties in 16 ms. (steps per millisecond=203 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 566 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18030 reset in 166 ms.
Stuttering criterion allowed to conclude after 96104 steps with 17280 reset in 168 ms.
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 140290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)||X(X(X((p2||G(p0)))))) U (p3&&((p0 U p1)||X(X(X((p2||G(p0))))))))))'
Support contains 11 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 191 transition count 459
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 191 transition count 459
Applied a total of 10 rules in 6 ms. Remains 191 /196 variables (removed 5) and now considering 459/469 (removed 10) transitions.
// Phase 1: matrix 459 rows 191 cols
[2025-06-02 14:48:09] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:48:09] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-02 14:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:48:10] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2025-06-02 14:48: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/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:16] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:16] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:17] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:18] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:18] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:19] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:19] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:19] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:19] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:19] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:20] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:20] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:20] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:20] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:21] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:21] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:21] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:22] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:22] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:23] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:23] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:23] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:24] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:24] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:24] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:25] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:26] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:26] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:26] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:27] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:33] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:34] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:34] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:39] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:39] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/650 variables, and 48 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:47] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:50] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:48:54] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:00] [INFO ] Deduced a trap composed of 114 places in 294 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:04] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:08] [INFO ] Deduced a trap composed of 114 places in 299 ms of which 47 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/650 variables, and 54 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 191/196 places, 459/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 191/196 places, 459/469 transitions.
Stuttering acceptance computed with spot in 530 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-11 finished in 61476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 191 transition count 460
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 190 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 190 transition count 458
Applied a total of 12 rules in 6 ms. Remains 190 /196 variables (removed 6) and now considering 458/469 (removed 11) transitions.
// Phase 1: matrix 458 rows 190 cols
[2025-06-02 14:49:11] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:49:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-02 14:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:49:11] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 14:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:20] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:20] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:20] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:20] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:21] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:21] [INFO ] Deduced a trap composed of 111 places in 241 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:21] [INFO ] Deduced a trap composed of 95 places in 229 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:21] [INFO ] Deduced a trap composed of 111 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:22] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:22] [INFO ] Deduced a trap composed of 111 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:22] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:22] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:23] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:23] [INFO ] Deduced a trap composed of 115 places in 307 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:24] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:24] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:25] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:25] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:25] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:26] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:26] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:26] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:27] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:27] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:28] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:28] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:28] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:28] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:28] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:29] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:29] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:29] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:29] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:30] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:30] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:31] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:31] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:35] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:38] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:41] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 47 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:46] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:47] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:47] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:47] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:48] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:48] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:49:49] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/244 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 407/651 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 651 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60200ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 408/469 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60938 ms. Remains : 190/196 places, 408/469 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 61156 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||(F(p1)&&X(X(G(p0)))))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 191 transition count 460
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 190 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 190 transition count 458
Applied a total of 12 rules in 10 ms. Remains 190 /196 variables (removed 6) and now considering 458/469 (removed 11) transitions.
// Phase 1: matrix 458 rows 190 cols
[2025-06-02 14:50:12] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:50:12] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 14:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:50:13] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 14:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:22] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:23] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:23] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:23] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:23] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:24] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:24] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:24] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:25] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:26] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:26] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:26] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:27] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:27] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:27] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:28] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:28] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:28] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:28] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:29] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:29] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:30] [INFO ] Deduced a trap composed of 112 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:30] [INFO ] Deduced a trap composed of 112 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:31] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:32] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:32] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:32] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:33] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:33] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:33] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:34] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:35] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:35] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:36] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:41] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:41] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:43] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 44 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:47] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:47] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:48] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:48] [INFO ] Deduced a trap composed of 113 places in 301 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:49] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:49] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:50] [INFO ] Deduced a trap composed of 113 places in 310 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:51] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:51] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:50:56] [INFO ] Deduced a trap composed of 113 places in 281 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/244 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 407/651 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 651 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60262ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60265ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 408/469 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60926 ms. Remains : 190/196 places, 408/469 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 3446 reset in 185 ms.
Product exploration explored 100000 steps with 3447 reset in 302 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (298 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (298 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (298 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 794 ms. (steps per millisecond=205 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 795 ms. (steps per millisecond=205 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2025-06-02 14:51:15] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:51:15] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 14:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:51:16] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-02 14:51: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/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:24] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:24] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:24] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:24] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:25] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:25] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:25] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:25] [INFO ] Deduced a trap composed of 112 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:26] [INFO ] Deduced a trap composed of 113 places in 261 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:26] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:27] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:27] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:28] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:28] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:28] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:29] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:29] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:29] [INFO ] Deduced a trap composed of 90 places in 247 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:29] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:30] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:30] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:31] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:31] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:32] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:32] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:33] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:33] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:33] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:34] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:34] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:34] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:34] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:34] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:35] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:35] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:35] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:36] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:36] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:36] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:37] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:41] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:41] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:42] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:42] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:42] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:43] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:44] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:44] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 55 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:51] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:54] [INFO ] Deduced a trap composed of 113 places in 268 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:55] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:55] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:56] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:56] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:56] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:57] [INFO ] Deduced a trap composed of 113 places in 249 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:51:57] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:01] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:01] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:01] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:02] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:02] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:06] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 35 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:09] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/598 variables, and 71 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 190/190 places, 408/408 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (299 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (302 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (298 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 764 ms. (steps per millisecond=214 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 764 ms. (steps per millisecond=214 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3448 reset in 164 ms.
Product exploration explored 100000 steps with 3447 reset in 193 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 187 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 184 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 28 place count 184 transition count 405
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 184 transition count 405
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 64 place count 184 transition count 409
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 81 place count 167 transition count 380
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 98 place count 167 transition count 380
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 126 place count 167 transition count 575
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 167 transition count 569
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 144 place count 155 transition count 535
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 156 place count 155 transition count 535
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 155 transition count 530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 200 place count 152 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 149 transition count 487
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 149 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 149 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 146 transition count 484
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 146 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 146 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 145 transition count 497
Deduced a syphon composed of 59 places in 1 ms
Applied a total of 218 rules in 88 ms. Remains 145 /190 variables (removed 45) and now considering 497/408 (removed -89) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:52:19] [INFO ] Redundant transitions in 5 ms returned []
Running 496 sub problems to find dead transitions.
[2025-06-02 14:52:19] [INFO ] Flow matrix only has 463 transitions (discarded 34 similar events)
// Phase 1: matrix 463 rows 145 cols
[2025-06-02 14:52:19] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 14:52:19] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:27] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 13 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:27] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:27] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:28] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:28] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:28] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:28] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 17 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:29] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 20 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:29] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 13 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:29] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:30] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:30] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:30] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 10 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:30] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 12 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:30] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD158 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 TDEAD184 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:31] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 8 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:32] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:32] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 11 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 19/26 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:33] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/27 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:52:38] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/28 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/28 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 462/607 variables, 145/173 constraints. Problems are: Problem set: 96 solved, 400 unsolved
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 96 solved, 400 unsolved
Search for dead transitions found 96 dead transitions in 30256ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 145/190 places, 401/408 transitions.
Graph (complete) has 726 edges and 145 vertex of which 86 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.2 ms
Discarding 59 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 86 /145 variables (removed 59) and now considering 401/401 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/190 places, 401/408 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30370 ms. Remains : 86/190 places, 401/408 transitions.
Built C files in :
/tmp/ltsmin8881737472097872912
[2025-06-02 14:52:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8881737472097872912
Running compilation step : cd /tmp/ltsmin8881737472097872912;'/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 1266 ms.
Running link step : cd /tmp/ltsmin8881737472097872912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8881737472097872912;'/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/stateBased3192730820602936353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2025-06-02 14:53:04] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:53:04] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 14:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:53:05] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-02 14:53: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/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:13] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:14] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:14] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:14] [INFO ] Deduced a trap composed of 112 places in 279 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:15] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:15] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:15] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:16] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:16] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:16] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:17] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:18] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:18] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:18] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:19] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:19] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:19] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:19] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:20] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:20] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:21] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:21] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:22] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:22] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:23] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:23] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:23] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:23] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:24] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:24] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:24] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:24] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:25] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:25] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:25] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:25] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:26] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:26] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:26] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:31] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:31] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:32] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:32] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:32] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:32] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:33] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:33] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 55 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:40] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:43] [INFO ] Deduced a trap composed of 113 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:44] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:45] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:45] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:45] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:45] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:46] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:46] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:50] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:50] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:51] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:51] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:51] [INFO ] Deduced a trap composed of 90 places in 228 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:55] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:53:58] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/598 variables, and 71 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 190/190 places, 408/408 transitions.
Built C files in :
/tmp/ltsmin217401526024471514
[2025-06-02 14:54:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin217401526024471514
Running compilation step : cd /tmp/ltsmin217401526024471514;'/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 1325 ms.
Running link step : cd /tmp/ltsmin217401526024471514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin217401526024471514;'/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/stateBased9249464613867965551.hoa' '--buchi-type=spotba'
LTSmin run took 9431 ms.
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 243963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1)||G(!p2))))))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 469/469 transitions.
Graph (trivial) has 198 edges and 196 vertex of which 9 / 196 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 189 transition count 435
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 162 transition count 435
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 55 place count 162 transition count 421
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 83 place count 148 transition count 421
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 143 transition count 411
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 143 transition count 411
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 141 place count 119 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 117 transition count 359
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 117 transition count 359
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 191 place count 94 transition count 449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 195 place count 94 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 92 transition count 429
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 92 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 207 place count 92 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 211 place count 90 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 226 place count 90 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 234 place count 86 transition count 432
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 86 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 247 place count 86 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 85 transition count 420
Applied a total of 248 rules in 68 ms. Remains 85 /196 variables (removed 111) and now considering 420/469 (removed 49) transitions.
[2025-06-02 14:54:16] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 85 cols
[2025-06-02 14:54:16] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:54:16] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 14:54:16] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2025-06-02 14:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:54:16] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-02 14:54:16] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:54:16] [INFO ] Redundant transitions in 4 ms returned []
Running 411 sub problems to find dead transitions.
[2025-06-02 14:54:16] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2025-06-02 14:54:16] [INFO ] Invariant cache hit.
[2025-06-02 14:54:16] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:18] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:18] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:18] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:19] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:20] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:54:20] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/103 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/181 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 1/473 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/473 variables, and 182 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/103 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/181 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 369/550 constraints. Problems are: Problem set: 42 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/473 variables, and 550 constraints, problems are : Problem set: 42 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 369/411 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 42 solved, 369 unsolved
Search for dead transitions found 42 dead transitions in 60326ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 85/196 places, 378/469 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 388
Applied a total of 2 rules in 8 ms. Remains 84 /85 variables (removed 1) and now considering 388/378 (removed -10) transitions.
[2025-06-02 14:55:17] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
// Phase 1: matrix 356 rows 84 cols
[2025-06-02 14:55:17] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:55:17] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 14:55:17] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2025-06-02 14:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:55:17] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-02 14:55:17] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/196 places, 388/469 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61362 ms. Remains : 84/196 places, 388/469 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14
Stuttering criterion allowed to conclude after 54422 steps with 9865 reset in 151 ms.
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 61657 ms.
All properties solved by simple procedures.
Total runtime 1007427 ms.

BK_STOP 1748876118031

--------------------
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="MedleyA-PT-17"
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 MedleyA-PT-17, 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 r128-smll-174876524200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;