Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728800188.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 Anderson-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728800188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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.7K 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 927K 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 Anderson-PT-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748546252751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 19:17:33] [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-05-29 19:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:17:34] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-05-29 19:17:34] [INFO ] Transformed 505 places.
[2025-05-29 19:17:34] [INFO ] Transformed 1845 transitions.
[2025-05-29 19:17:34] [INFO ] Found NUPN structural information;
[2025-05-29 19:17:34] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 383 transition count 891
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 383 transition count 891
Applied a total of 244 rules in 105 ms. Remains 383 /505 variables (removed 122) and now considering 891/1845 (removed 954) transitions.
// Phase 1: matrix 891 rows 383 cols
[2025-05-29 19:17:34] [INFO ] Computed 21 invariants in 56 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:17:35] [INFO ] Implicit Places using invariants in 512 ms returned []
[2025-05-29 19:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:17:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:17:37] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-05-29 19:17:37] [INFO ] Invariant cache hit.
[2025-05-29 19:17:37] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:51] [INFO ] Deduced a trap composed of 93 places in 2489 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:51] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:52] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:53] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:53] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:53] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:54] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:54] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:54] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:54] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:55] [INFO ] Deduced a trap composed of 105 places in 231 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:55] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:55] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:56] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:58] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:58] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:58] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:58] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:59] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:17:59] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:02] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:02] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:03] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:03] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:04] [INFO ] Deduced a trap composed of 73 places in 223 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:04] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:05] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:05] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:05] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:05] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:06] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:06] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:06] [INFO ] Deduced a trap composed of 95 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:07] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1274 variables, and 55 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/383 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:09] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:10] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:11] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:12] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:12] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:21] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:21] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:21] [INFO ] Deduced a trap composed of 113 places in 226 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:22] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1274 variables, and 64 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/383 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60757ms
Starting structural reductions in LTL mode, iteration 1 : 383/505 places, 891/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63472 ms. Remains : 383/505 places, 891/1845 transitions.
Support contains 45 out of 383 places after structural reductions.
[2025-05-29 19:18:38] [INFO ] Flatten gal took : 88 ms
[2025-05-29 19:18:38] [INFO ] Flatten gal took : 56 ms
[2025-05-29 19:18:38] [INFO ] Input system was already deterministic with 891 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 1906 ms. (20 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 14/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 9/9 properties
[2025-05-29 19:18:38] [INFO ] Invariant cache hit.
[2025-05-29 19:18:38] [INFO ] State equation strengthened by 72 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 295/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 56/372 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 11/383 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 891/1274 variables, 383/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1274 variables, 72/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:41] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 46 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1274 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1274 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1274 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1274/1274 variables, and 482 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3252 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 383/383 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 295/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 56/372 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 11/383 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:42] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:43] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 40 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:43] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 39 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:43] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:45] [INFO ] Deduced a trap composed of 103 places in 204 ms of which 36 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:45] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 41 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 891/1274 variables, 383/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1274 variables, 72/492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 9/501 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 501 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 383/383 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8287ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 383 transition count 820
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 312 transition count 820
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 299 transition count 631
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 299 transition count 631
Applied a total of 168 rules in 66 ms. Remains 299 /383 variables (removed 84) and now considering 631/891 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 299/383 places, 631/891 transitions.
RANDOM walk for 40000 steps (8 resets) in 502 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
// Phase 1: matrix 631 rows 299 cols
[2025-05-29 19:18:47] [INFO ] Computed 21 invariants in 13 ms
[2025-05-29 19:18:47] [INFO ] State equation strengthened by 72 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 271/288 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/290 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/299 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:48] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:48] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:48] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:48] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 27 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 631/930 variables, 299/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 72/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/930 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/930 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 396 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 299/299 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 271/288 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/290 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/299 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:50] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 29 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 631/930 variables, 299/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 72/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/930 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/930 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 403 constraints, problems are : Problem set: 0 solved, 6 unsolved in 20515 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 299/299 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22618ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 891 ms.
Support contains 17 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 631/631 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 297 transition count 597
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 297 transition count 597
Applied a total of 4 rules in 35 ms. Remains 297 /299 variables (removed 2) and now considering 597/631 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 297/299 places, 597/631 transitions.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/5 properties
// Phase 1: matrix 597 rows 297 cols
[2025-05-29 19:19:11] [INFO ] Computed 21 invariants in 21 ms
[2025-05-29 19:19:11] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 272/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/287 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/297 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:12] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:12] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 597/894 variables, 297/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 72/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/894 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/894 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 894/894 variables, and 392 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 272/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/287 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/297 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:13] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:13] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 29 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 597/894 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/894 variables, 72/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/894 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/894 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 894/894 variables, and 397 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2980ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 597/597 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 297 transition count 596
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 296 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 293 transition count 545
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 293 transition count 545
Applied a total of 8 rules in 34 ms. Remains 293 /297 variables (removed 4) and now considering 545/597 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 293/297 places, 545/597 transitions.
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 421578 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :1 out of 3
Probabilistic random walk after 421578 steps, saw 299624 distinct states, run finished after 3010 ms. (steps per millisecond=140 ) properties seen :1
// Phase 1: matrix 545 rows 293 cols
[2025-05-29 19:19:17] [INFO ] Computed 21 invariants in 5 ms
[2025-05-29 19:19:17] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 269/277 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/283 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/293 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 545/838 variables, 293/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/838 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 386 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 269/277 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/283 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/293 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:18] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:18] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 545/838 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 72/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/838 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/838 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/838 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1819ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 546 ms.
Support contains 8 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 545/545 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 292 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 292 transition count 528
Applied a total of 2 rules in 20 ms. Remains 292 /293 variables (removed 1) and now considering 528/545 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 292/293 places, 528/545 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 490655 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 2
Probabilistic random walk after 490655 steps, saw 351023 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
// Phase 1: matrix 528 rows 292 cols
[2025-05-29 19:19:23] [INFO ] Computed 21 invariants in 4 ms
[2025-05-29 19:19:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 269/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/283 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/292 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:23] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 528/820 variables, 292/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/820 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 386 constraints, problems are : Problem set: 0 solved, 2 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 269/277 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/283 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/292 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 528/820 variables, 292/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/820 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 388 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1658ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 389 ms.
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 528/528 transitions.
Applied a total of 0 rules in 15 ms. Remains 292 /292 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 292/292 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 528/528 transitions.
Applied a total of 0 rules in 10 ms. Remains 292 /292 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2025-05-29 19:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:19:25] [INFO ] Implicit Places using invariants in 313 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/292 places, 528/528 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 291 transition count 467
Reduce places removed 61 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 130 place count 230 transition count 459
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 222 transition count 459
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 149 place count 222 transition count 448
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 160 place count 211 transition count 448
Applied a total of 160 rules in 27 ms. Remains 211 /291 variables (removed 80) and now considering 448/528 (removed 80) transitions.
// Phase 1: matrix 448 rows 211 cols
[2025-05-29 19:19:25] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:19:26] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-29 19:19:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:19:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:19:26] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/292 places, 448/528 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1268 ms. Remains : 211/292 places, 448/528 transitions.
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 581626 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 2
Probabilistic random walk after 581626 steps, saw 400071 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2025-05-29 19:19:29] [INFO ] Invariant cache hit.
[2025-05-29 19:19:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 188/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/202 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:30] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 448/659 variables, 211/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 72/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/659 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 304 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 188/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/202 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:30] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:30] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 448/659 variables, 211/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 72/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/659 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1372ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 8 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 211/211 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-05-29 19:19:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:19:31] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-29 19:19:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:19:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:19:32] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:19:32] [INFO ] Redundant transitions in 32 ms returned []
Running 439 sub problems to find dead transitions.
[2025-05-29 19:19:32] [INFO ] Invariant cache hit.
[2025-05-29 19:19:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:34] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:34] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:35] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:35] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:35] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:36] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:36] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:36] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:37] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:37] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:37] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:38] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:38] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:39] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:43] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:19:43] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (OVERLAPS) 448/659 variables, 211/247 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 72/319 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/659 variables, and 319 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 448/659 variables, 211/247 constraints. Problems are: Problem set: 0 solved, 439 unsolved
SMT process timed out in 60142ms, After SMT, problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61136 ms. Remains : 211/211 places, 448/448 transitions.
Computed a total of 0 stabilizing places and 0 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' '!(G((X(F(((!p1&&X(X(!p2)))||G(!p2))))||p0)))'
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 364 transition count 600
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 364 transition count 600
Applied a total of 38 rules in 11 ms. Remains 364 /383 variables (removed 19) and now considering 600/891 (removed 291) transitions.
// Phase 1: matrix 600 rows 364 cols
[2025-05-29 19:20:33] [INFO ] Computed 21 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:20:33] [INFO ] Implicit Places using invariants in 365 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/383 places, 600/891 transitions.
Applied a total of 0 rules in 6 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 363/383 places, 600/891 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) p2), p2, p2, p2, p2]
Running random walk in product with property : Anderson-PT-09-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 236 ms.
Product exploration explored 100000 steps with 0 reset in 269 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 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p2), p2, p2, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 446 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
// Phase 1: matrix 600 rows 363 cols
[2025-05-29 19:20:35] [INFO ] Computed 20 invariants in 8 ms
[2025-05-29 19:20:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/348 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/354 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 9/363 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 600/963 variables, 363/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/963 variables, 72/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/963 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 455 constraints, problems are : Problem set: 1 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 340/348 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/354 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/363 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 600/963 variables, 363/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/963 variables, 72/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 2/457 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/963 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 457 constraints, problems are : Problem set: 1 solved, 2 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1359ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 600/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 363 transition count 538
Reduce places removed 62 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 69 rules applied. Total rules applied 131 place count 301 transition count 531
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 138 place count 294 transition count 531
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 138 place count 294 transition count 459
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 282 place count 222 transition count 459
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 292 place count 222 transition count 449
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 302 place count 212 transition count 449
Applied a total of 302 rules in 46 ms. Remains 212 /363 variables (removed 151) and now considering 449/600 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 212/363 places, 449/600 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 548076 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 2
Probabilistic random walk after 548076 steps, saw 369925 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 449 rows 212 cols
[2025-05-29 19:20:39] [INFO ] Computed 20 invariants in 7 ms
[2025-05-29 19:20:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/189 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/195 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/212 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:39] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/661 variables, 212/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 72/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/189 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/195 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/212 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/661 variables, 212/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 72/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/661 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 449/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 212/212 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 449/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2025-05-29 19:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:20:40] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-29 19:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:20:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:20:41] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:20:41] [INFO ] Redundant transitions in 7 ms returned []
Running 440 sub problems to find dead transitions.
[2025-05-29 19:20:41] [INFO ] Invariant cache hit.
[2025-05-29 19:20:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:44] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:44] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:44] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:45] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:45] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:45] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:45] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:45] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:47] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:51] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:53] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 7 (OVERLAPS) 449/661 variables, 212/247 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 72/319 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 10 (OVERLAPS) 0/661 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 440 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 319 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:18] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 212/661 variables, and 36 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/212 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/440 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61318 ms. Remains : 212/212 places, 449/449 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 80 Pre rules applied. Total rules applied 0 place count 212 transition count 369
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 132 transition count 369
Applied a total of 160 rules in 8 ms. Remains 132 /212 variables (removed 80) and now considering 369/449 (removed 80) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 369 rows 132 cols
[2025-05-29 19:21:42] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:21:42] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 19:21:42] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2025-05-29 19:21:42] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:21:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 19:21:42] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2025-05-29 19:21:42] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:21:42] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:21:42] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 542 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 291 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 8 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 363 cols
[2025-05-29 19:21:43] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:43] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-05-29 19:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:21:45] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-29 19:21:45] [INFO ] Invariant cache hit.
[2025-05-29 19:21:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:49] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:51] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:51] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:51] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:51] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:53] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:55] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:56] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:57] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:58] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:00] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:00] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:01] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:06] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 34 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:24] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 35 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 62093 ms. Remains : 363/363 places, 600/600 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 (NOT p1) (NOT p2)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2025-05-29 19:22:45] [INFO ] Invariant cache hit.
[2025-05-29 19:22:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 341/347 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/354 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/363 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 600/963 variables, 363/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/963 variables, 72/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/963 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 455 constraints, problems are : Problem set: 1 solved, 2 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 341/347 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/354 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/363 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:46] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 35 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 600/963 variables, 363/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 72/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 2/458 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/963 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 458 constraints, problems are : Problem set: 1 solved, 2 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1360ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 600/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 363 transition count 538
Reduce places removed 62 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 70 rules applied. Total rules applied 132 place count 301 transition count 530
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 140 place count 293 transition count 530
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 140 place count 293 transition count 458
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 284 place count 221 transition count 458
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 220 transition count 441
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 220 transition count 441
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 296 place count 220 transition count 431
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 306 place count 210 transition count 431
Applied a total of 306 rules in 24 ms. Remains 210 /363 variables (removed 153) and now considering 431/600 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 210/363 places, 431/600 transitions.
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 975191 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :1 out of 2
Probabilistic random walk after 975191 steps, saw 655149 distinct states, run finished after 3002 ms. (steps per millisecond=324 ) properties seen :1
// Phase 1: matrix 431 rows 210 cols
[2025-05-29 19:22:50] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 19:22:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 188/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/201 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 431/641 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/641 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 188/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/201 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:50] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 431/641 variables, 210/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 431/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 431/431 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1122769 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :0 out of 1
Probabilistic random walk after 1122769 steps, saw 751141 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
[2025-05-29 19:22:54] [INFO ] Invariant cache hit.
[2025-05-29 19:22:54] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 188/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/201 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:54] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 431/641 variables, 210/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/641 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 188/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/201 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 431/641 variables, 210/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 431/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 431/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2025-05-29 19:22:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:55] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-29 19:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:22:55] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:22:55] [INFO ] Redundant transitions in 4 ms returned []
Running 422 sub problems to find dead transitions.
[2025-05-29 19:22:55] [INFO ] Invariant cache hit.
[2025-05-29 19:22:55] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:57] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:58] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:58] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:59] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:59] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:59] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:59] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:22:59] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:00] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:01] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:01] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:02] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:05] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 431/641 variables, 210/243 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 72/315 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 315 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SMT process timed out in 60143ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61097 ms. Remains : 210/210 places, 431/431 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 80 Pre rules applied. Total rules applied 0 place count 210 transition count 351
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 130 transition count 351
Applied a total of 160 rules in 6 ms. Remains 130 /210 variables (removed 80) and now considering 351/431 (removed 80) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 351 rows 130 cols
[2025-05-29 19:23:55] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:23:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 19:23:56] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2025-05-29 19:23:56] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 19:23:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 19:23:56] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2025-05-29 19:23:56] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 19:23:56] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 19:23:56] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 392 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 224 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2, p2]
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 363 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 69 place count 363 transition count 600
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 141 place count 363 transition count 600
Deduced a syphon composed of 141 places in 1 ms
Applied a total of 141 rules in 42 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:23:58] [INFO ] Redundant transitions in 3 ms returned []
Running 591 sub problems to find dead transitions.
// Phase 1: matrix 600 rows 363 cols
[2025-05-29 19:23:58] [INFO ] Computed 20 invariants in 4 ms
[2025-05-29 19:23:58] [INFO ] State equation strengthened by 135 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:03] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:05] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:05] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:05] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:06] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 23 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 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 TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 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 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 TDEAD364 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:06] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 25 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:07] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 24 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 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 TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 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 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 TDEAD364 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 141 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:08] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:24:08] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 2/42 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/42 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 5 (OVERLAPS) 600/963 variables, 363/405 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/963 variables, 135/540 constraints. Problems are: Problem set: 141 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 963/963 variables, and 540 constraints, problems are : Problem set: 141 solved, 450 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 141 solved, 450 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 22/22 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/22 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 141/363 variables, 11/33 constraints. Problems are: Problem set: 141 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 9/42 constraints. Problems are: Problem set: 141 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 42 constraints, problems are : Problem set: 141 solved, 450 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 141 solved, 450 unsolved
Search for dead transitions found 141 dead transitions in 60191ms
Found 141 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 141 transitions
Dead transitions reduction (with SMT) removed 141 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 363/363 places, 459/600 transitions.
Graph (complete) has 1177 edges and 363 vertex of which 222 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.2 ms
Discarding 141 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 222 /363 variables (removed 141) and now considering 459/459 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 222/363 places, 459/600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60265 ms. Remains : 222/363 places, 459/600 transitions.
Built C files in :
/tmp/ltsmin16716189390384361920
[2025-05-29 19:24:58] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16716189390384361920
Running compilation step : cd /tmp/ltsmin16716189390384361920;'/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 1043 ms.
Running link step : cd /tmp/ltsmin16716189390384361920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16716189390384361920;'/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/stateBased11780252967703186812.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 7 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 363 cols
[2025-05-29 19:25:13] [INFO ] Computed 20 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:25:13] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-05-29 19:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:25:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:25:15] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-29 19:25:15] [INFO ] Invariant cache hit.
[2025-05-29 19:25:15] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:20] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:21] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:21] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:21] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:22] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:23] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:25] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:26] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:27] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:28] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:30] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:30] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:31] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:37] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 34 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:25:54] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 35 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in LTL mode , in 1 iterations and 62173 ms. Remains : 363/363 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin18372438432701893535
[2025-05-29 19:26:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18372438432701893535
Running compilation step : cd /tmp/ltsmin18372438432701893535;'/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 910 ms.
Running link step : cd /tmp/ltsmin18372438432701893535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18372438432701893535;'/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/stateBased5043136110935108266.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 19:26:30] [INFO ] Flatten gal took : 27 ms
[2025-05-29 19:26:30] [INFO ] Flatten gal took : 37 ms
[2025-05-29 19:26:30] [INFO ] Time to serialize gal into /tmp/LTL8651507961277464463.gal : 16 ms
[2025-05-29 19:26:30] [INFO ] Time to serialize properties into /tmp/LTL14164595615375437469.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8651507961277464463.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10090518724757877670.hoa' '-atoms' '/tmp/LTL14164595615375437469.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14164595615375437469.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10090518724757877670.hoa
Detected timeout of ITS tools.
[2025-05-29 19:26:46] [INFO ] Flatten gal took : 38 ms
[2025-05-29 19:26:46] [INFO ] Flatten gal took : 28 ms
[2025-05-29 19:26:46] [INFO ] Time to serialize gal into /tmp/LTL8093195652587159597.gal : 5 ms
[2025-05-29 19:26:46] [INFO ] Time to serialize properties into /tmp/LTL2689475168437971047.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8093195652587159597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2689475168437971047.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((next_13==0)||(ncs_5_5==0))")||(X(F((G("((next_10!=1)||(ncs_1_5!=1))"))||(("(((((slot_F.F.F.F.F.T.F.F.F!=1)||(p3_2_5!=1))&&((n...260
Formula 0 simplified : F(!"((next_13==0)||(ncs_5_5==0))" & XG(F!"((next_10!=1)||(ncs_1_5!=1))" & (!"(((((slot_F.F.F.F.F.T.F.F.F!=1)||(p3_2_5!=1))&&((next_1...246
Detected timeout of ITS tools.
[2025-05-29 19:27:01] [INFO ] Flatten gal took : 45 ms
[2025-05-29 19:27:01] [INFO ] Applying decomposition
[2025-05-29 19:27:01] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12286271540984380396.txt' '-o' '/tmp/graph12286271540984380396.bin' '-w' '/tmp/graph12286271540984380396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12286271540984380396.bin' '-l' '-1' '-v' '-w' '/tmp/graph12286271540984380396.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:27:01] [INFO ] Decomposing Gal with order
[2025-05-29 19:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:27:01] [INFO ] Removed a total of 1044 redundant transitions.
[2025-05-29 19:27:02] [INFO ] Flatten gal took : 329 ms
[2025-05-29 19:27:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 28 ms.
[2025-05-29 19:27:02] [INFO ] Time to serialize gal into /tmp/LTL504749039255775819.gal : 21 ms
[2025-05-29 19:27:02] [INFO ] Time to serialize properties into /tmp/LTL1598030046262342078.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL504749039255775819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1598030046262342078.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.i0.u6.next_13==0)||(i4.u30.ncs_5_5==0))")||(X(F((G("((i0.i0.u5.next_10!=1)||(i2.u13.ncs_1_5!=1))"))||(("(((((i7.i1.u139.sl...362
Formula 0 simplified : F(!"((i0.i0.u6.next_13==0)||(i4.u30.ncs_5_5==0))" & XG(F!"((i0.i0.u5.next_10!=1)||(i2.u13.ncs_1_5!=1))" & (!"(((((i7.i1.u139.slot_F....348
Detected timeout of ITS tools.
Treatment of property Anderson-PT-09-LTLFireability-02 finished in 404216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 383 transition count 819
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 311 transition count 819
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 290 transition count 494
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 290 transition count 494
Applied a total of 186 rules in 28 ms. Remains 290 /383 variables (removed 93) and now considering 494/891 (removed 397) transitions.
// Phase 1: matrix 494 rows 290 cols
[2025-05-29 19:27:17] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:17] [INFO ] Implicit Places using invariants in 521 ms returned []
[2025-05-29 19:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:27:19] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:27:19] [INFO ] Redundant transitions in 2 ms returned []
Running 485 sub problems to find dead transitions.
[2025-05-29 19:27:19] [INFO ] Invariant cache hit.
[2025-05-29 19:27:19] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:23] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:24] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:25] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:25] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:25] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:26] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:29] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:30] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:30] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:35] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:35] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:35] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:37] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:38] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:27:38] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 485 unsolved
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 290/383 places, 494/891 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32301 ms. Remains : 290/383 places, 494/891 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 32616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 383 transition count 819
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 311 transition count 819
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 290 transition count 494
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 290 transition count 494
Applied a total of 186 rules in 19 ms. Remains 290 /383 variables (removed 93) and now considering 494/891 (removed 397) transitions.
// Phase 1: matrix 494 rows 290 cols
[2025-05-29 19:27:49] [INFO ] Computed 21 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:50] [INFO ] Implicit Places using invariants in 328 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/383 places, 494/891 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 8 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2025-05-29 19:27:50] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:50] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-29 19:27:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:27:51] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/383 places, 414/891 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1273 ms. Remains : 209/383 places, 414/891 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 153 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 1521 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)||X(X(X(F(p1)))))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 383 transition count 819
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 311 transition count 819
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 291 transition count 511
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 291 transition count 511
Applied a total of 184 rules in 18 ms. Remains 291 /383 variables (removed 92) and now considering 511/891 (removed 380) transitions.
// Phase 1: matrix 511 rows 291 cols
[2025-05-29 19:27:51] [INFO ] Computed 21 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:51] [INFO ] Implicit Places using invariants in 320 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/383 places, 511/891 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 6 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2025-05-29 19:27:51] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:51] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-29 19:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:27:52] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/383 places, 432/891 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1482 ms. Remains : 211/383 places, 432/891 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 2 reset in 191 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), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/2 properties
[2025-05-29 19:27:53] [INFO ] Invariant cache hit.
[2025-05-29 19:27:53] [INFO ] State equation strengthened by 72 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 182/186 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/202 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 432/643 variables, 211/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/643 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 211/211 constraints, ReadFeed: 72/72 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 5.0 s and query timeout 500.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) 182/186 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/202 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 211/643 variables, and 20 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 211ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 2463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((X((!p2 U (!p3||G(!p2))))&&p1)))))'
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 383 transition count 819
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 311 transition count 819
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 163 place count 292 transition count 528
Iterating global reduction 0 with 19 rules applied. Total rules applied 182 place count 292 transition count 528
Applied a total of 182 rules in 21 ms. Remains 292 /383 variables (removed 91) and now considering 528/891 (removed 363) transitions.
// Phase 1: matrix 528 rows 292 cols
[2025-05-29 19:27:53] [INFO ] Computed 21 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:54] [INFO ] Implicit Places using invariants in 332 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/383 places, 528/891 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 291 transition count 467
Reduce places removed 61 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 130 place count 230 transition count 459
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 222 transition count 459
Applied a total of 138 rules in 10 ms. Remains 222 /291 variables (removed 69) and now considering 459/528 (removed 69) transitions.
// Phase 1: matrix 459 rows 222 cols
[2025-05-29 19:27:54] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:54] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-29 19:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:27:55] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 222/383 places, 459/891 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1222 ms. Remains : 222/383 places, 459/891 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p0) p1 p3 p2) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 33242 reset in 286 ms.
Product exploration explored 100000 steps with 33257 reset in 299 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 p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p0 p1)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)))), (X (OR (AND (NOT p0) p1) (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X p0), (X p1), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2))))), (X (X (OR (AND (NOT p0) p1) (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 119 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), false, false]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
[2025-05-29 19:27:56] [INFO ] Invariant cache hit.
[2025-05-29 19:27:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 201/209 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/214 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf10 is UNSAT
After SMT solving in domain Real declared 222/681 variables, and 20 constraints, problems are : Problem set: 3 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/222 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p3 p2))), (X (AND p0 p1)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)))), (X (OR (AND (NOT p0) p1) (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X p0), (X p1), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2))))), (X (X (OR (AND (NOT p0) p1) (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (G (OR (NOT p0) (NOT p1) p3 (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (G (AND (OR p0 (NOT p3) (NOT p2)) (OR p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p2))), (F (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (F (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p1 p3) (OR p1 p2)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F p2), (F (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (F p3), (F (NOT p0))]
Knowledge based reduction with 26 factoid took 563 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 222 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 459/459 transitions.
Applied a total of 0 rules in 8 ms. Remains 222 /222 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2025-05-29 19:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:57] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-29 19:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:27:57] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:27:57] [INFO ] Redundant transitions in 2 ms returned []
Running 450 sub problems to find dead transitions.
[2025-05-29 19:27:57] [INFO ] Invariant cache hit.
[2025-05-29 19:27:57] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:00] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:01] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:02] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:02] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:02] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:03] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:05] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:09] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:11] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 7 (OVERLAPS) 459/681 variables, 222/255 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 72/327 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:20] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 20 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/681 variables, and 328 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 222/222 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:28:42] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/681 variables, and 35 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/222 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/450 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61059 ms. Remains : 222/222 places, 459/459 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), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 17569 steps (3 resets) in 79 ms. (219 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 6972 steps with 0 reset with depth 6973 and stack size 5583 in 14 ms.
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 65315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(!p0)))&&F(!p1))||X(X(X((F(G(p2))||G(!p0)))))))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 364 transition count 600
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 364 transition count 600
Applied a total of 38 rules in 14 ms. Remains 364 /383 variables (removed 19) and now considering 600/891 (removed 291) transitions.
// Phase 1: matrix 600 rows 364 cols
[2025-05-29 19:28:59] [INFO ] Computed 21 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:59] [INFO ] Implicit Places using invariants in 366 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 367 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/383 places, 600/891 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 363/383 places, 600/891 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 199 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 (NOT p1) (NOT p0) p2), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/2 properties
BEST_FIRST walk for 29055 steps (5 resets) in 57 ms. (500 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Support contains 4 out of 363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 8 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 363 cols
[2025-05-29 19:29:01] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:01] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-29 19:29:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:29:03] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-29 19:29:03] [INFO ] Invariant cache hit.
[2025-05-29 19:29:03] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:09] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:10] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:10] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:12] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:12] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:13] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:15] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:15] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:15] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:16] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:16] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:16] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:29:25] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 35 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 35 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in LTL mode , in 1 iterations and 62523 ms. Remains : 363/363 places, 600/600 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 (NOT p0) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/2 properties
BEST_FIRST walk for 33590 steps (7 resets) in 33 ms. (987 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 178 ms.
Product exploration explored 100000 steps with 25000 reset in 192 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 363 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 79 place count 363 transition count 600
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 151 place count 363 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 152 place count 362 transition count 583
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 153 place count 362 transition count 583
Deduced a syphon composed of 151 places in 0 ms
Applied a total of 153 rules in 20 ms. Remains 362 /363 variables (removed 1) and now considering 583/600 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:30:05] [INFO ] Redundant transitions in 3 ms returned []
Running 574 sub problems to find dead transitions.
// Phase 1: matrix 583 rows 362 cols
[2025-05-29 19:30:05] [INFO ] Computed 20 invariants in 4 ms
[2025-05-29 19:30:05] [INFO ] State equation strengthened by 135 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 21 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 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 TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 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 TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 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 TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 15/35 constraints. Problems are: Problem set: 151 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:15] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/36 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/36 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 583/945 variables, 362/398 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/945 variables, 135/533 constraints. Problems are: Problem set: 151 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 945/945 variables, and 533 constraints, problems are : Problem set: 151 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 362/362 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 423 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 16/16 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/16 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 151/362 variables, 11/27 constraints. Problems are: Problem set: 151 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 9/36 constraints. Problems are: Problem set: 151 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:46] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:58] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:58] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:30:59] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/945 variables, and 40 constraints, problems are : Problem set: 151 solved, 423 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/362 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 0/574 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 151 solved, 423 unsolved
Search for dead transitions found 151 dead transitions in 60201ms
Found 151 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 151 transitions
Dead transitions reduction (with SMT) removed 151 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 362/363 places, 432/600 transitions.
Graph (complete) has 1142 edges and 362 vertex of which 211 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.0 ms
Discarding 151 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 211 /362 variables (removed 151) and now considering 432/432 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/363 places, 432/600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60238 ms. Remains : 211/363 places, 432/600 transitions.
Built C files in :
/tmp/ltsmin15627078916263657184
[2025-05-29 19:31:05] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15627078916263657184
Running compilation step : cd /tmp/ltsmin15627078916263657184;'/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 921 ms.
Running link step : cd /tmp/ltsmin15627078916263657184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15627078916263657184;'/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/stateBased3946088717488804653.hoa' '--buchi-type=spotba'
LTSmin run took 248 ms.
FORMULA Anderson-PT-09-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 127967 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 G(!p1))&&X(F(p2)))))'
Support contains 5 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 362 transition count 550
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 362 transition count 550
Applied a total of 42 rules in 11 ms. Remains 362 /383 variables (removed 21) and now considering 550/891 (removed 341) transitions.
// Phase 1: matrix 550 rows 362 cols
[2025-05-29 19:31:07] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:07] [INFO ] Implicit Places using invariants in 379 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/383 places, 550/891 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 361/383 places, 550/891 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09
Entered a terminal (fully accepting) state of product in 10193 steps with 1 reset in 15 ms.
FORMULA Anderson-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((!(X(p0) U !p1)&&!(p2 U p3))))))))'
Support contains 7 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 365 transition count 617
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 365 transition count 617
Applied a total of 36 rules in 13 ms. Remains 365 /383 variables (removed 18) and now considering 617/891 (removed 274) transitions.
// Phase 1: matrix 617 rows 365 cols
[2025-05-29 19:31:07] [INFO ] Computed 21 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:08] [INFO ] Implicit Places using invariants in 334 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 364/383 places, 617/891 transitions.
Applied a total of 0 rules in 3 ms. Remains 364 /364 variables (removed 0) and now considering 617/617 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 364/383 places, 617/891 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), (OR (NOT p1) p3), true, p3, (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLFireability-11 finished in 762 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(F((X(F(((p1 U p2)&&F(p3))))&&p0))))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 364 transition count 600
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 364 transition count 600
Applied a total of 38 rules in 14 ms. Remains 364 /383 variables (removed 19) and now considering 600/891 (removed 291) transitions.
// Phase 1: matrix 600 rows 364 cols
[2025-05-29 19:31:08] [INFO ] Computed 21 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:08] [INFO ] Implicit Places using invariants in 324 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/383 places, 600/891 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 363/383 places, 600/891 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p3), (NOT p2), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-12 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(!p0))||(!p1&&F(!p0)))))))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 362 transition count 566
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 362 transition count 566
Applied a total of 42 rules in 12 ms. Remains 362 /383 variables (removed 21) and now considering 566/891 (removed 325) transitions.
// Phase 1: matrix 566 rows 362 cols
[2025-05-29 19:31:09] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:09] [INFO ] Implicit Places using invariants in 455 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/383 places, 566/891 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 361/383 places, 566/891 transitions.
Stuttering acceptance computed with spot in 209 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 169 ms.
Product exploration explored 100000 steps with 20000 reset in 198 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 (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
// Phase 1: matrix 566 rows 361 cols
[2025-05-29 19:31:10] [INFO ] Computed 20 invariants in 3 ms
[2025-05-29 19:31:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.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) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 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 5.0 s and query timeout 500.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) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 361 transition count 503
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 298 transition count 495
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 290 transition count 495
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 290 transition count 424
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 284 place count 219 transition count 424
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 210 transition count 415
Applied a total of 302 rules in 15 ms. Remains 210 /361 variables (removed 151) and now considering 415/566 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/361 places, 415/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 49012 steps, run visited all 1 properties in 111 ms. (steps per millisecond=441 )
Probabilistic random walk after 49012 steps, saw 36171 distinct states, run finished after 125 ms. (steps per millisecond=392 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2025-05-29 19:31:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:13] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-05-29 19:31:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:31:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:31:15] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2025-05-29 19:31:15] [INFO ] Invariant cache hit.
[2025-05-29 19:31:15] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:21] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:22] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:24] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:24] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:28] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:31:34] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/927 variables, and 31 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 31 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 62406 ms. Remains : 361/361 places, 566/566 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 (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-05-29 19:32:15] [INFO ] Invariant cache hit.
[2025-05-29 19:32:15] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.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) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 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 5.0 s and query timeout 500.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) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/927 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 361 transition count 503
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 298 transition count 495
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 290 transition count 495
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 290 transition count 424
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 284 place count 219 transition count 424
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 210 transition count 415
Applied a total of 302 rules in 15 ms. Remains 210 /361 variables (removed 151) and now considering 415/566 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 210/361 places, 415/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 49012 steps, run visited all 1 properties in 113 ms. (steps per millisecond=433 )
Probabilistic random walk after 49012 steps, saw 36171 distinct states, run finished after 113 ms. (steps per millisecond=433 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 259 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 20000 reset in 170 ms.
Product exploration explored 100000 steps with 20000 reset in 176 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 265 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 361 transition count 566
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 71 place count 361 transition count 566
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 142 place count 361 transition count 566
Deduced a syphon composed of 142 places in 0 ms
Applied a total of 142 rules in 15 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 19:32:19] [INFO ] Redundant transitions in 2 ms returned []
Running 557 sub problems to find dead transitions.
// Phase 1: matrix 566 rows 361 cols
[2025-05-29 19:32:19] [INFO ] Computed 20 invariants in 7 ms
[2025-05-29 19:32:19] [INFO ] State equation strengthened by 134 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:22] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:25] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:25] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:26] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 23 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
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 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 TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 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 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 TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 15/35 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:29] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:30] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 2/37 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:35] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:35] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 2/39 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/41 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/41 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/927 variables, and 402 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 142 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 21/21 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 142/361 variables, 11/32 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 9/41 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 41 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 142 solved, 415 unsolved
Search for dead transitions found 142 dead transitions in 60168ms
Found 142 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 142 transitions
Dead transitions reduction (with SMT) removed 142 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 361/361 places, 424/566 transitions.
Graph (complete) has 1124 edges and 361 vertex of which 219 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 219 /361 variables (removed 142) and now considering 424/424 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 219/361 places, 424/566 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60199 ms. Remains : 219/361 places, 424/566 transitions.
Built C files in :
/tmp/ltsmin10586493102285092113
[2025-05-29 19:33:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10586493102285092113
Running compilation step : cd /tmp/ltsmin10586493102285092113;'/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 883 ms.
Running link step : cd /tmp/ltsmin10586493102285092113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10586493102285092113;'/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/stateBased3859722631421908993.hoa' '--buchi-type=spotba'
LTSmin run took 326 ms.
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 131452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 383 transition count 819
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 311 transition count 819
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 290 transition count 494
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 290 transition count 494
Applied a total of 186 rules in 19 ms. Remains 290 /383 variables (removed 93) and now considering 494/891 (removed 397) transitions.
// Phase 1: matrix 494 rows 290 cols
[2025-05-29 19:33:20] [INFO ] Computed 21 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:33:20] [INFO ] Implicit Places using invariants in 312 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/383 places, 494/891 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 6 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2025-05-29 19:33:20] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:33:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-29 19:33:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:33:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 19:33:21] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/383 places, 414/891 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1302 ms. Remains : 209/383 places, 414/891 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 1505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||p0)))))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 891/891 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 363 transition count 567
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 363 transition count 567
Applied a total of 40 rules in 12 ms. Remains 363 /383 variables (removed 20) and now considering 567/891 (removed 324) transitions.
// Phase 1: matrix 567 rows 363 cols
[2025-05-29 19:33:22] [INFO ] Computed 21 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:33:22] [INFO ] Implicit Places using invariants in 375 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 376 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/383 places, 567/891 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 362/383 places, 567/891 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 202 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 p1 p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 951 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((X(F(((!p1&&X(X(!p2)))||G(!p2))))||p0)))'
[2025-05-29 19:33:23] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17819359386899058489
[2025-05-29 19:33:23] [INFO ] Computing symmetric may disable matrix : 891 transitions.
[2025-05-29 19:33:23] [INFO ] Applying decomposition
[2025-05-29 19:33:23] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 19:33:23] [INFO ] Flatten gal took : 26 ms
[2025-05-29 19:33:23] [INFO ] Computing symmetric may enable matrix : 891 transitions.
[2025-05-29 19:33:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11992971735199852852.txt' '-o' '/tmp/graph11992971735199852852.bin' '-w' '/tmp/graph11992971735199852852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11992971735199852852.bin' '-l' '-1' '-v' '-w' '/tmp/graph11992971735199852852.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:33:23] [INFO ] Decomposing Gal with order
[2025-05-29 19:33:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:33:23] [INFO ] Removed a total of 1398 redundant transitions.
[2025-05-29 19:33:23] [INFO ] Flatten gal took : 69 ms
[2025-05-29 19:33:23] [INFO ] Computing Do-Not-Accords matrix : 891 transitions.
[2025-05-29 19:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 18 ms.
[2025-05-29 19:33:23] [INFO ] Time to serialize gal into /tmp/LTLFireability16895799097443974836.gal : 7 ms
[2025-05-29 19:33:23] [INFO ] Time to serialize properties into /tmp/LTLFireability15784651465262868372.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16895799097443974836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15784651465262868372.ltl' '-c' '-stutter-deadlock'
[2025-05-29 19:33:23] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
[2025-05-29 19:33:23] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17819359386899058489
Running compilation step : cd /tmp/ltsmin17819359386899058489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G(("((i2.u5.next_13==0)||(i5.u27.ncs_5_5==0))")||(X(F(((!("(((((i0.u0.slot_F.F.F.F.F.T.F.F.F==1)&&(i0.u0.p3_2_5==1))||((i2.u5.next_...345
Formula 0 simplified : F(!"((i2.u5.next_13==0)||(i5.u27.ncs_5_5==0))" & XG(F"((i2.u5.next_10==1)&&(i2.u15.ncs_1_5==1))" & ("(((((i0.u0.slot_F.F.F.F.F.T.F.F...319
Compilation finished in 2666 ms.
Running link step : cd /tmp/ltsmin17819359386899058489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17819359386899058489;'/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' '--ltl' '[]((X(<>(((!(LTLAPp1==true)&&X(X(!(LTLAPp2==true))))||[](!(LTLAPp2==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.084: LTL layer: formula: []((X(<>(((!(LTLAPp1==true)&&X(X(!(LTLAPp2==true))))||[](!(LTLAPp2==true)))))||(LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.084: "[]((X(<>(((!(LTLAPp1==true)&&X(X(!(LTLAPp2==true))))||[](!(LTLAPp2==true)))))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.088: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.127: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.131: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.226: There are 895 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.226: State length is 384, there are 909 groups
pins2lts-mc-linux64( 0/ 8), 0.226: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.226: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.226: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.226: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.309: [Blue] ~120 levels ~960 states ~2528 transitions
pins2lts-mc-linux64( 2/ 8), 0.354: [Blue] ~221 levels ~1920 states ~5008 transitions
pins2lts-mc-linux64( 3/ 8), 0.432: [Blue] ~450 levels ~3840 states ~9336 transitions
pins2lts-mc-linux64( 3/ 8), 0.550: [Blue] ~865 levels ~7680 states ~18712 transitions
pins2lts-mc-linux64( 3/ 8), 0.820: [Blue] ~1689 levels ~15360 states ~38272 transitions
pins2lts-mc-linux64( 3/ 8), 1.306: [Blue] ~3469 levels ~30720 states ~77752 transitions
pins2lts-mc-linux64( 3/ 8), 2.197: [Blue] ~6548 levels ~61440 states ~175200 transitions
pins2lts-mc-linux64( 7/ 8), 3.744: [Blue] ~12592 levels ~122880 states ~337560 transitions
pins2lts-mc-linux64( 1/ 8), 6.257: [Blue] ~25709 levels ~245760 states ~694976 transitions
pins2lts-mc-linux64( 1/ 8), 11.062: [Blue] ~52369 levels ~491520 states ~1384704 transitions
pins2lts-mc-linux64( 4/ 8), 20.009: [Blue] ~107668 levels ~983040 states ~2876528 transitions
pins2lts-mc-linux64( 4/ 8), 37.822: [Blue] ~214860 levels ~1966080 states ~5683240 transitions
pins2lts-mc-linux64( 4/ 8), 73.730: [Blue] ~423871 levels ~3932160 states ~11505152 transitions
pins2lts-mc-linux64( 4/ 8), 145.633: [Blue] ~840878 levels ~7864320 states ~23064048 transitions
pins2lts-mc-linux64( 3/ 8), 289.659: [Blue] ~1653845 levels ~15728640 states ~45407448 transitions
pins2lts-mc-linux64( 5/ 8), 557.745: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 557.798:
pins2lts-mc-linux64( 0/ 8), 557.798: Explored 29931125 states 88412780 transitions, fanout: 2.954
pins2lts-mc-linux64( 0/ 8), 557.798: Total exploration time 557.540 sec (557.490 sec minimum, 557.516 sec on average)
pins2lts-mc-linux64( 0/ 8), 557.798: States per second: 53684, Transitions per second: 158577
pins2lts-mc-linux64( 0/ 8), 557.798:
pins2lts-mc-linux64( 0/ 8), 557.798: State space has 44053711 states, 2786 are accepting
pins2lts-mc-linux64( 0/ 8), 557.798: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 557.798: blue states: 29931125 (67.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 557.798: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 557.798: all-red states: 3840 (0.01%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 557.798:
pins2lts-mc-linux64( 0/ 8), 557.798: Total memory used for local state coloring: 377.6MB
pins2lts-mc-linux64( 0/ 8), 557.798:
pins2lts-mc-linux64( 0/ 8), 557.798: Queue width: 8B, total height: 24743326, memory: 188.78MB
pins2lts-mc-linux64( 0/ 8), 557.798: Tree memory: 592.1MB, 14.1 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 557.798: Tree fill ratio (roots/leafs): 32.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 557.799: Stored 903 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 557.799: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 557.799: Est. total memory use: 780.9MB (~1212.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17819359386899058489;'/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' '--ltl' '[]((X(<>(((!(LTLAPp1==true)&&X(X(!(LTLAPp2==true))))||[](!(LTLAPp2==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17819359386899058489;'/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' '--ltl' '[]((X(<>(((!(LTLAPp1==true)&&X(X(!(LTLAPp2==true))))||[](!(LTLAPp2==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-29 19:58:39] [INFO ] Applying decomposition
[2025-05-29 19:58:39] [INFO ] Flatten gal took : 23 ms
[2025-05-29 19:58:39] [INFO ] Decomposing Gal with order
[2025-05-29 19:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:58:40] [INFO ] Removed a total of 1059 redundant transitions.
[2025-05-29 19:58:40] [INFO ] Flatten gal took : 77 ms
[2025-05-29 19:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 275 labels/synchronizations in 18 ms.
[2025-05-29 19:58:40] [INFO ] Time to serialize gal into /tmp/LTLFireability8620344386817275986.gal : 4 ms
[2025-05-29 19:58:40] [INFO ] Time to serialize properties into /tmp/LTLFireability5668562135075545267.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8620344386817275986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5668562135075545267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((u10.next_13==0)||(u2.ncs_5_5==0))")||(X(F(((!("(((((u11.slot_F.F.F.F.F.T.F.F.F==1)&&(u8.p3_2_5==1))||((u10.next_11==1)&&(u8.n...311
Formula 0 simplified : F(!"((u10.next_13==0)||(u2.ncs_5_5==0))" & XG(F"((u10.next_10==1)&&(u7.ncs_1_5==1))" & ("(((((u11.slot_F.F.F.F.F.T.F.F.F==1)&&(u8.p3...285
Reverse transition relation is NOT exact ! Due to transitions t20, t54, t173, t224, t309, t343, t428, t494, t503, t512, t521, t530, t539, t548, t557, t566,...779
26 unique states visited
0 strongly connected components in search stack
26 transitions explored
11 items max in DFS search stack
7730 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,77.3589,1459536,1,0,1.82205e+06,956314,4973,1.82695e+06,2814,6.64811e+06,8522675
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-09-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2557508 ms.

BK_STOP 1748548811468

--------------------
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="Anderson-PT-09"
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 Anderson-PT-09, 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 r002-tall-174853728800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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