Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 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.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 2.1M 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-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748554857421

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 21:40:58] [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 21:40:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:40:58] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2025-05-29 21:40:58] [INFO ] Transformed 889 places.
[2025-05-29 21:40:59] [INFO ] Transformed 4152 transitions.
[2025-05-29 21:40:59] [INFO ] Found NUPN structural information;
[2025-05-29 21:40:59] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 235 places :
Symmetric choice reduction at 0 with 235 rule applications. Total rules 235 place count 654 transition count 1607
Iterating global reduction 0 with 235 rules applied. Total rules applied 470 place count 654 transition count 1607
Applied a total of 470 rules in 142 ms. Remains 654 /889 variables (removed 235) and now considering 1607/4152 (removed 2545) transitions.
// Phase 1: matrix 1607 rows 654 cols
[2025-05-29 21:40:59] [INFO ] Computed 27 invariants in 66 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:41:00] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2025-05-29 21:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:41:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:41:06] [INFO ] Implicit Places using invariants and state equation in 5542 ms returned []
Implicit Place search using SMT with State Equation took 6637 ms to find 0 implicit places.
Running 1595 sub problems to find dead transitions.
[2025-05-29 21:41:09] [INFO ] Invariant cache hit.
[2025-05-29 21:41:09] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:28] [INFO ] Deduced a trap composed of 97 places in 427 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:29] [INFO ] Deduced a trap composed of 71 places in 396 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:30] [INFO ] Deduced a trap composed of 71 places in 359 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:30] [INFO ] Deduced a trap composed of 150 places in 392 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:31] [INFO ] Deduced a trap composed of 99 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:31] [INFO ] Deduced a trap composed of 97 places in 344 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:32] [INFO ] Deduced a trap composed of 86 places in 346 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:33] [INFO ] Deduced a trap composed of 110 places in 379 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:33] [INFO ] Deduced a trap composed of 71 places in 388 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:34] [INFO ] Deduced a trap composed of 73 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 21:41:34] [INFO ] Deduced a trap composed of 188 places in 356 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:35] [INFO ] Deduced a trap composed of 136 places in 358 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:35] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:36] [INFO ] Deduced a trap composed of 70 places in 387 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:36] [INFO ] Deduced a trap composed of 70 places in 397 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:37] [INFO ] Deduced a trap composed of 71 places in 355 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:37] [INFO ] Deduced a trap composed of 97 places in 353 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:38] [INFO ] Deduced a trap composed of 84 places in 352 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:38] [INFO ] Deduced a trap composed of 71 places in 358 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:39] [INFO ] Deduced a trap composed of 70 places in 366 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/2261 variables, and 47 constraints, problems are : Problem set: 0 solved, 1595 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/654 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1595/1595 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1595 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/654 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/654 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:46] [INFO ] Deduced a trap composed of 71 places in 371 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:49] [INFO ] Deduced a trap composed of 84 places in 385 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:50] [INFO ] Deduced a trap composed of 70 places in 406 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:50] [INFO ] Deduced a trap composed of 110 places in 388 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:50] [INFO ] Deduced a trap composed of 123 places in 388 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:51] [INFO ] Deduced a trap composed of 149 places in 395 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:51] [INFO ] Deduced a trap composed of 162 places in 404 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:52] [INFO ] Deduced a trap composed of 175 places in 394 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:52] [INFO ] Deduced a trap composed of 189 places in 404 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:52] [INFO ] Deduced a trap composed of 201 places in 371 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:53] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:54] [INFO ] Deduced a trap composed of 70 places in 401 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:54] [INFO ] Deduced a trap composed of 70 places in 385 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:55] [INFO ] Deduced a trap composed of 125 places in 338 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:56] [INFO ] Deduced a trap composed of 110 places in 383 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:41:58] [INFO ] Deduced a trap composed of 84 places in 373 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:00] [INFO ] Deduced a trap composed of 97 places in 373 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:00] [INFO ] Deduced a trap composed of 110 places in 381 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:01] [INFO ] Deduced a trap composed of 123 places in 368 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:01] [INFO ] Deduced a trap composed of 70 places in 373 ms of which 74 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1595 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:04] [INFO ] Deduced a trap composed of 136 places in 352 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:05] [INFO ] Deduced a trap composed of 71 places in 370 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:06] [INFO ] Deduced a trap composed of 110 places in 365 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:07] [INFO ] Deduced a trap composed of 149 places in 404 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:07] [INFO ] Deduced a trap composed of 162 places in 403 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:08] [INFO ] Deduced a trap composed of 71 places in 377 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:09] [INFO ] Deduced a trap composed of 70 places in 390 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:10] [INFO ] Deduced a trap composed of 123 places in 375 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:10] [INFO ] Deduced a trap composed of 110 places in 335 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:11] [INFO ] Deduced a trap composed of 149 places in 353 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:11] [INFO ] Deduced a trap composed of 70 places in 389 ms of which 76 ms to minimize.
SMT process timed out in 61852ms, After SMT, problems are : Problem set: 0 solved, 1595 unsolved
Search for dead transitions found 0 dead transitions in 65367ms
Starting structural reductions in LTL mode, iteration 1 : 654/889 places, 1607/4152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72187 ms. Remains : 654/889 places, 1607/4152 transitions.
Support contains 56 out of 654 places after structural reductions.
[2025-05-29 21:42:11] [INFO ] Flatten gal took : 152 ms
[2025-05-29 21:42:11] [INFO ] Flatten gal took : 101 ms
[2025-05-29 21:42:12] [INFO ] Input system was already deterministic with 1607 transitions.
Support contains 55 out of 654 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1996 ms. (20 steps per ms) remains 26/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
[2025-05-29 21:42:13] [INFO ] Invariant cache hit.
[2025-05-29 21:42:13] [INFO ] State equation strengthened by 132 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 608/649 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 2/651 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/654 variables, 3/27 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:14] [INFO ] Deduced a trap composed of 71 places in 346 ms of which 44 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1607/2261 variables, 654/682 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2261 variables, 132/814 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2261 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/2261 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2261/2261 variables, and 814 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 654/654 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 609/648 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/648 variables, 9/21 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/648 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/650 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/654 variables, 4/27 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:19] [INFO ] Deduced a trap composed of 73 places in 368 ms of which 74 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:20] [INFO ] Deduced a trap composed of 98 places in 359 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:20] [INFO ] Deduced a trap composed of 97 places in 367 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:21] [INFO ] Deduced a trap composed of 84 places in 344 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:21] [INFO ] Deduced a trap composed of 112 places in 332 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:22] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:22] [INFO ] Deduced a trap composed of 99 places in 348 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:22] [INFO ] Deduced a trap composed of 71 places in 357 ms of which 73 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 7/36 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/2261 variables, and 36 constraints, problems are : Problem set: 2 solved, 21 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/654 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 2 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 654 transition count 1476
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 523 transition count 1476
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 273 place count 512 transition count 1267
Iterating global reduction 0 with 11 rules applied. Total rules applied 284 place count 512 transition count 1267
Applied a total of 284 rules in 112 ms. Remains 512 /654 variables (removed 142) and now considering 1267/1607 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 512/654 places, 1267/1607 transitions.
RANDOM walk for 40000 steps (8 resets) in 683 ms. (58 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
// Phase 1: matrix 1267 rows 512 cols
[2025-05-29 21:42:23] [INFO ] Computed 27 invariants in 26 ms
[2025-05-29 21:42:23] [INFO ] State equation strengthened by 132 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 472/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/504 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 8/512 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1267/1779 variables, 512/539 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1779 variables, 132/671 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1779 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/1779 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1779/1779 variables, and 671 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 512/512 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 472/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/504 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 8/512 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:27] [INFO ] Deduced a trap composed of 85 places in 282 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:28] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:28] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 55 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:28] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:29] [INFO ] Deduced a trap composed of 59 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 21:42:29] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:30] [INFO ] Deduced a trap composed of 58 places in 305 ms of which 54 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:30] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:30] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:31] [INFO ] Deduced a trap composed of 98 places in 276 ms of which 52 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:31] [INFO ] Deduced a trap composed of 112 places in 293 ms of which 69 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:32] [INFO ] Deduced a trap composed of 59 places in 275 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:32] [INFO ] Deduced a trap composed of 85 places in 288 ms of which 55 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:33] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 53 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:42:34] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 55 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 1267/1779 variables, 512/554 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1779 variables, 132/686 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1779 variables, 17/703 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1779/1779 variables, and 703 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 512/512 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47761ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1267/1267 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 509 transition count 1198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 509 transition count 1198
Applied a total of 6 rules in 49 ms. Remains 509 /512 variables (removed 3) and now considering 1198/1267 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 509/512 places, 1198/1267 transitions.
RANDOM walk for 40000 steps (8 resets) in 411 ms. (97 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
// Phase 1: matrix 1198 rows 509 cols
[2025-05-29 21:43:11] [INFO ] Computed 27 invariants in 8 ms
[2025-05-29 21:43:11] [INFO ] State equation strengthened by 132 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 470/496 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/499 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 10/509 variables, 10/27 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 21:43:12] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:43:12] [INFO ] Deduced a trap composed of 72 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:43:13] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:43:13] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 54 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1198/1707 variables, 509/540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1707 variables, 132/672 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1707 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/1707 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1707/1707 variables, and 672 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3587 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 509/509 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 470/496 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/499 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 10/509 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 4/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 21:43:16] [INFO ] Deduced a trap composed of 111 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 21:43:16] [INFO ] Deduced a trap composed of 73 places in 262 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:43:16] [INFO ] Deduced a trap composed of 85 places in 269 ms of which 56 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 3/34 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 21:43:17] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 49 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/35 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 21:43:17] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 49 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1198/1707 variables, 509/545 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1707 variables, 132/677 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1707 variables, 14/691 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1707 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/1707 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1707/1707 variables, and 691 constraints, problems are : Problem set: 0 solved, 14 unsolved in 75021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 509/509 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78640ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1198/1198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 507 transition count 1152
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 507 transition count 1152
Applied a total of 4 rules in 40 ms. Remains 507 /509 variables (removed 2) and now considering 1152/1198 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 507/509 places, 1152/1198 transitions.
FORMULA Anderson-PT-12-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA Anderson-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0)) U (X((p2 U p3))&&p1)))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 627 transition count 1030
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 627 transition count 1030
Applied a total of 54 rules in 29 ms. Remains 627 /654 variables (removed 27) and now considering 1030/1607 (removed 577) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2025-05-29 21:44:30] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:44:31] [INFO ] Implicit Places using invariants in 612 ms returned []
[2025-05-29 21:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:44:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:44:35] [INFO ] Implicit Places using invariants and state equation in 3936 ms returned []
Implicit Place search using SMT with State Equation took 4551 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2025-05-29 21:44:35] [INFO ] Invariant cache hit.
[2025-05-29 21:44:35] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:44:46] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:44:50] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:44:51] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:44:53] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:44:57] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:00] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:01] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 59 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:05] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:06] [INFO ] Deduced a trap composed of 97 places in 324 ms of which 81 ms to minimize.
SMT process timed out in 30688ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 30694ms
Starting structural reductions in LTL mode, iteration 1 : 627/654 places, 1030/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35282 ms. Remains : 627/654 places, 1030/1607 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3), true, (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 35647 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 U G(!p1)))&&F((G(F(p2))||(!p2&&F(p2)))))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 627 transition count 1030
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 627 transition count 1030
Applied a total of 54 rules in 55 ms. Remains 627 /654 variables (removed 27) and now considering 1030/1607 (removed 577) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2025-05-29 21:45:06] [INFO ] Computed 27 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:45:07] [INFO ] Implicit Places using invariants in 819 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 821 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/654 places, 1030/1607 transitions.
Applied a total of 0 rules in 12 ms. Remains 626 /626 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 626/654 places, 1030/1607 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : Anderson-PT-12-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2573 steps with 0 reset in 21 ms.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-01 finished in 1192 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((X((X(p0) U p1))&&(X(X(!p2)) U (p3 U p0)))))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 629 transition count 1076
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 629 transition count 1076
Applied a total of 50 rules in 35 ms. Remains 629 /654 variables (removed 25) and now considering 1076/1607 (removed 531) transitions.
// Phase 1: matrix 1076 rows 629 cols
[2025-05-29 21:45:07] [INFO ] Computed 27 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:45:08] [INFO ] Implicit Places using invariants in 826 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 828 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 628/654 places, 1076/1607 transitions.
Applied a total of 0 rules in 13 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 628/654 places, 1076/1607 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 22265 reset in 415 ms.
Product exploration explored 100000 steps with 22153 reset in 411 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 p3) (NOT p1) (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT p0)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 159 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 369 ms. (108 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
// Phase 1: matrix 1076 rows 628 cols
[2025-05-29 21:45:10] [INFO ] Computed 26 invariants in 15 ms
[2025-05-29 21:45:10] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 590/598 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/618 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 628/1704 variables, and 26 constraints, problems are : Problem set: 2 solved, 0 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT p0)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p3) p1 (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p3) p1 p2))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F p3), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p3 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 594 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
[2025-05-29 21:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 21:45:12] [INFO ] [Real]Absence check using 14 positive place invariants in 70 ms returned sat
[2025-05-29 21:45:12] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 269 ms returned sat
[2025-05-29 21:45:27] [INFO ] [Real]Absence check using state equation in 14300 ms returned unknown
Could not prove EG (NOT p0)
[2025-05-29 21:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 21:45:27] [INFO ] [Real]Absence check using 14 positive place invariants in 96 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT p0)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p3) p1 (NOT p2))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p3) p1 p2))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F p3), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p3 p1 (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 25 factoid took 615 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 20572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X(p1))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 627 transition count 1030
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 627 transition count 1030
Applied a total of 54 rules in 37 ms. Remains 627 /654 variables (removed 27) and now considering 1030/1607 (removed 577) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2025-05-29 21:45:28] [INFO ] Computed 27 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:45:28] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-05-29 21:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:45:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:45:33] [INFO ] Implicit Places using invariants and state equation in 4620 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2025-05-29 21:45:33] [INFO ] Invariant cache hit.
[2025-05-29 21:45:33] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:48] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:48] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:50] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:50] [INFO ] Deduced a trap composed of 62 places in 323 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:56] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:57] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:45:59] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 67 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1657 variables, and 34 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/627 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:10] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:10] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:10] [INFO ] Deduced a trap composed of 62 places in 311 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:11] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:11] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:13] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:13] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:14] [INFO ] Deduced a trap composed of 71 places in 296 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:14] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:15] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:16] [INFO ] Deduced a trap composed of 62 places in 304 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:19] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:20] [INFO ] Deduced a trap composed of 84 places in 294 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:25] [INFO ] Deduced a trap composed of 84 places in 339 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:25] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:26] [INFO ] Deduced a trap composed of 84 places in 325 ms of which 82 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1657 variables, and 50 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/627 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
Starting structural reductions in LTL mode, iteration 1 : 627/654 places, 1030/1607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65820 ms. Remains : 627/654 places, 1030/1607 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 287 ms.
Stack based approach found an accepted trace after 158 steps with 0 reset with depth 159 and stack size 159 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-03 finished in 66374 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(p1))))'
Support contains 6 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 654 transition count 1476
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 523 transition count 1476
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 289 place count 496 transition count 899
Iterating global reduction 0 with 27 rules applied. Total rules applied 316 place count 496 transition count 899
Applied a total of 316 rules in 65 ms. Remains 496 /654 variables (removed 158) and now considering 899/1607 (removed 708) transitions.
// Phase 1: matrix 899 rows 496 cols
[2025-05-29 21:46:34] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:46:35] [INFO ] Implicit Places using invariants in 703 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 705 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/654 places, 899/1607 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 495 transition count 781
Reduce places removed 118 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 130 rules applied. Total rules applied 248 place count 377 transition count 769
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 260 place count 365 transition count 769
Applied a total of 260 rules in 29 ms. Remains 365 /495 variables (removed 130) and now considering 769/899 (removed 130) transitions.
// Phase 1: matrix 769 rows 365 cols
[2025-05-29 21:46:35] [INFO ] Computed 26 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:46:35] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-05-29 21:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:46:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:46:38] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 2769 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 365/654 places, 769/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3569 ms. Remains : 365/654 places, 769/1607 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-04
Product exploration explored 100000 steps with 30 reset in 170 ms.
Product exploration explored 100000 steps with 40 reset in 317 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 10834 steps (1 resets) in 25 ms. (416 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 769/769 transitions.
Applied a total of 0 rules in 23 ms. Remains 365 /365 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2025-05-29 21:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:46:39] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-05-29 21:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:46:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:46:42] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:46:42] [INFO ] Redundant transitions in 53 ms returned []
Running 757 sub problems to find dead transitions.
[2025-05-29 21:46:42] [INFO ] Invariant cache hit.
[2025-05-29 21:46:42] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:47] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:47] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:50] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:51] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:52] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:53] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:53] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:53] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:53] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:54] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:54] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:55] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:57] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:46:57] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:47:09] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1134 variables, and 41 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1134 variables, and 41 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63066 ms. Remains : 365/365 places, 769/769 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 12116 steps (2 resets) in 25 ms. (466 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 24 reset in 177 ms.
Product exploration explored 100000 steps with 29 reset in 259 ms.
Built C files in :
/tmp/ltsmin16787505685426146056
[2025-05-29 21:47:43] [INFO ] Computing symmetric may disable matrix : 769 transitions.
[2025-05-29 21:47:43] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:47:43] [INFO ] Computing symmetric may enable matrix : 769 transitions.
[2025-05-29 21:47:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:47:43] [INFO ] Computing Do-Not-Accords matrix : 769 transitions.
[2025-05-29 21:47:43] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:47:43] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16787505685426146056
Running compilation step : cd /tmp/ltsmin16787505685426146056;'/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 2189 ms.
Running link step : cd /tmp/ltsmin16787505685426146056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin16787505685426146056;'/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/stateBased9996216036653497215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 769/769 transitions.
Applied a total of 0 rules in 21 ms. Remains 365 /365 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2025-05-29 21:47:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:47:59] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-05-29 21:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:47:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:48:01] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:48:01] [INFO ] Redundant transitions in 14 ms returned []
Running 757 sub problems to find dead transitions.
[2025-05-29 21:48:01] [INFO ] Invariant cache hit.
[2025-05-29 21:48:01] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:07] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:07] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:09] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:11] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:12] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:12] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:12] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:13] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:13] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:13] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:14] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:14] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:17] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:17] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:48:29] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1134 variables, and 41 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1134 variables, and 41 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/365 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63072 ms. Remains : 365/365 places, 769/769 transitions.
Built C files in :
/tmp/ltsmin13373995849769947800
[2025-05-29 21:49:01] [INFO ] Computing symmetric may disable matrix : 769 transitions.
[2025-05-29 21:49:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:49:02] [INFO ] Computing symmetric may enable matrix : 769 transitions.
[2025-05-29 21:49:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:49:02] [INFO ] Computing Do-Not-Accords matrix : 769 transitions.
[2025-05-29 21:49:02] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:49:02] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13373995849769947800
Running compilation step : cd /tmp/ltsmin13373995849769947800;'/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 2029 ms.
Running link step : cd /tmp/ltsmin13373995849769947800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13373995849769947800;'/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/stateBased13374367601238335968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:49:17] [INFO ] Flatten gal took : 32 ms
[2025-05-29 21:49:17] [INFO ] Flatten gal took : 40 ms
[2025-05-29 21:49:17] [INFO ] Time to serialize gal into /tmp/LTL2411842499355458547.gal : 18 ms
[2025-05-29 21:49:17] [INFO ] Time to serialize properties into /tmp/LTL2408958801080573091.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/LTL2411842499355458547.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9222655772328248037.hoa' '-atoms' '/tmp/LTL2408958801080573091.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/LTL2408958801080573091.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9222655772328248037.hoa
Detected timeout of ITS tools.
[2025-05-29 21:49:32] [INFO ] Flatten gal took : 32 ms
[2025-05-29 21:49:32] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:49:32] [INFO ] Time to serialize gal into /tmp/LTL7143148384952610427.gal : 14 ms
[2025-05-29 21:49:32] [INFO ] Time to serialize properties into /tmp/LTL2158705020530759828.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7143148384952610427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2158705020530759828.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((next_0==0)||(ncs_1_8==0))&&((slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(p2_0_3==0)))"))&&(F("((next_12==0)||(ncs_4_6==0))")))))
Formula 0 simplified : F(G!"(((next_0==0)||(ncs_1_8==0))&&((slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(p2_0_3==0)))" | G!"((next_12==0)||(ncs_4_6==0))")
Detected timeout of ITS tools.
[2025-05-29 21:49:47] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:49:47] [INFO ] Applying decomposition
[2025-05-29 21:49:47] [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/graph5071542444255472486.txt' '-o' '/tmp/graph5071542444255472486.bin' '-w' '/tmp/graph5071542444255472486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5071542444255472486.bin' '-l' '-1' '-v' '-w' '/tmp/graph5071542444255472486.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:49:47] [INFO ] Decomposing Gal with order
[2025-05-29 21:49:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:49:47] [INFO ] Removed a total of 1447 redundant transitions.
[2025-05-29 21:49:47] [INFO ] Flatten gal took : 111 ms
[2025-05-29 21:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 41 ms.
[2025-05-29 21:49:48] [INFO ] Time to serialize gal into /tmp/LTL6047742867903325942.gal : 18 ms
[2025-05-29 21:49:48] [INFO ] Time to serialize properties into /tmp/LTL18161926851151051573.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/LTL6047742867903325942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18161926851151051573.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("(((i4.u6.next_0==0)||(i0.u64.ncs_1_8==0))&&((i1.i0.u3.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(i6.u19.p2_0_3==0)))"))&&(F("((i4.u12...196
Formula 0 simplified : F(G!"(((i4.u6.next_0==0)||(i0.u64.ncs_1_8==0))&&((i1.i0.u3.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(i6.u19.p2_0_3==0)))" | G!"((i4.u12.nex...188
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLFireability-04 finished in 208626 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)&&X(G((p1||X(X((p2&&X(p3)))))))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 627 transition count 1030
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 627 transition count 1030
Applied a total of 54 rules in 37 ms. Remains 627 /654 variables (removed 27) and now considering 1030/1607 (removed 577) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2025-05-29 21:50:03] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:04] [INFO ] Implicit Places using invariants in 926 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 928 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/654 places, 1030/1607 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 978 ms. Remains : 626/654 places, 1030/1607 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 151 ms.
Stack based approach found an accepted trace after 92 steps with 1 reset with depth 87 and stack size 87 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-05 finished in 1384 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 U p1))))'
Support contains 4 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 654 transition count 1475
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 522 transition count 1475
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 291 place count 495 transition count 898
Iterating global reduction 0 with 27 rules applied. Total rules applied 318 place count 495 transition count 898
Applied a total of 318 rules in 46 ms. Remains 495 /654 variables (removed 159) and now considering 898/1607 (removed 709) transitions.
// Phase 1: matrix 898 rows 495 cols
[2025-05-29 21:50:04] [INFO ] Computed 27 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:05] [INFO ] Implicit Places using invariants in 776 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 778 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/654 places, 898/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 494 transition count 756
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 352 transition count 756
Applied a total of 284 rules in 15 ms. Remains 352 /494 variables (removed 142) and now considering 756/898 (removed 142) transitions.
// Phase 1: matrix 756 rows 352 cols
[2025-05-29 21:50:05] [INFO ] Computed 26 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:05] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-05-29 21:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:05] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:50:07] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/654 places, 756/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3003 ms. Remains : 352/654 places, 756/1607 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-06 finished in 3288 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(G(p0))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 626 transition count 1007
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 626 transition count 1007
Applied a total of 56 rules in 32 ms. Remains 626 /654 variables (removed 28) and now considering 1007/1607 (removed 600) transitions.
// Phase 1: matrix 1007 rows 626 cols
[2025-05-29 21:50:07] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:08] [INFO ] Implicit Places using invariants in 791 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 793 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 625/654 places, 1007/1607 transitions.
Applied a total of 0 rules in 16 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 841 ms. Remains : 625/654 places, 1007/1607 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-09 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 626 transition count 1007
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 626 transition count 1007
Applied a total of 56 rules in 33 ms. Remains 626 /654 variables (removed 28) and now considering 1007/1607 (removed 600) transitions.
// Phase 1: matrix 1007 rows 626 cols
[2025-05-29 21:50:08] [INFO ] Computed 27 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:09] [INFO ] Implicit Places using invariants in 828 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 830 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 625/654 places, 1007/1607 transitions.
Applied a total of 0 rules in 12 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 625/654 places, 1007/1607 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 1140 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(G(((!X(X(p0)) U p1) U X((X(p2)||p3)))))))'
Support contains 8 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 629 transition count 1076
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 629 transition count 1076
Applied a total of 50 rules in 33 ms. Remains 629 /654 variables (removed 25) and now considering 1076/1607 (removed 531) transitions.
// Phase 1: matrix 1076 rows 629 cols
[2025-05-29 21:50:10] [INFO ] Computed 27 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:10] [INFO ] Implicit Places using invariants in 756 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 758 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 628/654 places, 1076/1607 transitions.
Applied a total of 0 rules in 12 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 803 ms. Remains : 628/654 places, 1076/1607 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 18155 reset in 286 ms.
Product exploration explored 100000 steps with 18218 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 178 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/7 properties
// Phase 1: matrix 1076 rows 628 cols
[2025-05-29 21:50:12] [INFO ] Computed 26 invariants in 5 ms
[2025-05-29 21:50:12] [INFO ] State equation strengthened by 132 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 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 21:50:13] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 76 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 787 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2191ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 628 transition count 933
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 485 transition count 933
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 485 transition count 801
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 353 transition count 801
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 350 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 349 transition count 731
Applied a total of 558 rules in 40 ms. Remains 349 /628 variables (removed 279) and now considering 731/1076 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 349/628 places, 731/1076 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 951986 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 951986 steps, saw 729315 distinct states, run finished after 3009 ms. (steps per millisecond=316 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2025-05-29 21:50:18] [INFO ] Computed 26 invariants in 11 ms
[2025-05-29 21:50:18] [INFO ] State equation strengthened by 132 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) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/349 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 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) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/349 variables, 13/26 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 21:50:18] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 731/1080 variables, 349/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1080 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 8 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2025-05-29 21:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:19] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-05-29 21:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:50:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:50:21] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:50:21] [INFO ] Redundant transitions in 8 ms returned []
Running 719 sub problems to find dead transitions.
[2025-05-29 21:50:21] [INFO ] Invariant cache hit.
[2025-05-29 21:50:21] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:28] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:28] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:29] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (OVERLAPS) 731/1080 variables, 349/378 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 132/510 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:49] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:49] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:50] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:50] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:50] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:50] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 516 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:17] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:17] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1080 variables, and 37 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/349 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62132 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 22 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2025-05-29 21:51:21] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:51:21] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 21:51:21] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 6 ms returned sat
[2025-05-29 21:51:21] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 21:51:21] [INFO ] After 227ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 21:51:21] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F p0), (F p3), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 617 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
// Phase 1: matrix 1076 rows 628 cols
[2025-05-29 21:51:23] [INFO ] Computed 26 invariants in 10 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 21:51:23] [INFO ] [Real]Absence check using 14 positive place invariants in 87 ms returned sat
[2025-05-29 21:51:24] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 232 ms returned sat
[2025-05-29 21:51:38] [INFO ] [Real]Absence check using state equation in 14320 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 8 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 12 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2025-05-29 21:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:51:39] [INFO ] Implicit Places using invariants in 627 ms returned []
[2025-05-29 21:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:51:39] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:51:43] [INFO ] Implicit Places using invariants and state equation in 4852 ms returned []
Implicit Place search using SMT with State Equation took 5483 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2025-05-29 21:51:43] [INFO ] Invariant cache hit.
[2025-05-29 21:51:43] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:56] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:56] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:57] [INFO ] Deduced a trap composed of 97 places in 310 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:57] [INFO ] Deduced a trap composed of 71 places in 313 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:58] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:58] [INFO ] Deduced a trap composed of 84 places in 323 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:58] [INFO ] Deduced a trap composed of 97 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 21:51:59] [INFO ] Deduced a trap composed of 123 places in 330 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:04] [INFO ] Deduced a trap composed of 110 places in 327 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:05] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:11] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:12] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 62 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 38 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:18] [INFO ] Deduced a trap composed of 71 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 21:52:19] [INFO ] Deduced a trap composed of 84 places in 311 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:19] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:25] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:25] [INFO ] Deduced a trap composed of 71 places in 314 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:26] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:27] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:37] [INFO ] Deduced a trap composed of 73 places in 326 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:38] [INFO ] Deduced a trap composed of 84 places in 316 ms of which 73 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1704 variables, and 47 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Finished structural reductions in LTL mode , in 1 iterations and 65936 ms. Remains : 628/628 places, 1076/1076 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 178 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 515 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/7 properties
[2025-05-29 21:52:45] [INFO ] Invariant cache hit.
[2025-05-29 21:52:45] [INFO ] State equation strengthened by 132 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 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 21:52:45] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 66 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 787 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2112ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 628 transition count 933
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 485 transition count 933
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 485 transition count 801
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 353 transition count 801
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 350 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 349 transition count 731
Applied a total of 558 rules in 36 ms. Remains 349 /628 variables (removed 279) and now considering 731/1076 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 349/628 places, 731/1076 transitions.
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1046017 steps, run visited all 1 properties in 2987 ms. (steps per millisecond=350 )
Probabilistic random walk after 1046017 steps, saw 798881 distinct states, run finished after 2990 ms. (steps per millisecond=349 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p1 p3))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F p2), (F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p3)))]
Knowledge based reduction with 16 factoid took 719 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
[2025-05-29 21:52:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 21:52:52] [INFO ] [Real]Absence check using 14 positive place invariants in 79 ms returned sat
[2025-05-29 21:52:52] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 363 ms returned sat
[2025-05-29 21:53:07] [INFO ] [Real]Absence check using state equation in 14204 ms returned unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 18246 reset in 298 ms.
Product exploration explored 100000 steps with 18147 reset in 317 ms.
Built C files in :
/tmp/ltsmin7373401822836344520
[2025-05-29 21:53:08] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7373401822836344520
Running compilation step : cd /tmp/ltsmin7373401822836344520;'/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 1727 ms.
Running link step : cd /tmp/ltsmin7373401822836344520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7373401822836344520;'/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/stateBased15098988500474580120.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 180671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 629 transition count 1076
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 629 transition count 1076
Applied a total of 50 rules in 33 ms. Remains 629 /654 variables (removed 25) and now considering 1076/1607 (removed 531) transitions.
// Phase 1: matrix 1076 rows 629 cols
[2025-05-29 21:53:10] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:11] [INFO ] Implicit Places using invariants in 779 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 784 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 628/654 places, 1076/1607 transitions.
Applied a total of 0 rules in 19 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 836 ms. Remains : 628/654 places, 1076/1607 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Anderson-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 342 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
// Phase 1: matrix 1076 rows 628 cols
[2025-05-29 21:53:12] [INFO ] Computed 26 invariants in 6 ms
[2025-05-29 21:53:12] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 589/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/617 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/628 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 2 solved, 1 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 1/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 787 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1625ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 628 transition count 933
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 485 transition count 933
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 485 transition count 801
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 353 transition count 801
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 350 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 349 transition count 731
Applied a total of 558 rules in 37 ms. Remains 349 /628 variables (removed 279) and now considering 731/1076 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 349/628 places, 731/1076 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23652 steps (4 resets) in 28 ms. (815 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 3 factoid took 287 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 17 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2025-05-29 21:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:15] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-05-29 21:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:53:21] [INFO ] Implicit Places using invariants and state equation in 5457 ms returned []
Implicit Place search using SMT with State Equation took 6107 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2025-05-29 21:53:21] [INFO ] Invariant cache hit.
[2025-05-29 21:53:21] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:32] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:33] [INFO ] Deduced a trap composed of 84 places in 311 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:33] [INFO ] Deduced a trap composed of 84 places in 326 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:37] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:39] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:41] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:41] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:42] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:42] [INFO ] Deduced a trap composed of 71 places in 290 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:42] [INFO ] Deduced a trap composed of 71 places in 301 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:43] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:43] [INFO ] Deduced a trap composed of 71 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 21:53:43] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:49] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 60 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 40 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:04] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:08] [INFO ] Deduced a trap composed of 84 places in 332 ms of which 69 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1704 variables, and 42 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in LTL mode , in 1 iterations and 66505 ms. Remains : 628/628 places, 1076/1076 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2025-05-29 21:54:22] [INFO ] Invariant cache hit.
[2025-05-29 21:54:22] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 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) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 787 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 628 transition count 933
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 485 transition count 933
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 485 transition count 801
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 353 transition count 801
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 553 place count 350 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 556 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 349 transition count 731
Applied a total of 558 rules in 43 ms. Remains 349 /628 variables (removed 279) and now considering 731/1076 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 349/628 places, 731/1076 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 58824 steps, run visited all 1 properties in 141 ms. (steps per millisecond=417 )
Probabilistic random walk after 58824 steps, saw 48607 distinct states, run finished after 141 ms. (steps per millisecond=417 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 220 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 628 transition count 1076
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 142 place count 628 transition count 1076
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 274 place count 628 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 0 ms
Applied a total of 278 rules in 74 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:54:25] [INFO ] Redundant transitions in 10 ms returned []
Running 1018 sub problems to find dead transitions.
// Phase 1: matrix 1030 rows 626 cols
[2025-05-29 21:54:25] [INFO ] Computed 26 invariants in 10 ms
[2025-05-29 21:54:25] [INFO ] State equation strengthened by 252 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:36] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:36] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:36] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:36] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:36] [INFO ] Deduced a trap composed of 28 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:54:37] [INFO ] Deduced a trap composed of 49 places in 289 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:37] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:38] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:38] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:38] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:38] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:38] [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:54:39] [INFO ] Deduced a trap composed of 26 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 21:54:39] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:40] [INFO ] Deduced a trap composed of 28 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:54:40] [INFO ] Deduced a trap composed of 26 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 21:54:43] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:45] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 50 ms to minimize.
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 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 TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 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 TDEAD490 is UNSAT
Problem TDEAD491 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 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 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 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 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 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 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 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 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 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 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 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 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
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:47] [INFO ] Deduced a trap composed of 48 places in 283 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 19/45 constraints. Problems are: Problem set: 274 solved, 744 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:51] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:52] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:52] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:54:52] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 49 constraints, problems are : Problem set: 274 solved, 744 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 274 solved, 744 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 23/23 constraints. Problems are: Problem set: 274 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/23 constraints. Problems are: Problem set: 274 solved, 744 unsolved
At refinement iteration 2 (OVERLAPS) 274/626 variables, 14/37 constraints. Problems are: Problem set: 274 solved, 744 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 12/49 constraints. Problems are: Problem set: 274 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1656 variables, and 49 constraints, problems are : Problem set: 274 solved, 744 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 274 solved, 744 unsolved
Search for dead transitions found 274 dead transitions in 60408ms
Found 274 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 274 transitions
Dead transitions reduction (with SMT) removed 274 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 626/628 places, 756/1076 transitions.
Graph (complete) has 1991 edges and 626 vertex of which 352 are kept as prefixes of interest. Removing 274 places using SCC suffix rule.3 ms
Discarding 274 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 352 /626 variables (removed 274) and now considering 756/756 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/628 places, 756/1076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60522 ms. Remains : 352/628 places, 756/1076 transitions.
Built C files in :
/tmp/ltsmin18353819322013746094
[2025-05-29 21:55:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18353819322013746094
Running compilation step : cd /tmp/ltsmin18353819322013746094;'/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 1753 ms.
Running link step : cd /tmp/ltsmin18353819322013746094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18353819322013746094;'/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/stateBased4699507820275583929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1030
Applied a total of 4 rules in 34 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2025-05-29 21:55:41] [INFO ] Computed 26 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:55:41] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-05-29 21:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:55:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:55:46] [INFO ] Implicit Places using invariants and state equation in 4247 ms returned []
Implicit Place search using SMT with State Equation took 4935 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2025-05-29 21:55:46] [INFO ] Invariant cache hit.
[2025-05-29 21:55:46] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:55:58] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:02] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:02] [INFO ] Deduced a trap composed of 84 places in 404 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:03] [INFO ] Deduced a trap composed of 71 places in 296 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:04] [INFO ] Deduced a trap composed of 84 places in 319 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:08] [INFO ] Deduced a trap composed of 60 places in 329 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:09] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:11] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:11] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:12] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:13] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 69 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 37 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:20] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:22] [INFO ] Deduced a trap composed of 84 places in 317 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:31] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:56:32] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 64 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1656 variables, and 41 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Starting structural reductions in LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65296 ms. Remains : 626/628 places, 1030/1076 transitions.
Built C files in :
/tmp/ltsmin11266001970885557095
[2025-05-29 21:56:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11266001970885557095
Running compilation step : cd /tmp/ltsmin11266001970885557095;'/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 1668 ms.
Running link step : cd /tmp/ltsmin11266001970885557095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11266001970885557095;'/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/stateBased6636487620062156001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 21:57:01] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:57:01] [INFO ] Flatten gal took : 25 ms
[2025-05-29 21:57:01] [INFO ] Time to serialize gal into /tmp/LTL2954128556353605434.gal : 4 ms
[2025-05-29 21:57:01] [INFO ] Time to serialize properties into /tmp/LTL7636149702919391316.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/LTL2954128556353605434.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8256865897441866969.hoa' '-atoms' '/tmp/LTL7636149702919391316.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/LTL7636149702919391316.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8256865897441866969.hoa
Detected timeout of ITS tools.
[2025-05-29 21:57:16] [INFO ] Flatten gal took : 25 ms
[2025-05-29 21:57:16] [INFO ] Flatten gal took : 24 ms
[2025-05-29 21:57:16] [INFO ] Time to serialize gal into /tmp/LTL753143126934301994.gal : 5 ms
[2025-05-29 21:57:16] [INFO ] Time to serialize properties into /tmp/LTL460799230395422817.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/LTL753143126934301994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL460799230395422817.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...273
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((F((G("((next_1!=1)||(ncs_0_9!=1))"))||(("(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_8!=1)))")&&(X("((next_1!=1)...216
Formula 0 simplified : XXXF(!"((next_15==0)||(ncs_3_2==0))" | G(F!"((next_1!=1)||(ncs_0_9!=1))" & (!"(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_...200
Detected timeout of ITS tools.
[2025-05-29 21:57:31] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:57:31] [INFO ] Applying decomposition
[2025-05-29 21:57:31] [INFO ] Flatten gal took : 29 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/graph18262989527609450104.txt' '-o' '/tmp/graph18262989527609450104.bin' '-w' '/tmp/graph18262989527609450104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18262989527609450104.bin' '-l' '-1' '-v' '-w' '/tmp/graph18262989527609450104.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:57:31] [INFO ] Decomposing Gal with order
[2025-05-29 21:57:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:57:31] [INFO ] Removed a total of 1923 redundant transitions.
[2025-05-29 21:57:32] [INFO ] Flatten gal took : 55 ms
[2025-05-29 21:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 28 ms.
[2025-05-29 21:57:32] [INFO ] Time to serialize gal into /tmp/LTL9920370596960356083.gal : 10 ms
[2025-05-29 21:57:32] [INFO ] Time to serialize properties into /tmp/LTL11740714567520783333.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/LTL9920370596960356083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11740714567520783333.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(G((F((G("((i1.i1.u0.next_1!=1)||(i2.u93.ncs_0_9!=1))"))||(("(((i1.i1.u5.next_12!=1)||(i16.u261.ncs_6_11!=1))||((i1.i1.u5.next...306
Formula 0 simplified : XXXF(!"((i1.i1.u6.next_15==0)||(i1.i2.u110.ncs_3_2==0))" | G(F!"((i1.i1.u0.next_1!=1)||(i2.u93.ncs_0_9!=1))" & (!"(((i1.i1.u5.next_1...290
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLFireability-12 finished in 276522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(((p2 U p3)&&p1))))))'
Support contains 5 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 654 transition count 1476
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 523 transition count 1476
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 288 place count 497 transition count 900
Iterating global reduction 0 with 26 rules applied. Total rules applied 314 place count 497 transition count 900
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 316 place count 496 transition count 899
Applied a total of 316 rules in 51 ms. Remains 496 /654 variables (removed 158) and now considering 899/1607 (removed 708) transitions.
// Phase 1: matrix 899 rows 496 cols
[2025-05-29 21:57:47] [INFO ] Computed 27 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:47] [INFO ] Implicit Places using invariants in 733 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 734 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/654 places, 899/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 495 transition count 757
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 353 transition count 757
Applied a total of 284 rules in 19 ms. Remains 353 /495 variables (removed 142) and now considering 757/899 (removed 142) transitions.
// Phase 1: matrix 757 rows 353 cols
[2025-05-29 21:57:47] [INFO ] Computed 26 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:48] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-05-29 21:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:48] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:57:50] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 353/654 places, 757/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2957 ms. Remains : 353/654 places, 757/1607 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0), (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 166 ms.
Stack based approach found an accepted trace after 184 steps with 0 reset with depth 185 and stack size 185 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-13 finished in 3403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1607/1607 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 654 transition count 1475
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 522 transition count 1475
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 292 place count 494 transition count 875
Iterating global reduction 0 with 28 rules applied. Total rules applied 320 place count 494 transition count 875
Applied a total of 320 rules in 39 ms. Remains 494 /654 variables (removed 160) and now considering 875/1607 (removed 732) transitions.
// Phase 1: matrix 875 rows 494 cols
[2025-05-29 21:57:50] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:51] [INFO ] Implicit Places using invariants in 705 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 706 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/654 places, 875/1607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 12 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2025-05-29 21:57:51] [INFO ] Computed 26 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:51] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-05-29 21:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:57:53] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/654 places, 732/1607 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2714 ms. Remains : 350/654 places, 732/1607 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 245 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1053678 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1053678 steps, saw 809549 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2025-05-29 21:57:56] [INFO ] Invariant cache hit.
[2025-05-29 21:57:56] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 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) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 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 21:57:57] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 70 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/350 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 732/1082 variables, 350/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 132/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1082 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1082 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1324ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 19 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045164 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045164 steps, saw 800487 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2025-05-29 21:58:01] [INFO ] Computed 26 invariants in 12 ms
[2025-05-29 21:58:01] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 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) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2025-05-29 21:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:58:02] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-05-29 21:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:58:02] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:58:04] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:58:04] [INFO ] Redundant transitions in 8 ms returned []
Running 719 sub problems to find dead transitions.
[2025-05-29 21:58:04] [INFO ] Invariant cache hit.
[2025-05-29 21:58:04] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:58:10] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:58:10] [INFO ] Deduced a trap composed of 47 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:58:11] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:58:12] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:58:13] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (OVERLAPS) 731/1080 variables, 349/380 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 132/512 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 512 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:58:54] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1080 variables, and 32 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/349 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62179 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 9 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2025-05-29 21:59:04] [INFO ] Computed 26 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:59:04] [INFO ] After 45ms 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 21:59:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 21:59:04] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 8 ms returned sat
[2025-05-29 21:59:04] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 21:59:04] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 21:59:04] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 368 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 14 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2025-05-29 21:59:04] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:05] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-05-29 21:59:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:05] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:59:06] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:59:06] [INFO ] Redundant transitions in 8 ms returned []
Running 720 sub problems to find dead transitions.
[2025-05-29 21:59:06] [INFO ] Invariant cache hit.
[2025-05-29 21:59:06] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:13] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:14] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:14] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:15] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:16] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:17] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:17] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:17] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:18] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:18] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:21] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:21] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:32] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:37] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 29 ms to minimize.
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32404 ms. Remains : 350/350 places, 732/732 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1048150 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 1
Probabilistic random walk after 1048150 steps, saw 805484 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
[2025-05-29 21:59:40] [INFO ] Invariant cache hit.
[2025-05-29 21:59:40] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 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) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 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 21:59:40] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 70 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/350 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 732/1082 variables, 350/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 132/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1082 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1082 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 17 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1050520 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1050520 steps, saw 804537 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2025-05-29 21:59:44] [INFO ] Computed 26 invariants in 11 ms
[2025-05-29 21:59:44] [INFO ] State equation strengthened by 132 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 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) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 913ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2025-05-29 21:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:46] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-05-29 21:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:59:47] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:59:47] [INFO ] Redundant transitions in 10 ms returned []
Running 719 sub problems to find dead transitions.
[2025-05-29 21:59:47] [INFO ] Invariant cache hit.
[2025-05-29 21:59:47] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:54] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:54] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:55] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:55] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:59:56] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (OVERLAPS) 731/1080 variables, 349/380 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 132/512 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 512 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:00:37] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1080 variables, and 32 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/349 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/719 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62263 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 8 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2025-05-29 22:00:48] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 22:00:48] [INFO ] After 33ms 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 22:00:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 22:00:48] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 9 ms returned sat
[2025-05-29 22:00:48] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 22:00:48] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 22:00:48] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 254 ms.
Built C files in :
/tmp/ltsmin9864682801287900135
[2025-05-29 22:00:49] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2025-05-29 22:00:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:00:49] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2025-05-29 22:00:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:00:49] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2025-05-29 22:00:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:00:49] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9864682801287900135
Running compilation step : cd /tmp/ltsmin9864682801287900135;'/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 1882 ms.
Running link step : cd /tmp/ltsmin9864682801287900135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9864682801287900135;'/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/stateBased5093555067282238164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 8 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2025-05-29 22:01:04] [INFO ] Computed 26 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:01:04] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-05-29 22:01:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:01:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 22:01:06] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:01:06] [INFO ] Redundant transitions in 9 ms returned []
Running 720 sub problems to find dead transitions.
[2025-05-29 22:01:06] [INFO ] Invariant cache hit.
[2025-05-29 22:01:06] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:12] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:13] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:13] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:15] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:16] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:16] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:16] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:16] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:17] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:17] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:20] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:20] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:32] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:01:36] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 28 ms to minimize.
SMT process timed out in 30428ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32379 ms. Remains : 350/350 places, 732/732 transitions.
Built C files in :
/tmp/ltsmin4394202823339292585
[2025-05-29 22:01:36] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2025-05-29 22:01:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:01:36] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2025-05-29 22:01:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:01:36] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2025-05-29 22:01:36] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:01:36] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4394202823339292585
Running compilation step : cd /tmp/ltsmin4394202823339292585;'/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 1898 ms.
Running link step : cd /tmp/ltsmin4394202823339292585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4394202823339292585;'/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/stateBased379590998324722578.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 22:01:51] [INFO ] Flatten gal took : 18 ms
[2025-05-29 22:01:51] [INFO ] Flatten gal took : 18 ms
[2025-05-29 22:01:51] [INFO ] Time to serialize gal into /tmp/LTL14060930714072300325.gal : 4 ms
[2025-05-29 22:01:51] [INFO ] Time to serialize properties into /tmp/LTL8404236047808898085.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/LTL14060930714072300325.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8840847734302448217.hoa' '-atoms' '/tmp/LTL8404236047808898085.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/LTL8404236047808898085.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8840847734302448217.hoa
Detected timeout of ITS tools.
[2025-05-29 22:02:06] [INFO ] Flatten gal took : 17 ms
[2025-05-29 22:02:06] [INFO ] Flatten gal took : 17 ms
[2025-05-29 22:02:06] [INFO ] Time to serialize gal into /tmp/LTL17202350106569787373.gal : 3 ms
[2025-05-29 22:02:06] [INFO ] Time to serialize properties into /tmp/LTL2817078094591025050.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/LTL17202350106569787373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2817078094591025050.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 : !((F(G("((next_18==0)||(ncs_9_2==0))"))))
Formula 0 simplified : GF!"((next_18==0)||(ncs_9_2==0))"
Detected timeout of ITS tools.
[2025-05-29 22:02:21] [INFO ] Flatten gal took : 20 ms
[2025-05-29 22:02:21] [INFO ] Applying decomposition
[2025-05-29 22:02:21] [INFO ] Flatten gal took : 17 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/graph7874517573595467307.txt' '-o' '/tmp/graph7874517573595467307.bin' '-w' '/tmp/graph7874517573595467307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7874517573595467307.bin' '-l' '-1' '-v' '-w' '/tmp/graph7874517573595467307.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:02:21] [INFO ] Decomposing Gal with order
[2025-05-29 22:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:02:22] [INFO ] Removed a total of 1372 redundant transitions.
[2025-05-29 22:02:22] [INFO ] Flatten gal took : 46 ms
[2025-05-29 22:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 13 ms.
[2025-05-29 22:02:22] [INFO ] Time to serialize gal into /tmp/LTL2951858261201195246.gal : 5 ms
[2025-05-29 22:02:22] [INFO ] Time to serialize properties into /tmp/LTL6828773980838560745.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/LTL2951858261201195246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6828773980838560745.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.i0.u12.next_18==0)||(i13.u82.ncs_9_2==0))"))))
Formula 0 simplified : GF!"((i2.i0.u12.next_18==0)||(i13.u82.ncs_9_2==0))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 286604 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(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' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
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)))'
[2025-05-29 22:02:37] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3141363492836650204
[2025-05-29 22:02:37] [INFO ] Too many transitions (1607) to apply POR reductions. Disabling POR matrices.
[2025-05-29 22:02:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3141363492836650204
Running compilation step : cd /tmp/ltsmin3141363492836650204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-29 22:02:37] [INFO ] Applying decomposition
[2025-05-29 22:02:37] [INFO ] Flatten gal took : 40 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/graph117389593876427140.txt' '-o' '/tmp/graph117389593876427140.bin' '-w' '/tmp/graph117389593876427140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph117389593876427140.bin' '-l' '-1' '-v' '-w' '/tmp/graph117389593876427140.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:02:37] [INFO ] Decomposing Gal with order
[2025-05-29 22:02:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:02:37] [INFO ] Removed a total of 2934 redundant transitions.
[2025-05-29 22:02:37] [INFO ] Flatten gal took : 164 ms
[2025-05-29 22:02:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 239 labels/synchronizations in 35 ms.
[2025-05-29 22:02:38] [INFO ] Time to serialize gal into /tmp/LTLFireability16823226612161061395.gal : 10 ms
[2025-05-29 22:02:38] [INFO ] Time to serialize properties into /tmp/LTLFireability10952242101166181773.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/LTLFireability16823226612161061395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10952242101166181773.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...278
Read 3 LTL properties
Checking formula 0 : !((G((F("(((i0.i0.u1.next_0==0)||(u3.ncs_1_8==0))&&((i7.u0.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(i0.i0.u2.p2_0_3==0)))"))&&(F("((i0.i1.u6...195
Formula 0 simplified : F(G!"(((i0.i0.u1.next_0==0)||(u3.ncs_1_8==0))&&((i7.u0.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(i0.i0.u2.p2_0_3==0)))" | G!"((i0.i1.u6.nex...187
Compilation finished in 3038 ms.
Running link step : cd /tmp/ltsmin3141363492836650204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3141363492836650204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3141363492836650204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3141363492836650204;'/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(X([](((LTLAPp2==true)&&<>(((!(LTLAPp3==true)&&X(!(LTLAPp4==true)))||[](!(LTLAPp4==true)))))))))' '--buchi-type=spotba'
LTSmin run took 16397 ms.
FORMULA Anderson-PT-12-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3141363492836650204;'/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' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3141363492836650204;'/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' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin3141363492836650204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-29 22:29:52] [INFO ] Applying decomposition
[2025-05-29 22:29:53] [INFO ] Flatten gal took : 999 ms
[2025-05-29 22:29:54] [INFO ] Decomposing Gal with order
[2025-05-29 22:29:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:29:55] [INFO ] Removed a total of 1958 redundant transitions.
[2025-05-29 22:29:55] [INFO ] Flatten gal took : 1176 ms
[2025-05-29 22:29:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 493 labels/synchronizations in 210 ms.
[2025-05-29 22:29:56] [INFO ] Time to serialize gal into /tmp/LTLFireability8548805262643338756.gal : 29 ms
[2025-05-29 22:29:56] [INFO ] Time to serialize properties into /tmp/LTLFireability14909912193353647091.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/LTLFireability8548805262643338756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14909912193353647091.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 2 LTL properties
Checking formula 0 : !((G((F("(((u13.next_0==0)||(u10.ncs_1_8==0))&&((u14.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(u9.p2_0_3==0)))"))&&(F("((u13.next_12==0)||(u1...174
Formula 0 simplified : F(G!"(((u13.next_0==0)||(u10.ncs_1_8==0))&&((u14.slot_F.F.F.T.F.F.F.F.F.F.F.F==0)||(u9.p2_0_3==0)))" | G!"((u13.next_12==0)||(u1.ncs...166

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

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