Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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 1.6M 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-11-LTLFireability-00
FORMULA_NAME Anderson-PT-11-LTLFireability-01
FORMULA_NAME Anderson-PT-11-LTLFireability-02
FORMULA_NAME Anderson-PT-11-LTLFireability-03
FORMULA_NAME Anderson-PT-11-LTLFireability-04
FORMULA_NAME Anderson-PT-11-LTLFireability-05
FORMULA_NAME Anderson-PT-11-LTLFireability-06
FORMULA_NAME Anderson-PT-11-LTLFireability-07
FORMULA_NAME Anderson-PT-11-LTLFireability-08
FORMULA_NAME Anderson-PT-11-LTLFireability-09
FORMULA_NAME Anderson-PT-11-LTLFireability-10
FORMULA_NAME Anderson-PT-11-LTLFireability-11
FORMULA_NAME Anderson-PT-11-LTLFireability-12
FORMULA_NAME Anderson-PT-11-LTLFireability-13
FORMULA_NAME Anderson-PT-11-LTLFireability-14
FORMULA_NAME Anderson-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748551909814

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 20:51:51] [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 20:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:51:51] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-29 20:51:51] [INFO ] Transformed 749 places.
[2025-05-29 20:51:51] [INFO ] Transformed 3245 transitions.
[2025-05-29 20:51:51] [INFO ] Found NUPN structural information;
[2025-05-29 20:51:51] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 557 transition count 1293
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 557 transition count 1293
Applied a total of 384 rules in 109 ms. Remains 557 /749 variables (removed 192) and now considering 1293/3245 (removed 1952) transitions.
// Phase 1: matrix 1293 rows 557 cols
[2025-05-29 20:51:51] [INFO ] Computed 25 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:51:52] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-05-29 20:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:51:52] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:51:56] [INFO ] Implicit Places using invariants and state equation in 4213 ms returned []
Implicit Place search using SMT with State Equation took 4975 ms to find 0 implicit places.
Running 1282 sub problems to find dead transitions.
[2025-05-29 20:51:56] [INFO ] Invariant cache hit.
[2025-05-29 20:51:56] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:10] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:10] [INFO ] Deduced a trap composed of 77 places in 299 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:11] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:12] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:12] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:12] [INFO ] Deduced a trap composed of 101 places in 332 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:13] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:13] [INFO ] Deduced a trap composed of 55 places in 281 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:13] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:14] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:14] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:15] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:16] [INFO ] Deduced a trap composed of 64 places in 329 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:16] [INFO ] Deduced a trap composed of 64 places in 334 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:16] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:17] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:18] [INFO ] Deduced a trap composed of 66 places in 347 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:19] [INFO ] Deduced a trap composed of 79 places in 312 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:20] [INFO ] Deduced a trap composed of 113 places in 330 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:20] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 65 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:22] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:23] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:23] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:23] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:24] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:24] [INFO ] Deduced a trap composed of 66 places in 299 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:25] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:25] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:25] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:26] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:27] [INFO ] Deduced a trap composed of 93 places in 313 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:27] [INFO ] Deduced a trap composed of 77 places in 301 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:27] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 57 ms to minimize.
SMT process timed out in 31329ms, After SMT, problems are : Problem set: 0 solved, 1282 unsolved
Search for dead transitions found 0 dead transitions in 31347ms
Starting structural reductions in LTL mode, iteration 1 : 557/749 places, 1293/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36454 ms. Remains : 557/749 places, 1293/3245 transitions.
Support contains 44 out of 557 places after structural reductions.
[2025-05-29 20:52:28] [INFO ] Flatten gal took : 114 ms
[2025-05-29 20:52:28] [INFO ] Flatten gal took : 79 ms
[2025-05-29 20:52:28] [INFO ] Input system was already deterministic with 1293 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 2860 ms. (13 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
[2025-05-29 20:52:29] [INFO ] Invariant cache hit.
[2025-05-29 20:52:29] [INFO ] State equation strengthened by 110 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 509/533 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/546 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 11/557 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:30] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 61 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:30] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:31] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 62 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1293/1850 variables, 557/585 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1850 variables, 110/695 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1850 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/1850 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1850/1850 variables, and 695 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4881 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 557/557 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 509/533 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/546 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 11/557 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:35] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 63 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:36] [INFO ] Deduced a trap composed of 64 places in 318 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:36] [INFO ] Deduced a trap composed of 137 places in 269 ms of which 46 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:36] [INFO ] Deduced a trap composed of 64 places in 329 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:37] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:37] [INFO ] Deduced a trap composed of 64 places in 307 ms of which 62 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1293/1850 variables, 557/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1850 variables, 110/701 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1850/1850 variables, and 715 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 557/557 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9949ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 106 Pre rules applied. Total rules applied 0 place count 557 transition count 1187
Deduced a syphon composed of 106 places in 2 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 0 with 212 rules applied. Total rules applied 212 place count 451 transition count 1187
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 225 place count 438 transition count 954
Iterating global reduction 0 with 13 rules applied. Total rules applied 238 place count 438 transition count 954
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 246 place count 434 transition count 950
Applied a total of 246 rules in 132 ms. Remains 434 /557 variables (removed 123) and now considering 950/1293 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 434/557 places, 950/1293 transitions.
RANDOM walk for 40000 steps (8 resets) in 500 ms. (79 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
// Phase 1: matrix 950 rows 434 cols
[2025-05-29 20:52:40] [INFO ] Computed 25 invariants in 23 ms
[2025-05-29 20:52:40] [INFO ] State equation strengthened by 110 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 396/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 13/422 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/434 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 950/1384 variables, 434/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1384 variables, 110/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1384 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1384 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 569 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 434/434 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 396/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 13/422 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/434 variables, 12/25 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 20:52:42] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:42] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:43] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 46 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 3/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 20:52:43] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:43] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 35 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 2/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 20:52:44] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:44] [INFO ] Deduced a trap composed of 78 places in 228 ms of which 44 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 950/1384 variables, 434/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1384 variables, 110/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1384 variables, 9/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1384 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1384 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1384/1384 variables, and 585 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8299 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 434/434 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9943ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 13 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 950/950 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 429 transition count 845
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 429 transition count 845
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 428 transition count 844
Applied a total of 12 rules in 70 ms. Remains 428 /434 variables (removed 6) and now considering 844/950 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 428/434 places, 844/950 transitions.
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 232398 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :1 out of 9
Probabilistic random walk after 232398 steps, saw 174956 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :1
// Phase 1: matrix 844 rows 428 cols
[2025-05-29 20:52:53] [INFO ] Computed 25 invariants in 9 ms
[2025-05-29 20:52:53] [INFO ] State equation strengthened by 110 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 390/402 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/416 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/428 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:54] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 42 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:54] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 42 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:54] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 37 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:55] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 43 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 844/1272 variables, 428/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1272 variables, 110/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1272 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1272 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 567 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 428/428 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 390/402 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/416 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/428 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:56] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:52:57] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 42 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 844/1272 variables, 428/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1272 variables, 110/569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1272 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1272 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1272 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 577 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 428/428 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8699ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 844/844 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 427 transition count 843
Applied a total of 2 rules in 44 ms. Remains 427 /428 variables (removed 1) and now considering 843/844 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 427/428 places, 843/844 transitions.
RANDOM walk for 40000 steps (8 resets) in 433 ms. (92 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 226511 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 8
Probabilistic random walk after 226511 steps, saw 170755 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 843 rows 427 cols
[2025-05-29 20:53:05] [INFO ] Computed 25 invariants in 10 ms
[2025-05-29 20:53:05] [INFO ] State equation strengthened by 110 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 389/401 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/415 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/427 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 843/1270 variables, 427/452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1270 variables, 110/562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1270 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1270 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 562 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 427/427 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 389/401 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/415 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/427 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:07] [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 20:53:08] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 43 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:08] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:08] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:08] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 843/1270 variables, 427/457 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1270 variables, 110/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1270 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1270 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1270 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1270/1270 variables, and 575 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6700 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 427/427 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7980ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1488 ms.
Support contains 12 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 843/843 transitions.
Applied a total of 0 rules in 20 ms. Remains 427 /427 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 427/427 places, 843/843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 843/843 transitions.
Applied a total of 0 rules in 25 ms. Remains 427 /427 variables (removed 0) and now considering 843/843 (removed 0) transitions.
[2025-05-29 20:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:53:16] [INFO ] Implicit Places using invariants in 639 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 641 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/427 places, 843/843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 426 transition count 728
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 311 transition count 728
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 236 place count 311 transition count 722
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 242 place count 305 transition count 722
Applied a total of 242 rules in 33 ms. Remains 305 /426 variables (removed 121) and now considering 722/843 (removed 121) transitions.
// Phase 1: matrix 722 rows 305 cols
[2025-05-29 20:53:16] [INFO ] Computed 24 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:53:16] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-29 20:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:53:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:53:17] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 305/427 places, 722/843 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2355 ms. Remains : 305/427 places, 722/843 transitions.
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
[2025-05-29 20:53:17] [INFO ] Invariant cache hit.
[2025-05-29 20:53:17] [INFO ] State equation strengthened by 110 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 280/291 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/295 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/305 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:18] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:18] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:18] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 722/1027 variables, 305/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 110/442 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1027 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 442 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 305/305 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 280/291 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/295 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/305 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:19] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:19] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 722/1027 variables, 305/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 110/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 7/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1027 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1027 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1027/1027 variables, and 451 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 305/305 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4007ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1705 ms.
Support contains 11 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 722/722 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 304 transition count 721
Applied a total of 2 rules in 15 ms. Remains 304 /305 variables (removed 1) and now considering 721/722 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 304/305 places, 721/722 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 272434 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :2 out of 7
Probabilistic random walk after 272434 steps, saw 201604 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :2
// Phase 1: matrix 721 rows 304 cols
[2025-05-29 20:53:26] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 20:53:26] [INFO ] State equation strengthened by 110 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 268/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/282 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/304 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:27] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 721/1025 variables, 304/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 110/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1025 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1025 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 439 constraints, problems are : Problem set: 0 solved, 5 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 304/304 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 268/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/282 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/304 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:27] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 721/1025 variables, 304/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1025 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1025 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1025 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1025 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 445 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 304/304 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 301 ms.
Support contains 9 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 721/721 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 303 transition count 700
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 303 transition count 700
Applied a total of 2 rules in 15 ms. Remains 303 /304 variables (removed 1) and now considering 700/721 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 303/304 places, 700/721 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 334374 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :1 out of 5
Probabilistic random walk after 334374 steps, saw 252070 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :1
// Phase 1: matrix 700 rows 303 cols
[2025-05-29 20:53:33] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 20:53:33] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 267/275 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/281 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/302 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 700/1003 variables, 303/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1003 variables, 110/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1003 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1003 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 437 constraints, problems are : Problem set: 0 solved, 4 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 303/303 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 267/275 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/281 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/302 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:33] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:34] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:34] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/303 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:34] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 28 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 700/1003 variables, 303/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 110/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1003 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 445 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 303/303 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2952ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 282 ms.
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 700/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 302 transition count 679
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 302 transition count 679
Applied a total of 2 rules in 13 ms. Remains 302 /303 variables (removed 1) and now considering 679/700 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 302/303 places, 679/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 355160 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :1 out of 4
Probabilistic random walk after 355160 steps, saw 269939 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :1
// Phase 1: matrix 679 rows 302 cols
[2025-05-29 20:53:39] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 20:53:39] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/280 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/301 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 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 20:53:39] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 679/981 variables, 302/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 110/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/981 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 437 constraints, problems are : Problem set: 0 solved, 3 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/280 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/301 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/25 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 20:53:40] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 30 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 679/981 variables, 302/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 110/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/981 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/981 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1961ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 225 ms.
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 679/679 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 301 transition count 658
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 301 transition count 658
Applied a total of 2 rules in 13 ms. Remains 301 /302 variables (removed 1) and now considering 658/679 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 301/302 places, 658/679 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 375757 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 3
Probabilistic random walk after 375757 steps, saw 287402 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 658 rows 301 cols
[2025-05-29 20:53:44] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 20:53:44] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 266/272 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/279 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/300 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 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 20:53:45] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:45] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 658/959 variables, 301/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/959 variables, 110/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/959 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 959/959 variables, and 437 constraints, problems are : Problem set: 0 solved, 3 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 301/301 constraints, ReadFeed: 110/110 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 165.0 s and query timeout 16500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 266/272 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/279 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/300 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 658/959 variables, 301/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/959 variables, 110/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/959 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/959 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 959/959 variables, and 440 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 301/301 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 239 ms.
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 658/658 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 301/301 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 658/658 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2025-05-29 20:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:53:47] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-29 20:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:53:47] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:53:48] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:53:48] [INFO ] Redundant transitions in 38 ms returned []
Running 647 sub problems to find dead transitions.
[2025-05-29 20:53:48] [INFO ] Invariant cache hit.
[2025-05-29 20:53:48] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 647 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:52] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:54] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:54] [INFO ] Deduced a trap composed of 43 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 20:53:55] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 647 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:53:59] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:00] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:00] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:01] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:01] [INFO ] Deduced a trap composed of 43 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 20:54:01] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:02] [INFO ] Deduced a trap composed of 44 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 20:54:02] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 647 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:07] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:08] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:09] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:09] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:10] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:11] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 647 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 647 unsolved
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 0 solved, 647 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31880 ms. Remains : 301/301 places, 658/658 transitions.
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-11-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(((X(p0) U p1)&&F(X(p2))))'
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 532 transition count 848
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 532 transition count 848
Applied a total of 50 rules in 22 ms. Remains 532 /557 variables (removed 25) and now considering 848/1293 (removed 445) transitions.
// Phase 1: matrix 848 rows 532 cols
[2025-05-29 20:54:19] [INFO ] Computed 25 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:20] [INFO ] Implicit Places using invariants in 644 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 645 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/557 places, 848/1293 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 683 ms. Remains : 531/557 places, 848/1293 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-00 finished in 1251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 557 transition count 1184
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 448 transition count 1184
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 244 place count 422 transition count 738
Iterating global reduction 0 with 26 rules applied. Total rules applied 270 place count 422 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 421 transition count 737
Applied a total of 272 rules in 88 ms. Remains 421 /557 variables (removed 136) and now considering 737/1293 (removed 556) transitions.
// Phase 1: matrix 737 rows 421 cols
[2025-05-29 20:54:20] [INFO ] Computed 25 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:21] [INFO ] Implicit Places using invariants in 544 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/557 places, 737/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 420 transition count 617
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 300 transition count 617
Applied a total of 240 rules in 14 ms. Remains 300 /420 variables (removed 120) and now considering 617/737 (removed 120) transitions.
// Phase 1: matrix 617 rows 300 cols
[2025-05-29 20:54:21] [INFO ] Computed 24 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:21] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-05-29 20:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:54:23] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 300/557 places, 617/1293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2431 ms. Remains : 300/557 places, 617/1293 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 2671 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(p0))||(F(G(X(p1)))&&X(p1))))'
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 531 transition count 867
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 531 transition count 867
Applied a total of 52 rules in 23 ms. Remains 531 /557 variables (removed 26) and now considering 867/1293 (removed 426) transitions.
// Phase 1: matrix 867 rows 531 cols
[2025-05-29 20:54:23] [INFO ] Computed 25 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:23] [INFO ] Implicit Places using invariants in 620 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 621 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/557 places, 867/1293 transitions.
Applied a total of 0 rules in 9 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 530/557 places, 867/1293 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 289 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 32 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-02 finished in 1467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1))||(p0&&(p2 U (p3||G(p2)))))))'
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 533 transition count 869
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 533 transition count 869
Applied a total of 48 rules in 21 ms. Remains 533 /557 variables (removed 24) and now considering 869/1293 (removed 424) transitions.
// Phase 1: matrix 869 rows 533 cols
[2025-05-29 20:54:24] [INFO ] Computed 25 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:25] [INFO ] Implicit Places using invariants in 584 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 587 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/557 places, 869/1293 transitions.
Applied a total of 0 rules in 10 ms. Remains 532 /532 variables (removed 0) and now considering 869/869 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 618 ms. Remains : 532/557 places, 869/1293 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 276 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) p3 p2 p0), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X p3), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 1389 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(G(p0)) U !p1) U (X((F(p2)||p2)) U p0))))'
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 531 transition count 867
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 531 transition count 867
Applied a total of 52 rules in 24 ms. Remains 531 /557 variables (removed 26) and now considering 867/1293 (removed 426) transitions.
// Phase 1: matrix 867 rows 531 cols
[2025-05-29 20:54:26] [INFO ] Computed 25 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:26] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-05-29 20:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:27] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:54:29] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
Running 856 sub problems to find dead transitions.
[2025-05-29 20:54:29] [INFO ] Invariant cache hit.
[2025-05-29 20:54:29] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:38] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:40] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:41] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:42] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:42] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:42] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:42] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:43] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:43] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:44] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:44] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:44] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:45] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:49] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:50] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:51] [INFO ] Deduced a trap composed of 77 places in 230 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:51] [INFO ] Deduced a trap composed of 77 places in 248 ms of which 48 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:54] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1398 variables, and 43 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1398 variables, and 43 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 531/557 places, 867/1293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64049 ms. Remains : 531/557 places, 867/1293 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND p0 p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 8 reset in 236 ms.
Stack based approach found an accepted trace after 529 steps with 1 reset with depth 174 and stack size 174 in 4 ms.
FORMULA Anderson-PT-11-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-04 finished in 64575 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 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 557 transition count 1183
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 447 transition count 1183
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 421 transition count 757
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 421 transition count 757
Applied a total of 272 rules in 34 ms. Remains 421 /557 variables (removed 136) and now considering 757/1293 (removed 536) transitions.
// Phase 1: matrix 757 rows 421 cols
[2025-05-29 20:55:30] [INFO ] Computed 25 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:31] [INFO ] Implicit Places using invariants in 583 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 586 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/557 places, 757/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 22 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2025-05-29 20:55:31] [INFO ] Computed 24 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:31] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-29 20:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:31] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:55:33] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/557 places, 638/1293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2725 ms. Remains : 301/557 places, 638/1293 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 130 steps with 0 reset with depth 131 and stack size 131 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-05 finished in 3056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (G((X(G(p2)) U !p3))&&p1)))'
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 532 transition count 888
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 532 transition count 888
Applied a total of 50 rules in 23 ms. Remains 532 /557 variables (removed 25) and now considering 888/1293 (removed 405) transitions.
// Phase 1: matrix 888 rows 532 cols
[2025-05-29 20:55:33] [INFO ] Computed 25 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:34] [INFO ] Implicit Places using invariants in 583 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 587 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/557 places, 888/1293 transitions.
Applied a total of 0 rules in 9 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 531/557 places, 888/1293 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND p1 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 1 reset in 180 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 p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 101 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p1 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 20:55:35] [INFO ] Computed 24 invariants in 4 ms
[2025-05-29 20:55:35] [INFO ] State equation strengthened by 110 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 497/501 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/521 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/14 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 20:55:35] [INFO ] Deduced a trap composed of 385 places in 363 ms of which 178 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 7 (OVERLAPS) 10/531 variables, 10/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:36] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 57 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 888/1419 variables, 531/557 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1419 variables, 110/667 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1419 variables, 0/667 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1419 variables, 0/667 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 667 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/531 variables, 11/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 888/1419 variables, 531/557 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 110/667 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1419 variables, 1/668 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1419 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1419 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 668 constraints, problems are : Problem set: 2 solved, 1 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2154ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 531 transition count 768
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 411 transition count 768
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 411 transition count 658
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 301 transition count 658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 462 place count 299 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 465 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 466 place count 298 transition count 615
Applied a total of 466 rules in 29 ms. Remains 298 /531 variables (removed 233) and now considering 615/888 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 298/531 places, 615/888 transitions.
RANDOM walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982286 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982286 steps, saw 729177 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2025-05-29 20:55:40] [INFO ] Computed 24 invariants in 10 ms
[2025-05-29 20:55:40] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 615/913 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 615/913 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2025-05-29 20:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:41] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-29 20:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:55:43] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:55:43] [INFO ] Redundant transitions in 9 ms returned []
Running 604 sub problems to find dead transitions.
[2025-05-29 20:55:43] [INFO ] Invariant cache hit.
[2025-05-29 20:55:43] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:47] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:48] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:49] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:53] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:53] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:01] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:01] [INFO ] Deduced a trap composed of 43 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 20:56:01] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:01] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:02] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 6 (OVERLAPS) 615/913 variables, 298/332 constraints. Problems are: Problem set: 0 solved, 604 unsolved
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31719 ms. Remains : 298/298 places, 615/615 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 9 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2025-05-29 20:56:13] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 20:56:13] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 20:56:13] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2025-05-29 20:56:13] [INFO ] After 201ms 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 20:56:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 20:56:13] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2025-05-29 20:56:13] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:56:13] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:56:13] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 456 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT p2)), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (G (OR (NOT p3) (NOT p2))), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p3))), (F p0), (F (NOT (OR p3 (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 19 factoid took 294 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 13 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 20:56:14] [INFO ] Computed 24 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:14] [INFO ] Implicit Places using invariants in 461 ms returned []
[2025-05-29 20:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:56:17] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-05-29 20:56:17] [INFO ] Invariant cache hit.
[2025-05-29 20:56:17] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:27] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:30] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:30] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:30] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:31] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:31] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:31] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:31] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:32] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:32] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:33] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:36] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:38] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:41] [INFO ] Deduced a trap composed of 101 places in 231 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:42] [INFO ] Deduced a trap composed of 89 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:42] [INFO ] Deduced a trap composed of 89 places in 271 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:56:43] [INFO ] Deduced a trap composed of 77 places in 257 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 41 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 41 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in LTL mode , in 1 iterations and 63722 ms. Remains : 531/531 places, 888/888 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) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-05-29 20:57:18] [INFO ] Invariant cache hit.
[2025-05-29 20:57:18] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 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 20:57:18] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 51 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 888/1419 variables, 531/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 110/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 888/1419 variables, 531/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 110/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1419 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1419 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 667 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 531 transition count 768
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 411 transition count 768
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 411 transition count 658
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 301 transition count 658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 462 place count 299 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 465 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 466 place count 298 transition count 615
Applied a total of 466 rules in 25 ms. Remains 298 /531 variables (removed 233) and now considering 615/888 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 298/531 places, 615/888 transitions.
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982892 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982892 steps, saw 729645 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
// Phase 1: matrix 615 rows 298 cols
[2025-05-29 20:57:23] [INFO ] Computed 24 invariants in 9 ms
[2025-05-29 20:57:23] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 615/913 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 615/913 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/913 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 7 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2025-05-29 20:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:24] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-29 20:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:57:25] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:57:25] [INFO ] Redundant transitions in 11 ms returned []
Running 604 sub problems to find dead transitions.
[2025-05-29 20:57:25] [INFO ] Invariant cache hit.
[2025-05-29 20:57:25] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:30] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:31] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:32] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:35] [INFO ] Deduced a trap composed of 43 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 20:57:36] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:43] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:44] [INFO ] Deduced a trap composed of 43 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 20:57:44] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:44] [INFO ] Deduced a trap composed of 43 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 20:57:44] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 615/913 variables, 298/332 constraints. Problems are: Problem set: 0 solved, 604 unsolved
SMT process timed out in 30178ms, After SMT, problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31656 ms. Remains : 298/298 places, 615/615 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 8 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2025-05-29 20:57:55] [INFO ] Computed 24 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 20:57:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 20:57:55] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2025-05-29 20:57:56] [INFO ] After 178ms 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 20:57:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 20:57:56] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2025-05-29 20:57:56] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:57:56] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 20:57: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 413 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p0)), (X (NOT p3)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0)]
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 171 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (OR (NOT p3) p2), p2]
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 118 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 228 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Applied a total of 228 rules in 37 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:57:57] [INFO ] Redundant transitions in 8 ms returned []
Running 877 sub problems to find dead transitions.
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 20:57:57] [INFO ] Computed 24 invariants in 6 ms
[2025-05-29 20:57:57] [INFO ] State equation strengthened by 209 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:05] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:05] [INFO ] Deduced a trap composed of 24 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 20:58:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:06] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:07] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:07] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:07] [INFO ] Deduced a trap composed of 24 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 20:58:08] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:09] [INFO ] Deduced a trap composed of 24 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 20:58:10] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:11] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:11] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:12] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:12] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 37 ms to minimize.
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 TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 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 TDEAD445 is UNSAT
Problem TDEAD446 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 TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/44 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:14] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:14] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:15] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:15] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:16] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:19] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 37 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 6/50 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 50 constraints, problems are : Problem set: 228 solved, 649 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 26/26 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/26 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 228/531 variables, 13/39 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 11/50 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:46] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:48] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:52] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 53 constraints, problems are : Problem set: 228 solved, 649 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 228 solved, 649 unsolved
Search for dead transitions found 228 dead transitions in 60352ms
Found 228 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 228 transitions
Dead transitions reduction (with SMT) removed 228 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 531/531 places, 660/888 transitions.
Graph (complete) has 1715 edges and 531 vertex of which 303 are kept as prefixes of interest. Removing 228 places using SCC suffix rule.2 ms
Discarding 228 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 303 /531 variables (removed 228) and now considering 660/660 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 303/531 places, 660/888 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60423 ms. Remains : 303/531 places, 660/888 transitions.
Built C files in :
/tmp/ltsmin5392426896047597287
[2025-05-29 20:58:57] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5392426896047597287
Running compilation step : cd /tmp/ltsmin5392426896047597287;'/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 1468 ms.
Running link step : cd /tmp/ltsmin5392426896047597287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin5392426896047597287;'/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/stateBased17566421353148615225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 22 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 20:59:13] [INFO ] Computed 24 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:13] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-05-29 20:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 20:59:16] [INFO ] Implicit Places using invariants and state equation in 2983 ms returned []
Implicit Place search using SMT with State Equation took 3450 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-05-29 20:59:16] [INFO ] Invariant cache hit.
[2025-05-29 20:59:16] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:26] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:28] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:28] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:29] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:29] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:29] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:30] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:30] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:30] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:31] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:31] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:34] [INFO ] Deduced a trap composed of 77 places in 250 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:36] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:40] [INFO ] Deduced a trap composed of 101 places in 230 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:40] [INFO ] Deduced a trap composed of 89 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:41] [INFO ] Deduced a trap composed of 89 places in 251 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:42] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 41 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 41 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in LTL mode , in 1 iterations and 63772 ms. Remains : 531/531 places, 888/888 transitions.
Built C files in :
/tmp/ltsmin8645040271338258393
[2025-05-29 21:00:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8645040271338258393
Running compilation step : cd /tmp/ltsmin8645040271338258393;'/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 1514 ms.
Running link step : cd /tmp/ltsmin8645040271338258393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8645040271338258393;'/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/stateBased3210710295430102117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:00:32] [INFO ] Flatten gal took : 32 ms
[2025-05-29 21:00:32] [INFO ] Flatten gal took : 31 ms
[2025-05-29 21:00:32] [INFO ] Time to serialize gal into /tmp/LTL353469659742595926.gal : 8 ms
[2025-05-29 21:00:32] [INFO ] Time to serialize properties into /tmp/LTL15008686321165075685.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/LTL353469659742595926.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8921375625809813657.hoa' '-atoms' '/tmp/LTL15008686321165075685.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...317
Loading property file /tmp/LTL15008686321165075685.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8921375625809813657.hoa
Detected timeout of ITS tools.
[2025-05-29 21:00:47] [INFO ] Flatten gal took : 29 ms
[2025-05-29 21:00:47] [INFO ] Flatten gal took : 28 ms
[2025-05-29 21:00:47] [INFO ] Time to serialize gal into /tmp/LTL10802786381003747024.gal : 6 ms
[2025-05-29 21:00:47] [INFO ] Time to serialize properties into /tmp/LTL2475026372505699421.ltl : 4 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/LTL10802786381003747024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2475026372505699421.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...276
Read 1 LTL properties
Checking formula 0 : !((!((!("((next_11==1)&&(ncs_1_8==1))"))U(((G((X(G("((next_4==1)&&(ncs_3_6==1))")))U(!("((next_19==1)&&(ncs_6_5==1))"))))&&("(next_4==...182
Formula 0 simplified : !"((next_11==1)&&(ncs_1_8==1))" U ("(ncs_3_6==1)" & "(next_4==1)" & G(!"((next_19==1)&&(ncs_6_5==1))" | X(!"((next_19==1)&&(ncs_6_5=...196
Detected timeout of ITS tools.
[2025-05-29 21:01:02] [INFO ] Flatten gal took : 25 ms
[2025-05-29 21:01:02] [INFO ] Applying decomposition
[2025-05-29 21:01:02] [INFO ] Flatten gal took : 25 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/graph16899021796932378269.txt' '-o' '/tmp/graph16899021796932378269.bin' '-w' '/tmp/graph16899021796932378269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16899021796932378269.bin' '-l' '-1' '-v' '-w' '/tmp/graph16899021796932378269.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:01:02] [INFO ] Decomposing Gal with order
[2025-05-29 21:01:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:01:02] [INFO ] Removed a total of 1543 redundant transitions.
[2025-05-29 21:01:02] [INFO ] Flatten gal took : 119 ms
[2025-05-29 21:01:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 41 ms.
[2025-05-29 21:01:02] [INFO ] Time to serialize gal into /tmp/LTL14886286433377898251.gal : 16 ms
[2025-05-29 21:01:02] [INFO ] Time to serialize properties into /tmp/LTL16769091949559784217.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/LTL14886286433377898251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16769091949559784217.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...256
Read 1 LTL properties
Checking formula 0 : !((!((!("((i0.i0.i0.u4.next_11==1)&&(i0.i0.i0.u16.ncs_1_8==1))"))U(((G((X(G("((i0.i1.i0.u1.next_4==1)&&(i2.u29.ncs_3_6==1))")))U(!("((...265
Formula 0 simplified : !"((i0.i0.i0.u4.next_11==1)&&(i0.i0.i0.u16.ncs_1_8==1))" U ("(i0.i1.i0.u1.next_4==1)" & "(i2.u29.ncs_3_6==1)" & G(!"((i0.i0.i1.u8.ne...299
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 344128 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 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 557 transition count 1184
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 448 transition count 1184
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 244 place count 422 transition count 738
Iterating global reduction 0 with 26 rules applied. Total rules applied 270 place count 422 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 421 transition count 737
Applied a total of 272 rules in 43 ms. Remains 421 /557 variables (removed 136) and now considering 737/1293 (removed 556) transitions.
// Phase 1: matrix 737 rows 421 cols
[2025-05-29 21:01:17] [INFO ] Computed 25 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:18] [INFO ] Implicit Places using invariants in 632 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 635 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/557 places, 737/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 420 transition count 617
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 300 transition count 617
Applied a total of 240 rules in 11 ms. Remains 300 /420 variables (removed 120) and now considering 617/737 (removed 120) transitions.
// Phase 1: matrix 617 rows 300 cols
[2025-05-29 21:01:18] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:18] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-29 21:01:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:01:20] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 300/557 places, 617/1293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2110 ms. Remains : 300/557 places, 617/1293 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 166 ms.
Stack based approach found an accepted trace after 165 steps with 0 reset with depth 166 and stack size 166 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 2341 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((p0&&(X(!p1) U ((X(!p1)&&(G(p2) U p1))||X(G(!p1))))))))'
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 531 transition count 867
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 531 transition count 867
Applied a total of 52 rules in 26 ms. Remains 531 /557 variables (removed 26) and now considering 867/1293 (removed 426) transitions.
// Phase 1: matrix 867 rows 531 cols
[2025-05-29 21:01:20] [INFO ] Computed 25 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:20] [INFO ] Implicit Places using invariants in 623 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/557 places, 867/1293 transitions.
Applied a total of 0 rules in 9 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 659 ms. Remains : 530/557 places, 867/1293 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, p1, (OR (NOT p0) p1), (AND (NOT p2) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 276 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) p0 (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p2), (AND (NOT p2) p1), p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/6 properties
// Phase 1: matrix 867 rows 530 cols
[2025-05-29 21:01:22] [INFO ] Computed 24 invariants in 4 ms
[2025-05-29 21:01:22] [INFO ] State equation strengthened by 110 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) 495/499 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/519 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 530/1397 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (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 p1), (F (NOT (OR (NOT p1) p2))), (F p2)]
Knowledge based reduction with 8 factoid took 276 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 155 ms :[true, p1, p1, p1, p1]
Support contains 2 out of 530 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 867/867 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
[2025-05-29 21:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:23] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-05-29 21:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:01:26] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned []
Implicit Place search using SMT with State Equation took 3598 ms to find 0 implicit places.
Running 856 sub problems to find dead transitions.
[2025-05-29 21:01:26] [INFO ] Invariant cache hit.
[2025-05-29 21:01:26] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:35] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:38] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:43] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:44] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:45] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:46] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:48] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:50] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:50] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:53] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:56] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1397 variables, and 35 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:07] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:08] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1397 variables, and 37 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Finished structural reductions in LTL mode , in 1 iterations and 63890 ms. Remains : 530/530 places, 867/867 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 : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 129914 steps, run visited all 1 properties in 357 ms. (steps per millisecond=363 )
Probabilistic random walk after 129914 steps, saw 101429 distinct states, run finished after 360 ms. (steps per millisecond=360 ) properties seen :1
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 182 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 179 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[true, p1, p1, p1, p1]
Support contains 2 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 867/867 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 530 transition count 867
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 120 place count 530 transition count 867
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 230 place count 530 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 231 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 232 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Applied a total of 232 rules in 38 ms. Remains 529 /530 variables (removed 1) and now considering 846/867 (removed 21) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:02:29] [INFO ] Redundant transitions in 8 ms returned []
Running 835 sub problems to find dead transitions.
// Phase 1: matrix 846 rows 529 cols
[2025-05-29 21:02:29] [INFO ] Computed 24 invariants in 14 ms
[2025-05-29 21:02:29] [INFO ] State equation strengthened by 209 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:36] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:36] [INFO ] Deduced a trap composed of 24 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 21:02:37] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:37] [INFO ] Deduced a trap composed of 24 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 21:02:37] [INFO ] Deduced a trap composed of 24 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 21:02:37] [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 21:02:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:38] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:38] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:38] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:40] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:41] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:41] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:42] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 36 ms to minimize.
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 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 TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 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 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 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 TDEAD428 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 TDEAD436 is UNSAT
Problem TDEAD437 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 TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:43] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 17/41 constraints. Problems are: Problem set: 230 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:48] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 1/42 constraints. Problems are: Problem set: 230 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1375 variables, and 42 constraints, problems are : Problem set: 230 solved, 605 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 230 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 18/18 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 0/18 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 230/529 variables, 13/31 constraints. Problems are: Problem set: 230 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 11/42 constraints. Problems are: Problem set: 230 solved, 605 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:07] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:10] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:11] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:11] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 7/49 constraints. Problems are: Problem set: 230 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1375 variables, and 49 constraints, problems are : Problem set: 230 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 230 solved, 605 unsolved
Search for dead transitions found 230 dead transitions in 60327ms
Found 230 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 230 transitions
Dead transitions reduction (with SMT) removed 230 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 529/530 places, 616/867 transitions.
Graph (complete) has 1649 edges and 529 vertex of which 299 are kept as prefixes of interest. Removing 230 places using SCC suffix rule.1 ms
Discarding 230 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 299 /529 variables (removed 230) and now considering 616/616 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/530 places, 616/867 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60400 ms. Remains : 299/530 places, 616/867 transitions.
Built C files in :
/tmp/ltsmin11050882579085147510
[2025-05-29 21:03:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11050882579085147510
Running compilation step : cd /tmp/ltsmin11050882579085147510;'/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 1359 ms.
Running link step : cd /tmp/ltsmin11050882579085147510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11050882579085147510;'/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/stateBased17356804131837425353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 867/867 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 529 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 529 transition count 846
Applied a total of 2 rules in 27 ms. Remains 529 /530 variables (removed 1) and now considering 846/867 (removed 21) transitions.
// Phase 1: matrix 846 rows 529 cols
[2025-05-29 21:03:44] [INFO ] Computed 24 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:03:45] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-05-29 21:03:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:03:45] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:03:48] [INFO ] Implicit Places using invariants and state equation in 2933 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2025-05-29 21:03:48] [INFO ] Invariant cache hit.
[2025-05-29 21:03:48] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:58] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:03:59] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:00] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:00] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:03] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:04] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:10] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 45 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1375 variables, and 31 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:30] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:32] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:32] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:33] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 52 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:39] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:04:47] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 54 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1375 variables, and 37 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 529/530 places, 846/867 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63807 ms. Remains : 529/530 places, 846/867 transitions.
Built C files in :
/tmp/ltsmin6636012365240809234
[2025-05-29 21:04:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6636012365240809234
Running compilation step : cd /tmp/ltsmin6636012365240809234;'/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 1407 ms.
Running link step : cd /tmp/ltsmin6636012365240809234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6636012365240809234;'/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/stateBased9408821844751129969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:05:03] [INFO ] Flatten gal took : 23 ms
[2025-05-29 21:05:03] [INFO ] Flatten gal took : 21 ms
[2025-05-29 21:05:03] [INFO ] Time to serialize gal into /tmp/LTL15383645051744040635.gal : 4 ms
[2025-05-29 21:05:03] [INFO ] Time to serialize properties into /tmp/LTL5039463673733103588.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/LTL15383645051744040635.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12079332008347287469.hoa' '-atoms' '/tmp/LTL5039463673733103588.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/LTL5039463673733103588.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12079332008347287469.hoa
Detected timeout of ITS tools.
[2025-05-29 21:05:18] [INFO ] Flatten gal took : 20 ms
[2025-05-29 21:05:18] [INFO ] Flatten gal took : 20 ms
[2025-05-29 21:05:18] [INFO ] Time to serialize gal into /tmp/LTL5833075632320447957.gal : 4 ms
[2025-05-29 21:05:18] [INFO ] Time to serialize properties into /tmp/LTL11098911583223137740.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/LTL5833075632320447957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11098911583223137740.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(((X(!("((next_13==1)&&(ncs_5_8==1))")))U((X(G(!("((next_13==1)&&(ncs_5_8==1))"))))||((X(!("((next_13==1)&&(ncs_5_8==1))")))&&((...264
Formula 0 simplified : XX(!"((next_17==0)||(ncs_0_8==0))" | (X"((next_13==1)&&(ncs_5_8==1))" R (XF"((next_13==1)&&(ncs_5_8==1))" & (X"((next_13==1)&&(ncs_5...238
Detected timeout of ITS tools.
[2025-05-29 21:05:33] [INFO ] Flatten gal took : 26 ms
[2025-05-29 21:05:33] [INFO ] Applying decomposition
[2025-05-29 21:05:33] [INFO ] Flatten gal took : 23 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/graph7088911165605654425.txt' '-o' '/tmp/graph7088911165605654425.bin' '-w' '/tmp/graph7088911165605654425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7088911165605654425.bin' '-l' '-1' '-v' '-w' '/tmp/graph7088911165605654425.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:05:33] [INFO ] Decomposing Gal with order
[2025-05-29 21:05:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:05:33] [INFO ] Removed a total of 1474 redundant transitions.
[2025-05-29 21:05:33] [INFO ] Flatten gal took : 47 ms
[2025-05-29 21:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 20 ms.
[2025-05-29 21:05:33] [INFO ] Time to serialize gal into /tmp/LTL9596197660213014434.gal : 9 ms
[2025-05-29 21:05:33] [INFO ] Time to serialize properties into /tmp/LTL12813362536580266365.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/LTL9596197660213014434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12813362536580266365.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(((X(!("((i0.i1.u5.next_13==1)&&(i1.i1.u113.ncs_5_8==1))")))U((X(G(!("((i0.i1.u5.next_13==1)&&(i1.i1.u113.ncs_5_8==1))"))))||((X...376
Formula 0 simplified : XX(!"((i1.i0.u6.next_17==0)||(i2.u79.ncs_0_8==0))" | (X"((i0.i1.u5.next_13==1)&&(i1.i1.u113.ncs_5_8==1))" R (XF"((i0.i1.u5.next_13==...350
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 268759 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(X((G(F(p2))||p1))))))))'
Support contains 5 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 532 transition count 888
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 532 transition count 888
Applied a total of 50 rules in 27 ms. Remains 532 /557 variables (removed 25) and now considering 888/1293 (removed 405) transitions.
// Phase 1: matrix 888 rows 532 cols
[2025-05-29 21:05:49] [INFO ] Computed 25 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:05:49] [INFO ] Implicit Places using invariants in 630 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 631 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/557 places, 888/1293 transitions.
Applied a total of 0 rules in 9 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 667 ms. Remains : 531/557 places, 888/1293 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-11
Product exploration explored 100000 steps with 16665 reset in 245 ms.
Product exploration explored 100000 steps with 16678 reset in 239 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 p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 21:05:51] [INFO ] Computed 24 invariants in 4 ms
[2025-05-29 21:05:51] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 888/1419 variables, 531/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 110/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1419 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 888/1419 variables, 531/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 110/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 531 transition count 768
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 411 transition count 768
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 411 transition count 658
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 301 transition count 658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 462 place count 299 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 465 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 466 place count 298 transition count 615
Applied a total of 466 rules in 26 ms. Remains 298 /531 variables (removed 233) and now considering 615/888 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 298/531 places, 615/888 transitions.
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28150 steps (5 resets) in 30 ms. (908 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 11 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2025-05-29 21:05:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:05:53] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-05-29 21:05:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:05:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:05:57] [INFO ] Implicit Places using invariants and state equation in 3255 ms returned []
Implicit Place search using SMT with State Equation took 3772 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-05-29 21:05:57] [INFO ] Invariant cache hit.
[2025-05-29 21:05:57] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:07] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:09] [INFO ] Deduced a trap composed of 101 places in 257 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:09] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:10] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:10] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:13] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:14] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:14] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:15] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:16] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:18] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:22] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:23] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:24] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:24] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:25] [INFO ] Deduced a trap composed of 77 places in 250 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 40 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 40 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in LTL mode , in 1 iterations and 64041 ms. Remains : 531/531 places, 888/888 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) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
[2025-05-29 21:06:57] [INFO ] Invariant cache hit.
[2025-05-29 21:06:57] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 888/1419 variables, 531/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 110/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1419 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 497/499 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/520 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 888/1419 variables, 531/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 110/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1419 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 531/531 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2370 steps, including 66 resets, run visited all 1 properties in 7 ms. (steps per millisecond=338 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16678 reset in 246 ms.
Product exploration explored 100000 steps with 16659 reset in 235 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 118 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 228 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Applied a total of 228 rules in 26 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:07:01] [INFO ] Redundant transitions in 7 ms returned []
Running 877 sub problems to find dead transitions.
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 21:07:01] [INFO ] Computed 24 invariants in 4 ms
[2025-05-29 21:07:01] [INFO ] State equation strengthened by 209 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:09] [INFO ] Deduced a trap composed of 26 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 21:07:09] [INFO ] Deduced a trap composed of 24 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 21:07:09] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:10] [INFO ] Deduced a trap composed of 26 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 21:07:10] [INFO ] Deduced a trap composed of 26 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 21:07:10] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:10] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:11] [INFO ] Deduced a trap composed of 24 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 21:07:11] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:12] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:12] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:13] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:14] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:14] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:15] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:15] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 36 ms to minimize.
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 TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 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 TDEAD445 is UNSAT
Problem TDEAD446 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 TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/44 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:18] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:19] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:20] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:20] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:22] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 5/49 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 49 constraints, problems are : Problem set: 228 solved, 649 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 25/25 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/25 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 228/531 variables, 13/38 constraints. Problems are: Problem set: 228 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 11/49 constraints. Problems are: Problem set: 228 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:41] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 50 constraints, problems are : Problem set: 228 solved, 649 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60273ms problems are : Problem set: 228 solved, 649 unsolved
Search for dead transitions found 228 dead transitions in 60274ms
Found 228 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 228 transitions
Dead transitions reduction (with SMT) removed 228 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 531/531 places, 660/888 transitions.
Graph (complete) has 1715 edges and 531 vertex of which 303 are kept as prefixes of interest. Removing 228 places using SCC suffix rule.1 ms
Discarding 228 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 303 /531 variables (removed 228) and now considering 660/660 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 303/531 places, 660/888 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60333 ms. Remains : 303/531 places, 660/888 transitions.
Built C files in :
/tmp/ltsmin4653816089745159974
[2025-05-29 21:08:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4653816089745159974
Running compilation step : cd /tmp/ltsmin4653816089745159974;'/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 1377 ms.
Running link step : cd /tmp/ltsmin4653816089745159974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4653816089745159974;'/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/stateBased4339200842284604924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2025-05-29 21:08:16] [INFO ] Computed 24 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:16] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-05-29 21:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:08:20] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 3614 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-05-29 21:08:20] [INFO ] Invariant cache hit.
[2025-05-29 21:08:20] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:30] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:32] [INFO ] Deduced a trap composed of 101 places in 287 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:32] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:33] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:33] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:36] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:37] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:37] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:38] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:39] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:41] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 53 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:45] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:47] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:47] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:47] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:48] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1419 variables, and 40 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1419 variables, and 40 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Finished structural reductions in LTL mode , in 1 iterations and 63889 ms. Remains : 531/531 places, 888/888 transitions.
Built C files in :
/tmp/ltsmin10582380571517478135
[2025-05-29 21:09:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10582380571517478135
Running compilation step : cd /tmp/ltsmin10582380571517478135;'/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 1385 ms.
Running link step : cd /tmp/ltsmin10582380571517478135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10582380571517478135;'/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/stateBased15075623432506043866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:09:35] [INFO ] Flatten gal took : 24 ms
[2025-05-29 21:09:35] [INFO ] Flatten gal took : 20 ms
[2025-05-29 21:09:35] [INFO ] Time to serialize gal into /tmp/LTL5164506665367562226.gal : 4 ms
[2025-05-29 21:09:35] [INFO ] Time to serialize properties into /tmp/LTL14555123736014824996.prop : 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/LTL5164506665367562226.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7712649838871432631.hoa' '-atoms' '/tmp/LTL14555123736014824996.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14555123736014824996.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7712649838871432631.hoa
Detected timeout of ITS tools.
[2025-05-29 21:09:50] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:09:50] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:09:50] [INFO ] Time to serialize gal into /tmp/LTL3056312067387297199.gal : 4 ms
[2025-05-29 21:09:50] [INFO ] Time to serialize properties into /tmp/LTL14571048580478064611.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/LTL3056312067387297199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14571048580478064611.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...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((next_14==1)&&(ncs_10_5==1))"))||(X(X(X(X(("((next_11==0)||(ncs_7_8==0))")||(G(F("((next_11==1)&&(ncs_9_10==1))")))))))))))
Formula 0 simplified : F(G!"((next_14==1)&&(ncs_10_5==1))" & XXXX(!"((next_11==0)||(ncs_7_8==0))" & FG!"((next_11==1)&&(ncs_9_10==1))"))
Detected timeout of ITS tools.
[2025-05-29 21:10:05] [INFO ] Flatten gal took : 26 ms
[2025-05-29 21:10:05] [INFO ] Applying decomposition
[2025-05-29 21:10:05] [INFO ] Flatten gal took : 23 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/graph2162827045049222590.txt' '-o' '/tmp/graph2162827045049222590.bin' '-w' '/tmp/graph2162827045049222590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2162827045049222590.bin' '-l' '-1' '-v' '-w' '/tmp/graph2162827045049222590.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:10:05] [INFO ] Decomposing Gal with order
[2025-05-29 21:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:10:05] [INFO ] Removed a total of 1556 redundant transitions.
[2025-05-29 21:10:05] [INFO ] Flatten gal took : 41 ms
[2025-05-29 21:10:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 11 ms.
[2025-05-29 21:10:06] [INFO ] Time to serialize gal into /tmp/LTL5800187314134500082.gal : 7 ms
[2025-05-29 21:10:06] [INFO ] Time to serialize properties into /tmp/LTL15464929933513127520.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/LTL5800187314134500082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15464929933513127520.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.i0.u6.next_14==1)&&(i0.i0.u65.ncs_10_5==1))"))||(X(X(X(X(("((i1.i1.u4.next_11==0)||(i5.u49.ncs_7_8==0))")||(G(F("((i1.i1...209
Formula 0 simplified : F(G!"((i0.i0.u6.next_14==1)&&(i0.i0.u65.ncs_10_5==1))" & XXXX(!"((i1.i1.u4.next_11==0)||(i5.u49.ncs_7_8==0))" & FG!"((i1.i1.u4.next_...191
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 272062 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 U (p1||G(!p0))))))'
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 557 transition count 1183
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 447 transition count 1183
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 421 transition count 757
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 421 transition count 757
Applied a total of 272 rules in 31 ms. Remains 421 /557 variables (removed 136) and now considering 757/1293 (removed 536) transitions.
// Phase 1: matrix 757 rows 421 cols
[2025-05-29 21:10:21] [INFO ] Computed 25 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:21] [INFO ] Implicit Places using invariants in 561 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 562 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/557 places, 757/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 10 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2025-05-29 21:10:21] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:21] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-05-29 21:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:10:23] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/557 places, 638/1293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2687 ms. Remains : 301/557 places, 638/1293 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-15
Product exploration explored 100000 steps with 18 reset in 158 ms.
Product exploration explored 100000 steps with 19 reset in 163 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 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 53 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
[2025-05-29 21:10:24] [INFO ] Invariant cache hit.
[2025-05-29 21:10:24] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 3/939 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 13 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2025-05-29 21:10:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:25] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-29 21:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:25] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:10:26] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:10:26] [INFO ] Redundant transitions in 8 ms returned []
Running 627 sub problems to find dead transitions.
[2025-05-29 21:10:26] [INFO ] Invariant cache hit.
[2025-05-29 21:10:26] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:31] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:31] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:32] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:33] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:38] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (OVERLAPS) 638/939 variables, 301/330 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 939/939 variables, and 440 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 301/301 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:12] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:12] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:17] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:17] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:17] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:18] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:18] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/939 variables, and 36 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/627 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62291 ms. Remains : 301/301 places, 638/638 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 12217 steps (2 resets) in 29 ms. (407 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 23 reset in 152 ms.
Product exploration explored 100000 steps with 24 reset in 162 ms.
Built C files in :
/tmp/ltsmin17479744937126937685
[2025-05-29 21:11:27] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2025-05-29 21:11:27] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:11:27] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2025-05-29 21:11:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:11:28] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2025-05-29 21:11:28] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:11:28] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17479744937126937685
Running compilation step : cd /tmp/ltsmin17479744937126937685;'/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 1561 ms.
Running link step : cd /tmp/ltsmin17479744937126937685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17479744937126937685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13261858337612277303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 14 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2025-05-29 21:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:43] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-05-29 21:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:11:45] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:11:45] [INFO ] Redundant transitions in 4 ms returned []
Running 627 sub problems to find dead transitions.
[2025-05-29 21:11:45] [INFO ] Invariant cache hit.
[2025-05-29 21:11:45] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:49] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:49] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:51] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:52] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:56] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (OVERLAPS) 638/939 variables, 301/330 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 939/939 variables, and 440 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 301/301 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:30] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:31] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:35] [INFO ] Deduced a trap composed of 43 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 21:12:35] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:35] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:36] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:36] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/939 variables, and 36 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/627 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62396 ms. Remains : 301/301 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin17301275991926166911
[2025-05-29 21:12:45] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2025-05-29 21:12:45] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:12:45] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2025-05-29 21:12:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:12:45] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2025-05-29 21:12:45] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:12:45] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17301275991926166911
Running compilation step : cd /tmp/ltsmin17301275991926166911;'/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 1555 ms.
Running link step : cd /tmp/ltsmin17301275991926166911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17301275991926166911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased65141683019108868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:13:00] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:13:00] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:13:00] [INFO ] Time to serialize gal into /tmp/LTL14348413909815081120.gal : 3 ms
[2025-05-29 21:13:00] [INFO ] Time to serialize properties into /tmp/LTL2769038539376433342.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/LTL14348413909815081120.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17187349612138124013.hoa' '-atoms' '/tmp/LTL2769038539376433342.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/LTL2769038539376433342.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17187349612138124013.hoa
Detected timeout of ITS tools.
[2025-05-29 21:13:15] [INFO ] Flatten gal took : 14 ms
[2025-05-29 21:13:15] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:13:15] [INFO ] Time to serialize gal into /tmp/LTL16692600160787250192.gal : 3 ms
[2025-05-29 21:13:15] [INFO ] Time to serialize properties into /tmp/LTL7800808752869352372.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/LTL16692600160787250192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7800808752869352372.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((next_11==1)&&(ncs_3_10==1))"))U((G(!("((next_11==1)&&(ncs_3_10==1))")))||("((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1...216
Formula 0 simplified : FG("((next_11==1)&&(ncs_3_10==1))" M !"((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1)&&(ncs_3_10==1))))&&(!((next_11==1)&&(ncs_3_10...164
Detected timeout of ITS tools.
[2025-05-29 21:13:30] [INFO ] Flatten gal took : 17 ms
[2025-05-29 21:13:30] [INFO ] Applying decomposition
[2025-05-29 21:13:30] [INFO ] Flatten gal took : 15 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/graph13733696601258360603.txt' '-o' '/tmp/graph13733696601258360603.bin' '-w' '/tmp/graph13733696601258360603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13733696601258360603.bin' '-l' '-1' '-v' '-w' '/tmp/graph13733696601258360603.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:13:30] [INFO ] Decomposing Gal with order
[2025-05-29 21:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:13:30] [INFO ] Removed a total of 1158 redundant transitions.
[2025-05-29 21:13:30] [INFO ] Flatten gal took : 32 ms
[2025-05-29 21:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 10 ms.
[2025-05-29 21:13:30] [INFO ] Time to serialize gal into /tmp/LTL2598063870232681447.gal : 5 ms
[2025-05-29 21:13:30] [INFO ] Time to serialize properties into /tmp/LTL11437300280898354665.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/LTL2598063870232681447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11437300280898354665.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i2.u9.next_11==1)&&(u63.ncs_3_10==1))"))U((G(!("((i2.u9.next_11==1)&&(u63.ncs_3_10==1))")))||("((!(((i2.u9.next_11==1)&&(...270
Formula 0 simplified : FG("((i2.u9.next_11==1)&&(u63.ncs_3_10==1))" M !"((!(((i2.u9.next_11==1)&&(i11.u58.ncs_9_3==1))&&((i2.u9.next_11==1)&&(u63.ncs_3_10=...208
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 204943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (G((X(G(p2)) U !p3))&&p1)))'
Found a Shortening insensitive property : Anderson-PT-11-LTLFireability-08
Stuttering acceptance computed with spot in 180 ms :[(AND p1 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2)]
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 557 transition count 1183
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 447 transition count 1183
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 422 transition count 778
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 422 transition count 778
Applied a total of 270 rules in 30 ms. Remains 422 /557 variables (removed 135) and now considering 778/1293 (removed 515) transitions.
// Phase 1: matrix 778 rows 422 cols
[2025-05-29 21:13:46] [INFO ] Computed 25 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:46] [INFO ] Implicit Places using invariants in 600 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 601 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/557 places, 778/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 9 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2025-05-29 21:13:46] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:47] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-29 21:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:47] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:13:49] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/557 places, 660/1293 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2721 ms. Remains : 303/557 places, 660/1293 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 18640 steps with 0 reset with depth 18641 and stack size 16477 in 33 ms.
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 3232 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(X(!p1) U ((X(!p1)&&(G(p2) U p1))||X(G(!p1))))))))'
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(X((G(F(p2))||p1))))))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-11
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 557 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 557/557 places, 1293/1293 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 557 transition count 1183
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 447 transition count 1183
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 422 transition count 778
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 422 transition count 778
Applied a total of 270 rules in 33 ms. Remains 422 /557 variables (removed 135) and now considering 778/1293 (removed 515) transitions.
// Phase 1: matrix 778 rows 422 cols
[2025-05-29 21:13:49] [INFO ] Computed 25 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:50] [INFO ] Implicit Places using invariants in 575 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 576 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/557 places, 778/1293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 9 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2025-05-29 21:13:50] [INFO ] Computed 24 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:50] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-05-29 21:13:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:13:53] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/557 places, 660/1293 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3426 ms. Remains : 303/557 places, 660/1293 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-11
Product exploration explored 100000 steps with 16704 reset in 232 ms.
Product exploration explored 100000 steps with 16695 reset in 239 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 p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/8 properties
BEST_FIRST walk for 26324 steps (5 resets) in 26 ms. (974 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 323 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2025-05-29 21:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:55] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-29 21:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:55] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:13:57] [INFO ] Implicit Places using invariants and state equation in 2509 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2025-05-29 21:13:57] [INFO ] Invariant cache hit.
[2025-05-29 21:13:57] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:02] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:03] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:04] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:04] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:04] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:04] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:05] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:05] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:05] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:05] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:06] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:06] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:06] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:10] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:10] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:11] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:19] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/963 variables, and 41 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:31] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/963 variables, and 42 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in LTL mode , in 1 iterations and 63020 ms. Remains : 303/303 places, 660/660 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) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/8 properties
BEST_FIRST walk for 16366 steps (3 resets) in 16 ms. (962 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 283 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16716 reset in 235 ms.
Product exploration explored 100000 steps with 16700 reset in 238 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 11 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:15:00] [INFO ] Redundant transitions in 4 ms returned []
Running 649 sub problems to find dead transitions.
[2025-05-29 21:15:00] [INFO ] Invariant cache hit.
[2025-05-29 21:15:00] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:05] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:06] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:07] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:07] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:07] [INFO ] Deduced a trap composed of 45 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 21:15:07] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:07] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:08] [INFO ] Deduced a trap composed of 43 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 21:15:08] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:08] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:09] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:09] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:09] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:13] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:13] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:13] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:21] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/963 variables, and 41 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:15:34] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/963 variables, and 42 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60261 ms. Remains : 303/303 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin2803272751658504602
[2025-05-29 21:16:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2803272751658504602
Running compilation step : cd /tmp/ltsmin2803272751658504602;'/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 1016 ms.
Running link step : cd /tmp/ltsmin2803272751658504602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2803272751658504602;'/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/stateBased11391917504445995617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 9 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2025-05-29 21:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:16:16] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-05-29 21:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:16:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-05-29 21:16:18] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 2846 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2025-05-29 21:16:18] [INFO ] Invariant cache hit.
[2025-05-29 21:16:18] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:23] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:24] [INFO ] Deduced a trap composed of 45 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 21:16:25] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:25] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:25] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:25] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:26] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:26] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:26] [INFO ] Deduced a trap composed of 43 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 21:16:26] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:27] [INFO ] Deduced a trap composed of 43 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 21:16:27] [INFO ] Deduced a trap composed of 43 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 21:16:27] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:31] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:31] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:32] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:40] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/963 variables, and 41 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:16:52] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/963 variables, and 42 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/303 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Finished structural reductions in LTL mode , in 1 iterations and 63107 ms. Remains : 303/303 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin12772776266747457828
[2025-05-29 21:17:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12772776266747457828
Running compilation step : cd /tmp/ltsmin12772776266747457828;'/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 1052 ms.
Running link step : cd /tmp/ltsmin12772776266747457828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12772776266747457828;'/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/stateBased8458853494223845156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:17:34] [INFO ] Flatten gal took : 17 ms
[2025-05-29 21:17:34] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:17:34] [INFO ] Time to serialize gal into /tmp/LTL17754870100449211747.gal : 3 ms
[2025-05-29 21:17:34] [INFO ] Time to serialize properties into /tmp/LTL12475099751219355573.prop : 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/LTL17754870100449211747.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7859649373627448774.hoa' '-atoms' '/tmp/LTL12475099751219355573.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/LTL12475099751219355573.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7859649373627448774.hoa
Detected timeout of ITS tools.
[2025-05-29 21:17:49] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:17:49] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:17:49] [INFO ] Time to serialize gal into /tmp/LTL18239831813352353555.gal : 3 ms
[2025-05-29 21:17:49] [INFO ] Time to serialize properties into /tmp/LTL10019512830645015800.ltl : 5 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/LTL18239831813352353555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10019512830645015800.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((next_14==1)&&(ncs_10_5==1))"))||(X(X(X(X(("((next_11==0)||(ncs_7_8==0))")||(G(F("((next_11==1)&&(ncs_9_10==1))")))))))))))
Formula 0 simplified : F(G!"((next_14==1)&&(ncs_10_5==1))" & XXXX(!"((next_11==0)||(ncs_7_8==0))" & FG!"((next_11==1)&&(ncs_9_10==1))"))
Detected timeout of ITS tools.
[2025-05-29 21:18:04] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:18:04] [INFO ] Applying decomposition
[2025-05-29 21:18:04] [INFO ] Flatten gal took : 15 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/graph5046608240820360100.txt' '-o' '/tmp/graph5046608240820360100.bin' '-w' '/tmp/graph5046608240820360100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5046608240820360100.bin' '-l' '-1' '-v' '-w' '/tmp/graph5046608240820360100.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:18:04] [INFO ] Decomposing Gal with order
[2025-05-29 21:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:18:04] [INFO ] Removed a total of 1213 redundant transitions.
[2025-05-29 21:18:04] [INFO ] Flatten gal took : 50 ms
[2025-05-29 21:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 12 ms.
[2025-05-29 21:18:04] [INFO ] Time to serialize gal into /tmp/LTL14457019533545117943.gal : 5 ms
[2025-05-29 21:18:04] [INFO ] Time to serialize properties into /tmp/LTL12561113795238157859.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/LTL14457019533545117943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12561113795238157859.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((i6.i0.u11.next_14==1)&&(i6.i1.u67.ncs_10_5==1))"))||(X(X(X(X(("((i3.u9.next_11==0)||(u68.ncs_7_8==0))")||(G(F("((i3.u9.next...197
Formula 0 simplified : F(G!"((i6.i0.u11.next_14==1)&&(i6.i1.u67.ncs_10_5==1))" & XXXX(!"((i3.u9.next_11==0)||(u68.ncs_7_8==0))" & FG!"((i3.u9.next_11==1)&&...179
Detected timeout of ITS tools.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 270471 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 U (p1||G(!p0))))))'
[2025-05-29 21:18:19] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16550108073839691887
[2025-05-29 21:18:19] [INFO ] Computing symmetric may disable matrix : 1293 transitions.
[2025-05-29 21:18:19] [INFO ] Applying decomposition
[2025-05-29 21:18:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:18:20] [INFO ] Computing symmetric may enable matrix : 1293 transitions.
[2025-05-29 21:18:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:18:20] [INFO ] Flatten gal took : 31 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/graph10929098665336406524.txt' '-o' '/tmp/graph10929098665336406524.bin' '-w' '/tmp/graph10929098665336406524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10929098665336406524.bin' '-l' '-1' '-v' '-w' '/tmp/graph10929098665336406524.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:18:20] [INFO ] Decomposing Gal with order
[2025-05-29 21:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:18:20] [INFO ] Removed a total of 2327 redundant transitions.
[2025-05-29 21:18:20] [INFO ] Flatten gal took : 65 ms
[2025-05-29 21:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 14 ms.
[2025-05-29 21:18:20] [INFO ] Time to serialize gal into /tmp/LTLFireability12916420279574453558.gal : 7 ms
[2025-05-29 21:18:20] [INFO ] Time to serialize properties into /tmp/LTLFireability8021636568006133088.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/LTLFireability12916420279574453558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8021636568006133088.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((!((!("((i2.u5.next_11==1)&&(i9.u77.ncs_1_8==1))"))U(((G((X(G("((i0.u2.next_4==1)&&(i2.u1.ncs_3_6==1))")))U(!("((i3.u8.next_19==1)&&...233
Formula 0 simplified : !"((i2.u5.next_11==1)&&(i9.u77.ncs_1_8==1))" U ("(i0.u2.next_4==1)" & "(i2.u1.ncs_3_6==1)" & G(!"((i3.u8.next_19==1)&&(i10.u97.ncs_6...261
[2025-05-29 21:18:20] [INFO ] Computing Do-Not-Accords matrix : 1293 transitions.
[2025-05-29 21:18:20] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:18:20] [INFO ] Built C files in 448ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16550108073839691887
Running compilation step : cd /tmp/ltsmin16550108073839691887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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 4492 ms.
Running link step : cd /tmp/ltsmin16550108073839691887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16550108073839691887;'/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' '!(!(LTLAPp0==true) U ([]((X([]((LTLAPp2==true))) U !(LTLAPp3==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 9175 ms.
FORMULA Anderson-PT-11-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin16550108073839691887;'/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(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16550108073839691887;'/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(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16550108073839691887;'/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' '[]((<>((LTLAPp7==true))||X(X(X(X(([](<>((LTLAPp9==true)))||(LTLAPp8==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16550108073839691887;'/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' '[]((<>((LTLAPp7==true))||X(X(X(X(([](<>((LTLAPp9==true)))||(LTLAPp8==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16550108073839691887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp10==true) U ((LTLAPp11==true)||[](!(LTLAPp10==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16550108073839691887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp10==true) U ((LTLAPp11==true)||[](!(LTLAPp10==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin16550108073839691887;'/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(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.230: LTL layer: formula: X(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.234: "X(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.235: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.266: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.270: buchi has 9 states
pins2lts-mc-linux64( 1/ 8), 0.287: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.294: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.303: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.502: DFS-FIFO for weak LTL, using special progress label 1306
pins2lts-mc-linux64( 0/ 8), 0.502: There are 1307 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.502: State length is 558, there are 1313 groups
pins2lts-mc-linux64( 0/ 8), 0.502: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.502: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.502: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.502: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.657: ~1 levels ~960 states ~10488 transitions
pins2lts-mc-linux64( 3/ 8), 0.797: ~1 levels ~1920 states ~20936 transitions
pins2lts-mc-linux64( 3/ 8), 1.002: ~1 levels ~3840 states ~41704 transitions
pins2lts-mc-linux64( 6/ 8), 1.287: ~1 levels ~7680 states ~82832 transitions
pins2lts-mc-linux64( 6/ 8), 1.915: ~1 levels ~15360 states ~164968 transitions
pins2lts-mc-linux64( 6/ 8), 3.059: ~1 levels ~30720 states ~329144 transitions
pins2lts-mc-linux64( 1/ 8), 4.818: ~1 levels ~61440 states ~658872 transitions
pins2lts-mc-linux64( 1/ 8), 8.367: ~1 levels ~122880 states ~1314800 transitions
pins2lts-mc-linux64( 1/ 8), 14.710: ~1 levels ~245760 states ~2612136 transitions
pins2lts-mc-linux64( 2/ 8), 27.200: ~1 levels ~491520 states ~5144976 transitions
pins2lts-mc-linux64( 2/ 8), 51.828: ~1 levels ~983040 states ~10212424 transitions
pins2lts-mc-linux64( 6/ 8), 101.338: ~1 levels ~1966080 states ~20486864 transitions
pins2lts-mc-linux64( 7/ 8), 199.760: ~1 levels ~3932160 states ~40395248 transitions
pins2lts-mc-linux64( 5/ 8), 253.249: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 253.323:
pins2lts-mc-linux64( 0/ 8), 253.323: mean standard work distribution: 0.5% (states) 0.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 253.323:
pins2lts-mc-linux64( 0/ 8), 253.323: Explored 4898475 states 50691514 transitions, fanout: 10.348
pins2lts-mc-linux64( 0/ 8), 253.323: Total exploration time 252.810 sec (252.750 sec minimum, 252.774 sec on average)
pins2lts-mc-linux64( 0/ 8), 253.323: States per second: 19376, Transitions per second: 200512
pins2lts-mc-linux64( 0/ 8), 253.323:
pins2lts-mc-linux64( 0/ 8), 253.323: Progress states detected: 27132757
pins2lts-mc-linux64( 0/ 8), 253.323: Redundant explorations: -81.9463
pins2lts-mc-linux64( 0/ 8), 253.323:
pins2lts-mc-linux64( 0/ 8), 253.323: Queue width: 8B, total height: 33848264, memory: 258.24MB
pins2lts-mc-linux64( 0/ 8), 253.323: Tree memory: 463.0MB, 17.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 253.323: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 253.323: Stored 1320 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 253.323: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 253.323: Est. total memory use: 721.2MB (~1282.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16550108073839691887;'/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(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16550108073839691887;'/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(X(((LTLAPp4==true)&&(X(!(LTLAPp5==true)) U ((X(!(LTLAPp5==true))&&([]((LTLAPp6==true)) U (LTLAPp5==true)))||X([](!(LTLAPp5==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:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-29 21:47:12] [INFO ] Applying decomposition
[2025-05-29 21:47:12] [INFO ] Flatten gal took : 214 ms
[2025-05-29 21:47:12] [INFO ] Decomposing Gal with order
[2025-05-29 21:47:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:47:13] [INFO ] Removed a total of 1536 redundant transitions.
[2025-05-29 21:47:13] [INFO ] Flatten gal took : 820 ms
[2025-05-29 21:47:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 69 ms.
[2025-05-29 21:47:13] [INFO ] Time to serialize gal into /tmp/LTLFireability5319189468460697055.gal : 26 ms
[2025-05-29 21:47:13] [INFO ] Time to serialize properties into /tmp/LTLFireability14969791489940472919.ltl : 6 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/LTLFireability5319189468460697055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14969791489940472919.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(X(("((u12.next_17==0)||(u8.ncs_0_8==0))")&&((X(!("((u12.next_13==1)&&(u2.ncs_5_8==1))")))U(((X(!("((u12.next_13==1)&&(u2.ncs_5_8=...306
Formula 0 simplified : XX(!"((u12.next_17==0)||(u8.ncs_0_8==0))" | (X"((u12.next_13==1)&&(u2.ncs_5_8==1))" R (XF"((u12.next_13==1)&&(u2.ncs_5_8==1))" & (X"...280

BK_TIME_CONFINEMENT_REACHED

--------------------
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-11"
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-11, 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-174853728800204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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